Stabilization of fast recursive least-squares transversal filters for adaptive filtering
- 24 March 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 12, 403-406
- https://doi.org/10.1109/icassp.1987.1169711
Abstract
This paper investigates the numerical stability of the well-known Fast Transversal Filters algorithms. Two different modes of divergence are indicated with an effort to mathematically explain the reason of the appearance of each mode. An original stabilization method is thus introduced. It basically consists in introducing redundancy in the algorithm by computing some quantity in two different ways. The difference of the two values (nonzero because of finite precision) is fed back to the algorithm in order to correct it. The stabilized algorithm requires some more operations but it is always linear in the order of the filter per iteration.Keywords
This publication has 8 references indexed in Scilit:
- Stabilization of fast recursive least-squares transversal filters for adaptive filteringPublished 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
- A study of fast transversal algorithms: Application to the acoustic echo cancellation for audioconferenceSignal Processing, 1986
- 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
- A fast sequential algorithm for least-squares filtering and predictionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1983
- Fast calculation of gain matrices for recursive estimation schemesInternational Journal of Control, 1978