An Efficient, RLS (Recursive-Least-Squares) Data-Driven Echo Canceller for Fast Initialization of Full-Duplex Data Transmission,
Abstract
Computationally efficient Recursive-Least-Squares (RLS) procedures are presented specifically for the adaptive adjustment of the Data-Driven Echo Cancellers (DDECs) that are used in voiceband full-duplex 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 least-square 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 trade-offs between computation, memory, learning-time and performance are also illuminated for the new initialization. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1985
- Accession Number
- ADA160177
Entities
People
- J.M. Cioffi
- Thomas Kailath
Organizations
- Stanford University