.png){kind=icon}
.png){kind=icon}
Return
Constrained Least Mean M-Estimation Adaptive Filtering Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2020.3022081.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In many applications, the constrained adaptive filtering algorithm has been widely studied. The classical constrained LMS algorithm is widely used because of its low computational complexity. However, the performance of constrained LMS algorithm will degrade under correlated input or non-Gaussian noise. In order to overcome this defect, this brief proposes a constrained least mean M-estimation (CLMM) algorithm, which uses the M-estimation cost function for the constrained adaptive filter. Compared with the previous algorithms for non-Gaussian noise, such as constrained maximum correntropy criterion (CMCC) algorithm and constrained minimum error entropy (CMEE) algorithm, the proposed CLMM algorithm has lower computational complexity and better steady-state performance. In addition, the step-size range is determined by analyzing the mean square stability, which ensures the stability of the proposed CLMM algorithm. Simulation results illustrate that the proposed CLMM algorithm has better steady-state performance than previous algorithms in non-Gaussian noises with multi-peak distribution.
Keywords:
Computational complexity
Stability analysis
Mathematical model
Filtering algorithms
Circuit stability
Adaptive systems
Cost function
Constrained adaptive filtering
M-estimate
non-Gaussian noises
system identification
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