Systolic array processing for order and time recursive generalized least-squares estimation

S. Kalson; K. Yao

doi:10.1117/12.949700

4 January 1986 Systolic array processing for order and time recursive generalized least-squares estimation

S. Kalson, K. Yao

Proceedings Volume 0564, Real-Time Signal Processing VIII; (1986) https://doi.org/10.1117/12.949700
Event: 29th Annual Technical Symposium, 1985, San Diego, United States

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.

Citation Download Citation

S. Kalson and 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); https://doi.org/10.1117/12.949700

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available