A family of normalized LMS algorithms
- 1 March 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 1 (3) , 49-51
- https://doi.org/10.1109/97.295321
Abstract
A derivation of the normalized LMS algorithm is generalized, resulting in a family of projection-like algorithms based on an L/sub p/-minimized filter coefficient change. The resulting algorithms include the simplified NLMS algorithm of Nagumo and Noda (1967) and an even simpler single-coefficient update algorithm based on the maximum absolute value datum of the input data vector. A complete derivation of the algorithm family is given, and simulations are performed to show the convergence behaviors of the algorithms.Keywords
This publication has 5 references indexed in Scilit:
- Adaptive FIR filtering based on minimum L/sub infinity /-normPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Normalized data nonlinearities for LMS adaptationIEEE Transactions on Signal Processing, 1994
- Fast algorithms for running ordering and max/min calculationIEEE Transactions on Circuits and Systems, 1989
- Convergence and performance analysis of the normalized LMS algorithm with uncorrelated Gaussian dataIEEE Transactions on Information Theory, 1988
- A learning method for system identificationIEEE Transactions on Automatic Control, 1967