The generalized frequency-domain adaptive filtering algorithm as an approximation of the block recursive least-squares algorithm

Acoustic echo cancellation (AEC) is a well-known application of adaptive filters in communication acoustics. To implement AEC for multichannel reproduction systems, powerful adaptation algorithms like the generalized frequency-domain adaptive filtering (GFDAF) algorithm are required for satisfactory...

Full description

Saved in:
Bibliographic Details
Published in:EURASIP journal on advances in signal processing Vol. 2016; no. 1; pp. 1 - 15
Main Authors: Schneider, Martin, Kellermann, Walter
Format: Journal Article
Language:English
Published: Cham Springer International Publishing 15.01.2016
Springer
Springer Nature B.V
Subjects:
ISSN:1687-6180, 1687-6172, 1687-6180
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Acoustic echo cancellation (AEC) is a well-known application of adaptive filters in communication acoustics. To implement AEC for multichannel reproduction systems, powerful adaptation algorithms like the generalized frequency-domain adaptive filtering (GFDAF) algorithm are required for satisfactory convergence behavior. In this paper, the GFDAF algorithm is rigorously derived as an approximation of the block recursive least-squares (RLS) algorithm. Thereby, the original formulation of the GFDAF algorithm is generalized while avoiding an error that has been in the original derivation. The presented algorithm formulation is applied to pruned transform-domain loudspeaker-enclosure-microphone models in a mathematically consistent manner. Such pruned models have recently been proposed to cope with the tremendous computational demands of massive multichannel AEC. Beyond its generalization, a regularization of the GFDAF is shown to have a close relation to the well-known block least-mean-squares algorithm.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1687-6180
1687-6172
1687-6180
DOI:10.1186/s13634-015-0302-2