Share Email Print

Optical Engineering

Numerical stability issues in fast least-squares adaptation algorithms
Author(s): Phillip A. Regalia
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The concepts of backward 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 mechanisms is developed, allowing the numerical stability of new or existing algorithms to be ascertained withoutthe technical labor previously thought necessary. The key findings show that arithmetic instability is not a fundamental feature of fast least-squares algorithms. Rather, unstable propagation can only derive from the violation of backward consistency constraints. The absence of minimality (in the system theory sense) is identified as the principal culprit in this regard, although the issue of stability for predictable sequences also plays an intriguing role. The concepts are illustrated for some popularly used algorithms, and order-recursive algorithms are confirmed to have intrinsic advantages over their transversal counterparts.

Paper Details

Date Published: 1 June 1992
PDF: 9 pages
Opt. Eng. 31(6) doi: 10.1117/12.57512
Published in: Optical Engineering Volume 31, Issue 6
Show Author Affiliations
Phillip A. Regalia, Institut National des Telecommunications (France)

© SPIE. Terms of Use
Back to Top