Systolic array processing for order and time recursive generalized least-squares estimation
S. Kalson, K. Yao · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1986
In this paper we present a geometric formalism by which it is possible to derive a large family of least-squares algorithms for systolic arrays. The geometric formalism is based upon that introduced by Shensal and Lee, et al., in their derivation of the Least-Squares Lattice Algorithm. Specifically, their time update theorem is used along with an order update theorem to derive general vector time and order recursion relations. As a result, a large number of new and previously known time and order recursive least-squares algorithms for systolic arrays can be derived in a unified manner.