Bibliographic Details
| Title: |
NLMS is More Robust to Input-Correlation Than LMS: A Proof. |
| Authors: |
Ali, Anum1 (AUTHOR) anumali@utexas.edu, Moinuddin, Muhammad2 (AUTHOR) mmsansari@kau.edu.sa, Al-Naffouri, Tareq Y.3 (AUTHOR) tareq.alnaffouri@kaust.edu.sa |
| Source: |
IEEE Signal Processing Letters. 2022, Vol. 29, p279-283. 5p. |
| Subjects: |
Least squares, Adaptive filters |
| Abstract: |
In this work, we comparatively analyze the least mean squares (LMS) algorithm and the normalized least mean squares (NLMS) algorithm. We use the input moment matrices for comparison as the mean-square behavior of both algorithms is determined by the input moment matrices. First, we derive the closed-form expressions of the input moment matrices of the NLMS. Second, we do a numerical and theoretical comparison of the input moment matrices of the LMS and the NLMS. The analysis shows why the performance of the NLMS is less sensitive to the changes in eigenvalue-spread (of the input-correlation matrix) than the LMS. [ABSTRACT FROM AUTHOR] |
|
Copyright of IEEE Signal Processing Letters is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
