Wideband algorithms versus narrowband algorithms for adaptive filtering in the DFT domain

Conference contribution
(Conference Contribution)


Publication Details

Author(s): Kellermann W, Buchner H
Editor(s): Matthews M.B.
Publication year: 2003
Volume: 2
Pages range: 1278-1282


Abstract


Adaptive filtering in the DFT domain is popular for its computational efficiency and its attractive convergence properties resulting from the applicability of the FFT and separate adaptation of individual DFT bins. Narrowband algorithms assume a complete decoupling of different frequency bins, which corresponds to assuming a circulant structure for the input data matrix. Wideband designs account for the difference between the actual Töplitz structure and the circulant structure by introducing additional constraints. In this contribution, we show that a wideband approach with rigorous implementation of appropriate constraints leads to highly efficient algorithms with excellent convergence properties. As examples we consider multichannel acoustic echo cancellation (MC-AEC) and blind source separation (BSS) of convolutive mixtures.



FAU Authors / FAU Editors

Kellermann, Walter Prof. Dr.-Ing.
Professur für Nachrichtentechnik


How to cite

APA:
Kellermann, W., & Buchner, H. (2003). Wideband algorithms versus narrowband algorithms for adaptive filtering in the DFT domain. In Matthews M.B. (Eds.), (pp. 1278-1282). Pacific Grove, CA, US.

MLA:
Kellermann, Walter, and Herbert Buchner. "Wideband algorithms versus narrowband algorithms for adaptive filtering in the DFT domain." Proceedings of the Conference Record of the Thirty-Seventh Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA Ed. Matthews M.B., 2003. 1278-1282.

BibTeX: 

Last updated on 2018-07-08 at 00:39