Share Email Print

Proceedings Paper

Systolic array processing for order and time recursive generalized least-squares estimation
Author(s): S. Kalson; K. Yao
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 4 January 1986
PDF: 11 pages
Proc. SPIE 0564, Real-Time Signal Processing VIII, (4 January 1986); doi: 10.1117/12.949700
Show Author Affiliations
S. Kalson, Jet Propulsion Lab (United States)
K. Yao, Univ. of Ca., Los Angeles (United States)

Published in SPIE Proceedings Vol. 0564:
Real-Time Signal Processing VIII
Keith Bromley; William J. Miceli, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?