The block underdetermined covariance (BUC) fast transversal filter (FTF) algorithm for adaptive filtering

Author

Stock, D.T.M.

Author_Institution

Eurecom Inst., Valbonne

fYear

1992

Firstpage

550

Abstract

Fast algorithms in transversal filter form (FTF) developed for an adaptive filtering strategy consisting of treating consecutive blocks of L data are discussed. The resulting BUC FTF algorithm can be situated in between the normalized least-mean-square (NLMS) algorithm for L=1 and one extreme case of the block-processing FTF algorithm for L=N. A projection mechanism onto a subspace of dimension L renders their convergence less sensitive to the coloring of the input signal spectrum than is the case for the NLMS algorithm. Their underdetermined LS character endows them with relatively fast tracking characteristics. Relations to existing algorithms and various implementations with varying degrees of complexity are also discussed

Keywords

adaptive filters; convergence; adaptive filtering; block underdetermined covariance; convergence; fast transversal filter; Adaptive filters; Covariance matrix; Decorrelation; Filtering algorithms; Finite impulse response filter; Iterative algorithms; Least squares approximation; Resonance light scattering; Stochastic processes; Transversal filters;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers, 1992. 1992 Conference Record of The Twenty-Sixth Asilomar Conference on

Conference_Location

Pacific Grove, CA

ISSN

1058-6393

Print_ISBN

0-8186-3160-0

Type

conf

DOI

10.1109/ACSSC.1992.269211

Filename

269211