Share Email Print

Proceedings Paper

Comparative analysis regarding numerical concerns for recursive least squares lattice (RLSL) algorithms
Author(s): James R. Bunch; Richard C. LeBorne
Format Member Price Non-Member Price
PDF $14.40 $18.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

Much interest has been devoted to the numerical behavior of the Recursive Least Squares Lattice (RLSL) algorithms. Two types of updating schemes that are equivalent in exact arithmetic have been proposed previously: the direct and the indirect versions of the RLSL algorithm. However, the numerical behavior of these algorithms is quite different, the direct updating scheme being the more robust of the two. We provide the results from an arithmetic error analysis that uses first order approximation techniques to give arithmetic error effects which propagate in both time and order for two fast adaptive RLSL algorithms.

Paper Details

Date Published: 28 October 1994
PDF: 7 pages
Proc. SPIE 2296, Advanced Signal Processing: Algorithms, Architectures, and Implementations V, (28 October 1994); doi: 10.1117/12.190857
Show Author Affiliations
James R. Bunch, Univ. of California/San Diego (United States)
Richard C. LeBorne, Univ. of Tennessee/Chattanooga (United States)

Published in SPIE Proceedings Vol. 2296:
Advanced Signal Processing: Algorithms, Architectures, and Implementations V
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top