By Topic

A Computationally Efficient Delayless Frequency-Domain Adaptive Filter Algorithm

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
$31 $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

3 Author(s)
Feiran Yang ; State Key Lab. of Acoust., Inst. of Acoust., Beijing, China ; Ming Wu ; Jun Yang

In acoustic echo cancellation (AEC) systems, the partitioned block frequency-domain adaptive filter (PBFDAF) algorithm is commonly adopted to improve the computational efficiency and convergence rate. However, the PBFDAF algorithm introduces an inherent delay. Delayless PBFDAF algorithms have been proposed to tackle this issue. However, the complexity of the existing delayless PBFDAF algorithms is high. Some have high average complexity, but others have high peak complexity. A computationally efficient delayless PBFDAF algorithm is proposed in this letter to reduce both the average and peak complexity. Moreover, a delay compensation method is presented to compensate the error path delay and thus speed up the convergence rate. Simulation results demonstrate that the convergence and tracking performance of the new algorithm with delay compensation is comparable with that of the PBFDAF algorithm.

Published in:

Circuits and Systems II: Express Briefs, IEEE Transactions on  (Volume:60 ,  Issue: 4 )