4 January 1986 Systolic array processing for order and time recursive generalized least-squares estimation
Author Affiliations +
Abstract
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.
© (1986) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
S. Kalson, K. Yao, "Systolic array processing for order and time recursive generalized least-squares estimation", Proc. SPIE 0564, Real-Time Signal Processing VIII, (4 January 1986); doi: 10.1117/12.949700; https://doi.org/10.1117/12.949700
PROCEEDINGS
11 PAGES


SHARE
RELATED CONTENT

A Systolic Array For Efficient Execution Of The Radon And...
Proceedings of SPIE (February 23 1988)
Two-Dimensional Adaptive Beamforming Techniques
Proceedings of SPIE (December 06 1989)
Systolic Array Processor Implementation
Proceedings of SPIE (July 30 1982)

Back to Top