Double-Talk Robust Fast Converging Algorithms for

There is a need for echo cancelers for echo paths with long impulse responses ( 64 ms). This in turn creates a need for more rapidly converging algorithms in order to meet the specifica- tions for network echo cancelers. Faster convergence, however, in general implies a higher sensitivity to near-end disturbances, es- pecially "double-talk." Recently, a fast converging algorithm has been proposed called proportionate normalized least mean squares (PNLMS) algorithm. This algorithm exploits the sparseness of the echo path and has the advantage that no detection of active coeffi- cients is needed. In this paper we propose a method for making the PNLMS algorithm more robust against double-talk. The slower di- vergence rate of these algorithms in combination with a standard Geigel double-talk detector improves the performance of a net- work echo canceler considerably during double-talk. The principle is based on a scaled nonlinearity which is applied to the residual error signal. This results in the robust PNLMS algorithm which di- verges much slower than PNLMS and standard NLMS. Tradeoff between convergence and divergence rate is easily adjusted with one parameter and the added complexity is about seven instruc- tions per sample which is less than 0.3% of the total load of a PNLMS algorithm with 512 filter coefficients. A generalization of the robust PNLMS algorithm to a robust proportionate affine pro- jection 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. The complexity of the robust propor- tionate APA of order two is roughly the same as that of PNLMS. Index Terms—Adaptive filter, double-talk detection, echo can- cellation, normalized least mean squares (NLMS), proportionate normalized least mean squares (PNLMS), robustness.

[1]  Seiichi Yamamoto,et al.  An adaptive echo canceller with variable step gain method , 1982 .

[2]  Tomas Gänsler,et al.  A double-talk resistant subband echo canceller , 1998, Signal Process..

[3]  Kazuhiko Ozeki,et al.  An adaptive filtering algorithm using an orthogonal projection to an affine subspace and its properties , 1984 .

[4]  Steven G. Kratzer,et al.  The Partial-Rank Algorithm for Adaptive Beamforming , 1986, Optics & Photonics.

[5]  Christiane Antweiler,et al.  Approximation of optimal step size control for acoustic echo cancellation , 1997, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[6]  S. Haykin,et al.  Adaptive Filter Theory , 1986 .

[7]  Steven L. Gay,et al.  The fast affine projection algorithm , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.

[8]  Akihiko Sugiyama,et al.  A fast convergence algorithm for adaptive FIR filters under computational constraint for adaptive tap-position control , 1996 .

[9]  Donald L. Duttweiler,et al.  A Twelve-Channel Digital Echo Canceler , 1978, IEEE Trans. Commun..

[10]  Donald L. Duttweiler,et al.  Proportionate normalized least-mean-squares adaptation in echo cancelers , 2000, IEEE Trans. Speech Audio Process..

[11]  Masashi Tanaka,et al.  Fast projection algorithm and its step size control , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.

[12]  S.L. Gay,et al.  An efficient, fast converging adaptive filter for network echo cancellation , 1998, Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284).

[13]  Iven M. Y. Mareels,et al.  LMS estimation via structural detection , 1998, IEEE Trans. Signal Process..