.png){kind=icon}
.png){kind=icon}
Return
Robust Variable Step-Size Reweighted Zero-Attracting Least Mean M-Estimate Algorithm for Sparse System Identification
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2019.2928322.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The reweighted zero-attracting least mean square (RZA-LMS) algorithm has good performance in sparse system identification. However, the convergence performance of the RZA-LMS algorithm degrades in the impulsive noise environment. In this brief, a reweighted zero-attracting least mean M-estimate (RZA-LMM) algorithm is proposed to address the issue. The RZA-LMM algorithm employs the M-estimate cost function with a sparsity-aware penalty term and is derived by using the unconstrained minimization method. In order to further enhance the convergence speed and reduce the steady-state error of the RZA-LMM algorithm, a variable step-size reweighted zero-attracting least mean M-estimate (VSSRZA-LMM) algorithm is proposed. The variable step-size scheme, which adopts the M-estimate cost function with a sparsity-aware penalty term and a constrained term of the step-size, is obtained by using the constrained minimization method. Besides, the mean-square stability is analyzed to obtain the range of the step-size, which guarantees the stabilization of the proposed algorithms. The computer simulation results show that the proposed RZA-LMM algorithm achieves better convergence performance than the RZA-LMS algorithm, and the proposed VSSRZA-LMM algorithm exhibits better convergence performance in terms of convergence speed and steady-state normalized mean square deviation (NMSD) than the RZA-LMM algorithm for sparse system identification in the impulsive noise environment.
Keywords:
Convergence
Cost function
System identification
Steady-state
Stability analysis
Circuits and systems
Minimization methods
M-estimate
variable step-size
reweighted zero-attracting
sparse system identification
impulsive noise
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W