A study of the robustness of the M-Max NLMS adaptive algorithm

TitleA study of the robustness of the M-Max NLMS adaptive algorithm
Publication TypeConference Paper
Year of Publication1999
AuthorsMayyas, K., T. Aboulnasr, and T. Eldos
Conference NameCircuits and Systems, 1999. ISCAS '99. Proceedings of the 1999 IEEE International Symposium on
Pagination154 -157 vol.3
Date Publishedjul.
Keywordsadaptive filters, deterministic robustness study, filtering theory, least mean squares methods, M-max NLMS adaptive algorithm, robust performance, step size, time-domain analysis, time-domain framework, updated coefficients

In this paper, the M-Max NLMS algorithm is analyzed in a time-domain framework without constraining the number of updated coefficients per iteration or imposing statistical assumptions on the input signal. Analysis will prove the robustness of the M-Max NLMS algorithm under appropriate deterministic assumptions. Moreover, it will provide more insight into the algorithm structure leading to new choices of the step size for improved robust performance. A typical simulation example is presented to verify the deterministic findings


a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia