Abstract
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.
Original language | English |
---|---|
Article number | 6482188 |
Pages (from-to) | 222-226 |
Number of pages | 5 |
Journal | IEEE Transactions on Circuits and Systems II: Express Briefs |
Volume | 60 |
Issue number | 4 |
DOIs | |
Publication status | Published - 2013 |
Externally published | Yes |
ASJC Scopus Subject Areas
- Electrical and Electronic Engineering
Keywords
- Adaptive filter
- average complexity
- delayless algorithm
- echo cancellation
- frequency-domain adaptive filter (FDAF)
- peak complexity