A class of least-squares filtering and identification algorithms with systolic array architectures
S. Kalson, K. Yao · IEEE Transactions on Information Theory · 1991
A unified approach is presented for deriving a large class of new and previously known time and order recursive least-squares algorithms with systolic array architectures, suitable for high throughput rate and VLSI implementations of space-time filtering and system identification problems. The geometrical derivation given is unique in that no assumption is made concerning the rank of the sample data correlation matrix. This method utilizes and extends the concept of oblique projections, as used previously in the derivations of the least-squares lattice algorithms. Both the growing and sliding memory, exponentially weighted least-squares criteria are considered.>