Measuring and Maintaining Consistency: a Hybrid Ftf Algorithm

• Autorzy: Bunch J. R. , Le Borne R. C. , Proudler I. K.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

FTF; numerical stability; consistency

PL

algorytmy; matematyka

• Wydawca: Oficyna Wydawnicza Uniwersytetu Zielonogórskiego
• Czasopismo: International Journal of Applied Mathematics and Computer Science
• Rocznik: 2001
• Tom: Vol. 11, no 5
• Strony: 1203--1216
• Opis fizyczny: Bibliogr. 7 poz., rys., tab., wykr.

Twórcy

autor

Bunch J. R.

autor

Le Borne R. C.

autor

Proudler I. K.

• Department of Mathematics, University of California San Diego, La Jolla, California 92093-0112, U.S.A,