Improvement of the fast recursive least-squares algorithms via normalization: A comparative study
- 1 April 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 34 (2) , 296-308
- https://doi.org/10.1109/tassp.1986.1164813
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the computational organization of fast sequential algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Fast Kalman type algorithms for sequential signal processingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Fast recursive least-squares algorithms: Preventing divergencePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Error propagation properties of recursive least-squares adaptation algorithmsAutomatica, 1985
- On digital implementation of the fast kalman algorithmsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- Fast, recursive-least-squares transversal filters for adaptive filteringIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- Least-squares adaptive lattice and transversal filters: A unified geometric theoryIEEE Transactions on Information Theory, 1984
- A fast sequential algorithm for least-squares filtering and predictionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1983
- Pure time updates for least squares lattice algorithmsIEEE Transactions on Automatic Control, 1983
- A unified treatment of fast algorithms for identification†International Journal of Control, 1982