论文信息 - Stabilization of fast recursive least-squares transversal filters for adaptive filtering

Stabilization of fast recursive least-squares transversal filters for adaptive filtering

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.

J.-L. Botto

[1] Lennart Ljung,et al. Error propagation properties of recursive least-squares adaptation algorithms , 1985, Autom..

[2] L. Ljung,et al. Fast calculation of gain matrices for recursive estimation schemes , 1978 .

[3] D. Lin. On digital implementation of the fast kalman algorithms , 1984 .

[4] T. Kailath,et al. Fast, recursive-least-squares transversal filters for adaptive filtering , 1984 .

[5] George Carayannis,et al. A fast sequential algorithm for least-squares filtering and prediction , 1983 .

[6] P. Fabre,et al. Fast recursive least-squares algorithms: Preventing divergence , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.