Convergence analysis of sparse LMS algorithms with \(l_{1}\)-norm penalty based on white input signal

DOI10.1016/J.SIGPRO.2010.05.015zbMath1197.94124OpenAlexW2062365357MaRDI QIDQ1957936

Kun Shi, Peng Shi

Publication date: 27 September 2010

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sigpro.2010.05.015

zbMATH Keywords

sparsityzero attractingleast mean square (LMS) algorithm\(l_{1}\) normmean square deviation (MSD)

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (12)

Maximum correntropy criterion based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian environments ⋮ Improved adaptive sparse channel estimation using mixed square/fourth error criterion ⋮ Steady-state analysis of sparsity-aware affine projection sign algorithm for impulsive environment ⋮ Block-sparsity regularized maximum correntropy criterion for structured-sparse system identification ⋮ Extension of LMS stability condition over a wide set of signals ⋮ Zero‐attracting variable‐step‐size least mean square algorithms for adaptive sparse channel estimation ⋮ Robust adaptive algorithm by an adaptive zero attractor controller of ZA-LMS algorithm ⋮ Analysis of compressed distributed adaptive filters ⋮ Online Deconvolution for Industrial Hyperspectral Imaging Systems ⋮ Norm penalized joint-optimization NLMS algorithms for broadband sparse adaptive channel estimation ⋮ A proportionate normalized maximum correntropy criterion algorithm with correntropy induced metric constraint for identifying sparse systems ⋮ On the analysis of the incremental \(\ell_0\)-LMS algorithm for distributed systems

Cites Work

• Unnamed Item

This page was built for publication: Convergence analysis of sparse LMS algorithms with \(l_{1}\)-norm penalty based on white input signal