By Topic

Delayless frequency domain acoustic echo cancellation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Y. Bendel ; Dept. of Electr. Eng. Syst., Tel Aviv Univ., Israel ; D. Burshtein ; O. Shalvi ; E. Weinstein

The computational complexity of classical time domain gradient-based echo cancellation algorithms might be prohibitively high, due to the very long response of the acoustic transfer functions involved. A reduction in computational complexity can be achieved by using frequency domain or subband algorithms. However, these algorithms introduce an inherent delay in the signal path. The delayed echo has an annoying psychoacoustic effect. Additionally, the delay prevents natural, full-duplex conversation. Moreover, when operated in practical scenarios, using speech signals in actual room acoustic environments, the convergence and tracking properties of the frequency domain algorithms do not compare favorably with those of the NLMS algorithm. This is because the range of values of the convergence constant that support a stable filter is more restrictive for the frequency domain algorithms. In this study we introduce a new algorithm termed delayless frequency domain (DLFD). The DLFD exhibits performance comparable to that of the NLMS algorithm with a computational complexity comparable to that of standard frequency domain algorithms and without the processing delay

Published in:

IEEE Transactions on Speech and Audio Processing  (Volume:9 ,  Issue: 5 )