.png){kind=icon}
Return
Convergence performance analysis of an adaptive kernel width MCC algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.aeue.2017.03.028.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A fixed kernel width in MCC algorithm imposes a trade-off among robustness, convergence rate and steady-state accuracy. With a variable kernel width, the adaptive kernel width MCC (AMCC) algorithm can improve the learning speed of the MCC algorithm especially when the initial weight vector is far away from the optimal weight vector. In this paper, the steady-state excess mean square error (EMSE) of the AMCC algorithm is studied based on energy conservation relation. In addition, a novel convergence measure called initial convergence rate is introduced to evaluate the convergence speed at the beginning of the learning. Simulation experiments are carried out to verify the theoretical analysis and confirm the desirable performance of the AMCC algorithm in several different non-Gaussian noise environments. (C) 2017 Elsevier GmbH. All rights reserved.
Keywords:
Adaptive kernel width
Maximum correntropy criterion
Convergence performance analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
A
IF:
3.2
Papers:
5.8K
Citations:
8.3K
Organization
Cited Papers
ShareSaveShareSaveSIGNAL-PROCESSING WITH FRACTIONAL LOWER ORDER MOMENTS - STABLE PROCESSES AND THEIR APPLICATIONS.png)
PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
ShareSaveNorm-adaption penalized least mean square/fourth algorithm for sparse channel estimationSIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
ShareSave
View more