Double-Talk Robust Fast Converging Algorithms for Network Echo Cancellation

T. Gansler
Steven L. Grant, Missouri University of Science and Technology
J. Benesty
M. M. Sondhi

This document has been relocated to http://scholarsmine.mst.edu/ele_comeng_facwork/983

There were 44 downloads as of 27 Jun 2016.

Abstract

Echo cancelers which cover longer impulse responses (greater than or equal to 64 ms) are desirable. Long responses create a need for more rapidly converging algorithms in order to meet the specifications for network echo cancelers devised by the ITU (International Telecommunication Union). In general, faster convergence implies a higher sensitivity to near-end disturbances, especially "double-talk". Recently, a fast converging algorithm called proportionate NLMS (normalized least mean squares) algorithm (PNLMS) has been proposed. This algorithm exploits the sparseness of the echo path. In this paper we propose a method for making the PNLMS algorithm more robust against double-talk. The slower divergence rate of these robust algorithms in combination with a standard Geigel double-talk detector improves the performance of a network echo canceler considerably during double-talk. This results in the robust PNLMS algorithm which diverges much slower than PNLMS and standard NLMS. A generalization of the robust PNLMS algorithm to a robust proportionate affine projection algorithm (APA) is also presented. It converges very fast, and unlike PNLMS, is not as dependent on the assumption of a sparse echo path response. Trade off between convergence and divergence rate is easily tuned with one parameter and the added complexity is about 7 instructions per sample.