DocumentCode
839517
Title
Square root covariance ladder algorithms
Author
Porat, Boaz ; Friedlander, Benjamin ; Morf, Martin
Author_Institution
Stanford University, Stanford, CA, USA
Volume
27
Issue
4
fYear
1982
fDate
8/1/1982 12:00:00 AM
Firstpage
813
Lastpage
829
Abstract
Square root normalized ladder algorithms provide an efficient recursive solution to the problem of multichannel autoregressive model fitting. A simplified derivation of the general update formulas for such ladder forms is presented, and is used to develop the growing memory and sliding memory covariance ladder algorithms. New ladder form realizations for the identified models are presented, leading to convenient methods for computing the model parameters from estimated reflection coefficients. A complete solution to the problem of possible singularity in the ladder update equations is also presented.
Keywords
Autoregressive processes; Ladder estimation; Least-squares methods; Adaptive signal processing; Control system synthesis; Equations; Information systems; Laboratories; Parameter estimation; Reflection; Signal processing algorithms; Speech processing; System identification;
fLanguage
English
Journal_Title
Automatic Control, IEEE Transactions on
Publisher
ieee
ISSN
0018-9286
Type
jour
DOI
10.1109/TAC.1982.1103018
Filename
1103018
Link To Document