.png){kind=icon}
.png){kind=icon}
Return
Optimal Sparsity Tradeoff in l0-NLMS Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2016.2587064.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The l(0)-normalized least mean squares (l(0)-NLMS) is arguably the reference gradient adaptive algorithm for sparse system estimation. However, alike all sparse gradient adaptive algorithms, the l(0)-NLMS performance is sensitive to the (adequate) selection of the tradeoff parameter. Highlighted in this letter, the existence of two convergence modes, linked to the negligible and to the significant taps, paves the way for the convergence analysis, which results in a set of nonlinear (quadratic) convergence equations. Therefrom, the minimization of the steady-state misalignment concludes in the optimal tradeoff, which happens to relate to the NLMS step size, filter length, plant sparsity, and noise level in an extremely compact fashion. Exhaustive simulation experiments show strong agreement between the analytical predictions and the empirical performance.
Keywords:
l(0)-norm
NLMS algorithm
sparsity tradeoff
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
No organization information available