A variable leaky LMS adaptive algorithm

The LMS algorithm has found wide application in many areas of adaptive signal processing and control. We introduce a variable leaky LMS algorithm, designed to overcome the slow convergence of standard LMS in cases of high input eigenvalue spread. The algorithm uses a greedy punish/reward heuristic together with a quantized leak adjustment function to vary the leak. Simulation results confirm that the new algorithm can significantly outperform standard LMS when the input eigenvalue spread is high.

[1]  Ehud Weinstein,et al.  Convergence analysis of LMS filters with uncorrelated Gaussian data , 1985, IEEE Trans. Acoust. Speech Signal Process..

[2]  C. Richard Johnson,et al.  Parameter drift in LMS adaptive filters , 1986, IEEE Trans. Acoust. Speech Signal Process..

[3]  Tareq Y. Al-Naffouri,et al.  Mean-square analysis of normalized leaky adaptive filters , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[4]  Robert R. Bitmead,et al.  The dynamics of bursting in simple adaptive feedback systems with leakage , 1991 .

[5]  S. Thomas Alexander,et al.  Adaptive Signal Processing , 1986, Texts and Monographs in Computer Science.

[6]  Tyseer Aboulnasr,et al.  Leaky LMS algorithm: MSE analysis for Gaussian data , 1997, IEEE Trans. Signal Process..

[7]  G. Demoment,et al.  Constrained LMS adaptive algorithm , 1982 .

[8]  Eric R. Ziegel,et al.  The Elements of Statistical Learning , 2003, Technometrics.

[9]  John M. Cioffi,et al.  Limited-precision effects in adaptive filtering , 1987 .