Generalized fast convolution implementations of adaptive filters

The generalized frequency domain adaptive filtering (GFDAF) algorithms are efficient implementations of the block least mean square (LMS) algorithm when small block sizes, compared to the number of adaptive coefficients, are required. The behavior of these algorithms is investigated and an examination is made of the use of a self-orthogonalization procedure and of an unconstrained form of the algorithm. Computer simulations are presented verifying the behavior of these methods, and comparing their performance to that of the subband filtering method for the acoustic echo cancelling application.<<ETX>>

[1]  Martin Vetterli,et al.  Adaptive filtering in sub-bands , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

[2]  Walter Kellermann,et al.  Analysis and design of multirate systems for cancellation of acoustical echoes , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

[3]  A. Gray,et al.  Unconstrained frequency-domain adaptive filter , 1982 .

[4]  S. Mitra,et al.  A unified approach to time- and frequency-domain realization of FIR adaptive digital filters , 1983 .

[5]  Piet Sommen.  Partitioned frequency domain adaptive filters , 1989, Twenty-Third Asilomar Conference on Signals, Systems and Computers, 1989..