A robust proportionate affine projection algorithm for network echo cancellation

Echo cancelers which cover longer impulse responses (/spl ges/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 conver...

Full description

Saved in:
Bibliographic Details
Main Authors: Gansler, T., Benesty, J., Gay, S.L., Sondhi, M.M.
Format: Conference Proceeding
Language:English
Subjects:
Adaptive filters
Convergence
Detectors
Echo cancellers
Filtering algorithms
Jacobian matrices
Projection algorithms
Robustness
Speech enhancement
Statistics
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Echo cancelers which cover longer impulse responses (/spl ges/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.
ISSN:1520-6149
2379-190X
DOI:10.1109/ICASSP.2000.859079