Delayless frequency domain acoustic echo cancellation

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