Convergence and performance analysis of the normalized LMS algorithm with uncorrelated Gaussian data

Authors:
M. Tarrab;A. Feuer
Affiliations:
Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 8

Convergence and steady-state analysis of the normalized least mean fourth algorithm

Digital Signal Processing
A unified approach to steady-state performance analysis of adaptive filters without using the independence assumptions

Signal Processing
On the application of a unified adaptive filter theory in the performance prediction of adaptive filter algorithms

Digital Signal Processing
A new approach for analyzing the limiting behavior of the normalized LMS algorithm under weak assumptions

Signal Processing
A noise constrained least mean fourth (NCLMF) adaptive algorithm

Signal Processing
Computational advantages of reverberating loops for sensorimotor learning

Neural Computation
Performance analysis of the selective coefficient update NLMS algorithm in an undermodeling situation

Digital Signal Processing
Transient analysis of zero attracting NLMS algorithm without Gaussian inputs assumption

Signal Processing

Quantified Score

Hi-index	754.84

Visualization

Abstract

It is demonstrated that the normalized least mean square (NLMS) algorithm can be viewed as a modification of the widely used LMS algorithm. The NLMS is shown to have an important advantage over the LMS, which is that its convergence is independent of environmental changes. In addition, the authors present a comprehensive study of the first and second-order behavior in the NLMS algorithm. They show that the NLMS algorithm exhibits significant improvement over the LMS algorithm in convergence rate, while its steady-state performance is considerably worse