Return
A Computationally Efficient Delayless Frequency-Domain Adaptive Filter Algorithm
DOI:10.1109/TCSII.2013.2240877.png)
Abstract
En 中文
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.
Keywords:
Adaptive filter
average complexity
delayless algorithm
echo cancellation
frequency-domain adaptive filter (FDAF)
peak complexity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W
Organization
Cited Papers
Scientific Opinion on the safety and efficacy of niacin (nicotinic acid and nicotinamide) as a feed additive for all animal species based on a dossier submitted by VITAC EEIG
EFSA Journal
IF0
Delay-free low-cost step-gain estimation for adaptive filters in acoustic echo cancellation
SIGNAL PROCESSING
IF3.6

