An Efficient RLS Data-Driven Echo Canceller for Fast Initialization of Full-Duplex Data Transmission

Computationally efficient recursive-least-squares (RLS) procedures are presented specifically for the adaptive adjustment of the data-driven echo cancellers (DDEC's) that are used in voiceband fullduplex data transmission. The methods are shown to yield very short learning times for the DDEC, while they also simultaneously reduce computational requirements to below those required for other leastsquare procedures, such as those recently proposed by Salz (1983). The new methods can be used with any training sequence over any number of iterations, unlike any of the previous fast-Converging methods. The methods are based upon the fast transversal filter (FTF) RLS adaptive filtering algorithms that were independently introduced by the authors of this paper; however, several special features of the DDEC are introduced and exploited to further reduce computation to the levels that would be required for slower-converging stochastic-gradient solutions. Several tradeoffs between computation, memory, learning time, and performance are also illuminated for the new initialization methods.

[1]  T. Kailath,et al.  Fast, recursive-least-squares transversal filters for adaptive filtering , 1984 .

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

[3]  Lennart Ljung,et al.  Application of Fast Kalman Estimation to Adaptive Equalization , 1978, IEEE Trans. Commun..

[4]  H. Kotera,et al.  Application of Fast Kalman Estimation to Adaptive Equalization , 1978 .

[5]  M.M. Sondhi,et al.  Silencing echoes on the telephone network , 1980, Proceedings of the IEEE.

[6]  Michael L. Honig Echo Cancellation of Voiceband Data Signals Using Recursive Least Squares and Stochastic Gradient Algorithms , 1985, IEEE Trans. Commun..

[7]  H. R. Rudin,et al.  Application of automatic transversal filters to the problem of echo suppression , 1966 .

[8]  M. M. Sondhi,et al.  An adaptive echo canceller , 1967 .

[9]  Jean-Jacques Werner An Echo-Cancellation-Based 4800 Bit/s Full-Duplex DDD Modem , 1984, IEEE Journal on Selected Areas in Communications.

[10]  J. Salz On the start-up problem in digital echo cancelers , 1983, The Bell System Technical Journal.

[11]  S. Weinstein A Passband Data-Driven Echo Canceller for Full-Duplex Transmission on Two-Wire Circuits , 1977, IEEE Trans. Commun..

[12]  L. Guidoux,et al.  Binary Passband Echo Canceller in a 4800 Bit/s Two-Wire Duplex Modem , 1984, IEEE J. Sel. Areas Commun..

[13]  V. Koll,et al.  Simultaneous Two-Way Data Transmission Over a Two-Wire Circuit , 1973, IEEE Trans. Commun..

[14]  M. Sondhi,et al.  A self-adaptive echo canceller , 1966 .

[15]  Thomas Kailath,et al.  An Efficient Exact-Least-Squares Fractionally Spaced Equalizer Using Intersymbol Interpolation , 1984, IEEE Journal on Selected Areas in Communications.

[16]  Thomas Kailath,et al.  Fast, fixed-order, least-squares algorithms for adaptive filtering , 1983, ICASSP.

[17]  David G. Messerschmitt,et al.  Echo Cancellation in Speech and Data Transmission , 1984, IEEE J. Sel. Areas Commun..

[18]  P. van Gerwen,et al.  Digital echo cancellation for baseband data transmission , 1979 .

[19]  D. Lin On digital implementation of the fast kalman algorithms , 1984 .

[20]  M. Sondhi Theory and Computer Simulation of a Self‐Adapting Echo Canceler , 1966 .

[21]  R. E. Kalman,et al.  Aspects of network and system theory , 1971 .

[22]  K. Mueller A New Digital Echo Canceler for Two-Wire Full-Duplex Data Transmission , 1976, IEEE Trans. Commun..

[23]  M. Morf,et al.  Recursive least squares ladder estimation algorithms , 1981 .

[24]  L. Ljung,et al.  Fast calculation of gain matrices for recursive estimation schemes , 1978 .

[25]  Andrzej Milewski,et al.  Periodic Sequences with Optimal Properties for Channel Estimation and Fast Start-Up Equalization , 1983, IBM J. Res. Dev..