DocumentCode
3047396
Title
Convergence models for adaptive gradient and least squares algorithms
Author
Honig, Michael L. ; Messerschmitt, David G.
Author_Institution
University of California, Berkeley, California
Volume
6
fYear
1981
fDate
29677
Firstpage
267
Lastpage
270
Abstract
A simple model characterizing the convergence properties of an adaptive digital lattice filter using gradient algorithms has been reported [1]. This model is extended to the least mean square (LMS) lattice joint process estimator, to the recursive least squares (LS) algorithms, and is compared with computer simulations. Interestingly, the LS models are more accurate than the previous LMS models. In addition, although the LS lattice consistently converges somewhat faster than the LMS lattice, they both exhibit similar behavior.
Keywords
Accuracy; Convergence; Equations; Fluctuations; Kalman filters; Lattices; Least squares approximation; Least squares methods; Predictive models; Statistics;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '81.
Type
conf
DOI
10.1109/ICASSP.1981.1171290
Filename
1171290
Link To Document