A Robust Proportionate Affine Projection Algorithm for Network Echo Cancellation
This document has been relocated to http://scholarsmine.mst.edu/ele_comeng_facwork/824
There were 22 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." Previously, a fast converging algorithm called the proportionate NLMS (normalized least mean squares) algorithm (PNLMS) has been proposed. This algorithm exploits the sparseness of the echo path in order to increase the convergence rate. A robust version of PNLMS has also been presented which combines a double-talk detector with techniques from robust statistics to make the algorithm insensitive to double-talk. This paper presents a generalization of the robust PNLMS algorithm to a robust proportionate aAffine projection algorithm (APA) called PAPA that converges very fast
