Due to the versatility as well as its ease of implementation, the Fast Transversal Filters algorithm is attractive for many adaptive filtering applications. However, it is not widely used because of its undesirable tendency to diverge when operating in finite precision arithmetic. To compensate, modifications to the algorithm have been introduced that are either occasional (performed when a predefined condition(s) is violated) or structured as part of the normal update iteration. However, in neither case is any confidence explicitly given that the computed parameters are in fact close to the desired ones. Here, we introduce a time invariant parameter that provides the user with more flexibility in establishing confidence in the consistency of the updated filter parameters. Additionally, we provide evidence through the introduction of a hybrid FTF algorithm that when sufficient time is given prior to catastrophic divergence, the update parameters of the FTF algorithm can be adjusted so that consistency can be acquired and maintained.
@article{bwmeta1.element.bwnjournal-article-amcv11i5p1203bwm,
author = {Bunch, James and Le Borne, Richard and Proudler, Ian},
title = {Measuring and maintaining consistency: a hybrid FTF algorithm},
journal = {International Journal of Applied Mathematics and Computer Science},
volume = {11},
year = {2001},
pages = {1203-1216},
zbl = {1001.93054},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-amcv11i5p1203bwm}
}
Bunch, James; Le Borne, Richard; Proudler, Ian. Measuring and maintaining consistency: a hybrid FTF algorithm. International Journal of Applied Mathematics and Computer Science, Tome 11 (2001) pp. 1203-1216. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-amcv11i5p1203bwm/
[000] Chaitin-Chatelin F. and Frayssé V. (1996): Lectures on FinitePrecision Computations. - Philadelphia: SIAM. | Zbl 0846.65020
[001] Cioffi J.M. and Kailath T. (1984): Fast, recursive-least-squares transversalfilters for adaptive filtering. - IEEE Trans. s Acoust. Speech Sign.Process., Vol.32, No.2, pp.304-337. | Zbl 0577.93073
[002] Haykin S. (1991): Adaptive Filter Theory, 2nd Edn. - Englewood Cliffs, NJ: Prentice-Hall. | Zbl 0723.93070
[003] Lin D. (1984): On digital implementation of the fast Kalman algorithms. - IEEE Trans. Acoust. Speech Sign. Process., Vol.32,No.5, pp.998-1005. | Zbl 0576.65061
[004] Regalia P. (1992): Numerical stability issues in fast least-squaresadaptation algorithms. - Opt. Eng., Vol.31, No.6, pp.1144-1152.
[005] Slock D.T.M. and Kailath T. (1991): Numerically stable fast transversalfilters for recursive least squares adaptive filtering. - IEEE Trans. Signal Process., Vol.39, No.1, pp.92-114. | Zbl 0728.93085
[006] Slock D.T.M. and Kailath T. (1992): Backward consistency concept andround-off error propagation dynamics in recursive least-squares algorithms. - Opt. Eng., Vol.31, No.6, pp.1153-1169.