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

DOI10.1109/18.9768zbMath0659.93074OpenAlexW2128817619MaRDI QIDQ3809714

Arie Feuer, Moshe Tarrab

Publication date: 1988

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.9768

zbMATH Keywords

steady-state performancenormalized least mean square (NLMS) algorithmWiener problemconvergence of the first and second-order moments

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Identification in stochastic control theory (93E12) Finite difference methods for boundary value problems involving PDEs (65N06)

Related Items

Computational Advantages of Reverberating Loops for Sensorimotor Learning ⋮ A new approach for analyzing the limiting behavior of the normalized LMS algorithm under weak assumptions ⋮ An adaptive inverse controller for explicit rate congestion control with guaranteed stability and fairness ⋮ A noise constrained least mean fourth (NCLMF) adaptive algorithm ⋮ Robust least mean logarithmic square adaptive filtering algorithms ⋮ A bias-compensated fractional order normalized least mean square algorithm with noisy inputs