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

Meeting Name

32nd Asilomar Conference on Signals, Systems & Computers, 1998


Electrical and Computer Engineering

Keywords and Phrases

PNLMS++; Adaptive Filters; Computationally Complex; Convergence of Numerical Methods; Convergence Rate; Echo Path; Echo Suppression; Fast Converging Adaptive Filter; Least Mean Squares Methods; Misalignment Level; Network Echo Cancellers; Proportionate Normalized Least Mean Squares ++

Document Type

Article - Conference proceedings

Document Version

Final Version

File Type





© 1998 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.

Publication Date

01 Jan 1998