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.
The block underdetermined covariance (BUC) fast transversal filter (FTF) algorithm for adaptive filtering
ASILOMAR 1992, 26th Asilomar IEEE Conference on Signals, Systems and Computers, October 26-28, 1992, Pacific Grove, USA
© 1992 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
PERMALINK : https://www.eurecom.fr/publication/589