Premium
Analysis of partitioned frequency‐domain LMS adaptive algorithm with application to a hands‐free telephone system echo canceller
Author(s) -
Estermann Pius G.,
Kaelin August,
Lindgren Allen G.
Publication year - 2000
Publication title -
international journal of adaptive control and signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.73
H-Index - 66
eISSN - 1099-1115
pISSN - 0890-6327
DOI - 10.1002/1099-1115(200009)14:6<587::aid-acs605>3.0.co;2-s
Subject(s) - adaptive filter , impulse response , finite impulse response , frequency domain , algorithm , block (permutation group theory) , echo (communications protocol) , computer science , infinite impulse response , active noise control , computational complexity theory , reduction (mathematics) , least mean squares filter , noise reduction , control theory (sociology) , filter (signal processing) , digital filter , mathematics , artificial intelligence , mathematical analysis , computer network , geometry , computer vision , control (management)
For adaptive filters with long impulse responses and requiring modelling by an FIR filter, algorithms incorporating computationally efficient DFT‐based adaptive block filters are the design of choice. The reduction in computational complexity is very significant in applications such as active noise control and the hands‐free telephone system echo cancellation problem where impulse responses of more than a 1000 samples are common. The performance of frequency‐domain adaptive algorithms is analysed and, when properly designed, shown to be equivalent to time‐domain algorithms with uncorrelated input signals. The design parameters include: block length, DFT length and partitioning of the impulse response. The study includes both constrained and unconstrained parameter adaptation. Guidelines to the design of partitioned frequency‐domain LMS (PFLMS) algorithms are given. Copyright © 2000 John Wiley & Sons, Ltd.