.png){kind=icon}
.png){kind=icon}
Return
Kernel Least Mean p-Power Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2017.2702714.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This letter proposes a novel kernel least mean p-power (KLMP) algorithm for nonlinear system identification in the presence of additive non-Gaussian impulsive noises, modeled by a symmetric alpha-stable distribution with heavy tail. The KLMP algorithm based on the fractional lower order statistics error criterion can effectively scale down the dynamic recursive weight coefficients affected by the impulsive estimation error to avoid the significant performance degradation. Simulation results demonstrate that the proposed algorithm has favorable convergence properties than the classical kernel least-mean-square algorithm using a conventional error criterion in the non-Gaussian impulsive environment.
Keywords:
Fractional lower order statistics (FLOS)
kernel least mean p-power (KLMP) algorithm
symmetric alpha-stable (S alpha S) distribution
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