An adaptive algorithm for sparse system identification: zero-attracting LMS
From MaRDI portal
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 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.
Recommendations
- Sparse leaky-LMS algorithm for system identification and its convergence analysis
- Robust adaptive algorithm by an adaptive zero attractor controller of ZA-LMS algorithm
- An NLMS algorithm with TAP-selection matrix for sparse system identification
- Zero-attracting variable-step-size least mean square algorithms for adaptive sparse channel estimation
- scientific article; zbMATH DE number 7266556
Cited in
(16)- Robust adaptive algorithm by an adaptive zero attractor controller of ZA-LMS algorithm
- An Enhanced IAF-PNLMS Adaptive Algorithm for Sparse Impulse Response Identification
- A general zero attraction proportionate normalized maximum correntropy criterion algorithm for sparse system identification
- Low-complexity non-uniform penalized affine projection algorithm for sparse system identification
- A variable step-size strategy based on error function for sparse system identification
- On the analysis of the incremental \(\ell_0\)-LMS algorithm for distributed systems
- An adaptive penalized maximum likelihood algorithm
- Coefficient-gradient-based individualized stepsize adaptation mechanism for robust system identification
- Zero-attracting variable-step-size least mean square algorithms for adaptive sparse channel estimation
- Adaptive algorithms for sparse system identification
- Subband adaptive filtering with l₁-norm constraint for sparse system identification
- Adaptive sparse Volterra system identification with \(\ell _{0}\)-norm penalty
- An NLMS algorithm with TAP-selection matrix for sparse system identification
- Improved feature least mean square algorithm
- Sparse leaky-LMS algorithm for system identification and its convergence analysis
- scientific article; zbMATH DE number 7266556 (Why is no real title available?)
This page was built for publication: An adaptive algorithm for sparse system identification: zero-attracting LMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169728)
