Performance Analysis of l_0 Norm Constraint Least Mean Square Algorithm

Abstract

As one of the recently proposed algorithms for sparse system identification, $l_0$ norm constraint Least Mean Square ($l_0$-LMS) algorithm modifies the cost function of the traditional method with a penalty of tap-weight sparsity. The performance of $l_0$-LMS is quite attractive compared with its various precursors. However, there has been no detailed study of its performance. This paper presents all-around and throughout theoretical performance analysis of $l_0$-LMS for white Gaussian input data based on some reasonable assumptions. Expressions for steady-state mean square deviation (MSD) are derived and discussed with respect to algorithm parameters and system sparsity. The parameter selection rule is established for achieving the best performance. Approximated with Taylor series, the instantaneous behavior is also derived. In addition, the relationship between $l_0$-LMS and some previous arts and the sufficient conditions for $l_0$-LMS to accelerate convergence are set up. Finally, all of the theoretical results are compared with simulations and are shown to agree well in a large range of parameter setting.

31 pages, 8 figures

References in corpus (4)

• A fast approach for overcomplete sparse decomposition based on smoothed L0 norm
• l_0 Norm Constraint LMS Algorithm for Sparse System Identification
• Online Sparse System Identification and Signal Reconstruction using Projections onto Weighted ${\ell }_1$ Balls
• A stochastic gradient approach on compressive sensing signal reconstruction based on adaptive filtering framework

Cited by in corpus (5)

• Recursive Recovery of Sparse Signal Sequences from Compressive Measurements: A Review
• Block-Sparsity-Induced Adaptive Filter for Multi-Clustering System Identification
• Transient performance analysis of zero-attracting LMS
• Diffusion Leaky Zero Attracting Least Mean Square Algorithm and Its Performance Analysis
• Decentralized Sparse Multitask RLS over Networks