An Efficient, Fast Converging Adaptive Filter for Network Echo Cancellation
This document has been relocated to http://scholarsmine.mst.edu/ele_comeng_facwork/1431
There were 14 downloads as of 28 Jun 2016.
This paper discusses a fast efficient adaptive filtering algorithm for network echo cancellers PNLMS++ (proportionate normalized least mean squares ++). Compared to the conventional normalized least mean squares (NLMS) algorithm, PNLMSI++ converges much more quickly when the echo path is sparse. When the echo path is dispersive, the convergence rate is the same as NLMS. In addition, the new algorithm diverges at the same rate and to the same misalignment level as NLMS during periods of undetected double-talk. PNLMS++ is only 50% more computationally complex than NLMS and requires no additional memory