Recursive least squares lattice algorithms--A geometrical approach
- 1 June 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 26 (3), 695-702
- https://doi.org/10.1109/tac.1981.1102682
Abstract
Several time-recursive least squares algorithms have been developed in recent years. In this paper a geometrical formalism is defined which utilizes a nested family of metric spaces indexed by the data time interval. This approach leads to a simplified derivation of the so-called recursive least squares lattice algorithms (recursive in time and order). In particular, it is found that the resulting structure provides a single framework which encompasses an entire family of fairly complex algorithms, as well as providing geometrical insight into their behavior.Keywords
This publication has 8 references indexed in Scilit:
- Recursive square-root ladder estimation algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Application of Least Squares Lattice Algorithms to Adaptive EqualizationIEEE Transactions on Communications, 1981
- Application of Fast Kalman Estimation to Adaptive EqualizationIEEE Transactions on Communications, 1978
- Fast calculation of gain matrices for recursive estimation schemesInternational Journal of Control, 1978
- Stable and efficient lattice methods for linear predictionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- Linear Prediction of SpeechCommunication and Cybernetics, 1976
- On autocorrelation equations as applied to speech analysisIEEE Transactions on Audio and Electroacoustics, 1973
- System identification—A surveyAutomatica, 1971