Numerical stability issues in fast least-squares adaptive algorithms

Phillip A. Regalia

doi:10.1117/12.49760

1 December 1991 Numerical stability issues in fast least-squares adaptive algorithms

Phillip A. Regalia

Proceedings Volume 1565, Adaptive Signal Processing; (1991) https://doi.org/10.1117/12.49760
Event: San Diego, '91, 1991, San Diego, CA, United States

Abstract

The concepts of backwards consistency and minimality are shown to be the essential tools in studying error propagation in fast least-squares adaptive filters. A conceptual framework identifying the principal error propagation mechanism is developed, allowing the numerical stability of new or existing algorithms to be ascertained without the technical labor previously thought necessary. Order recursive algorithms are confirmed to have intrinsic advantages over their transversal counterparts.

Citation Download Citation

Phillip A. Regalia "Numerical stability issues in fast least-squares adaptive algorithms", Proc. SPIE 1565, Adaptive Signal Processing, (1 December 1991); https://doi.org/10.1117/12.49760

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