l_0 Norm Constraint LMS Algorithm for Sparse System Identification

Abstract

In order to improve the performance of Least Mean Square (LMS) based system identification of sparse systems, a new adaptive algorithm is proposed which utilizes the sparsity property of such systems. A general approximating approach on $l_0$ norm -- a typical metric of system sparsity, is proposed and integrated into the cost function of the LMS algorithm. This integration is equivalent to add a zero attractor in the iterations, by which the convergence rate of small coefficients, that dominate the sparse system, can be effectively improved. Moreover, using partial updating method, the computational complexity is reduced. The simulations demonstrate that the proposed algorithm can effectively improve the performance of LMS-based identification algorithms on sparse system.

10 pages, 5 figures

Cited by in corpus (11)

• A stochastic gradient approach on compressive sensing signal reconstruction based on adaptive filtering framework
• Proportionate Adaptive Filtering for Block Sparse System Identification
• Block-Sparsity-Induced Adaptive Filter for Multi-Clustering System Identification
• Sparsity-Aware Adaptive Algorithms Based on Alternating Optimization with Shrinkage
• Proximal Multitask Learning over Networks with Sparsity-inducing Coregularization
• Diffusion Adaptation Strategies for Distributed Estimation over Gaussian Markov Random Fields
• Diffusion leaky LMS algorithm: analysis and implementation
• On the Compression of Neural Networks Using ${\ell }_0$-Norm Regularization and Weight Pruning
• Spline-Based Adaptive Cancellation of Even-Order Intermodulation Distortions in LTE-A/5G RF Transceivers
• Online Wideband Spectrum Sensing Using Sparsity
• Sparse Distributed Learning via Heterogeneous Diffusion Adaptive Networks