Norm penalized joint-optimization NLMS algorithms for broadband sparse adaptive channel estimation

DOI10.3390/SYM9080133zbMath1423.94026OpenAlexW2737524001MaRDI QIDQ2333541

Yingsong Li, Yan-yan Wang

Publication date: 13 November 2019

Published in: Symmetry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/sym9080133

zbMATH Keywords

zero attractingleast mean square (LMS)NLMS algorithmjoint-optimizationsparse channel estimations

Mathematics Subject Classification ID

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

Related Items (1)

A general zero attraction proportionate normalized maximum correntropy criterion algorithm for sparse system identification

Cites Work

• Unnamed Item
• Low-complexity non-uniform penalized affine projection algorithm for sparse system identification
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• The restricted isometry property and its implications for compressed sensing
• Convergence and steady-state analysis of a variable step-size NLMS algorithm
• Convergence analysis of sparse LMS algorithms with \(l_{1}\)-norm penalty based on white input signal
• Adaptive Filtering
• A New Robust Variable Step-Size NLMS Algorithm
• Zero‐attracting variable‐step‐size least mean square algorithms for adaptive sparse channel estimation
• Compressed sensing

This page was built for publication: Norm penalized joint-optimization NLMS algorithms for broadband sparse adaptive channel estimation