A New $l_0$-LMS Algorithm With Adaptive Zero Attractor

In the l0 norm constraint least mean square (l0-LMS) algorithm, the zero attractor is an important parameter which balances the trade-off between the convergence rate and steady-state error of the algorithm. However, there is no practically effective choice guideline of this parameter. In addition, the optimal value of this parameter should be time-varying when the measurement noise power varies with time, and a fixed value of the zero attractor is no longer suitable. In this letter, we propose an l0-LMS algorithm with adaptive zero attractor for applications with time-varying measurement noise signal, where the zero attractor is updated based on the criterion of maximizing the decrease of the transient mean square deviation.

[1]  Rodrigo C. de Lamare,et al.  Sparsity-Aware Adaptive Algorithms Based on Alternating Optimization and Shrinkage , 2014, IEEE Signal Processing Letters.

[2]  F. Y. Wu,et al.  Non-Uniform Norm Constraint LMS Algorithm for Sparse System Identification , 2013, IEEE Communications Letters.

[3]  Bhaskar D. Rao,et al.  Sparse channel estimation via matching pursuit with application to equalization , 2002, IEEE Trans. Commun..

[4]  Yuantao Gu,et al.  $l_{0}$ Norm Constraint LMS Algorithm for Sparse System Identification , 2009, IEEE Signal Processing Letters.

[5]  Jian Wang,et al.  Performance Analysis of $l_0$ Norm Constraint Least Mean Square Algorithm , 2012, IEEE Transactions on Signal Processing.

[6]  Peng Shi,et al.  Convergence analysis of sparse LMS algorithms with l1-norm penalty based on white input signal , 2010, Signal Process..

[7]  Alfred O. Hero,et al.  Sparse LMS for system identification , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.