.png){kind=icon}
返回
Euclidean Direction Search Algorithm Based on Maximum Correntropy Criterion
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2023.3301808.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Euclidean direction search (EDS) algorithm can reduce the complexity by avoiding the matrix inversion operation. However, it may fail to work in impulsive environments. To address this problem, a novel EDS based upon the maximum correntropy criterion (EDS-MCC) algorithm is proposed, which provides computational savings and robustness for combating impulsive noise. Additionally, the EDS-MCC algorithm is analyzed to obtain the theoretical performance by utilizing the energy conservation argument (ECA) and the Taylor expansion method. Simulations are exhibited to show the robustness of the EDS-MCC algorithm and verify the accuracy of the theoretical analysis.
Keyword:
Signal processing algorithms
Kernel
Filtering algorithms
Convergence
Taylor series
Steady-state
Signal to noise ratio
Maximum correntropy criterion
Euclidean direction search
impulsive noise
steady-state analysis
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
.png){kind=icon}
分享收藏A Taxonomic Update of Neotropical <I>Pradosia</I> (Sapotaceae, Chrysophylloideae)新热带区Pradosia（山榄科，紫荆亚科）的分类学修订
PREAI
分享收藏Optimal Penalty Factor for the MOV-FxLMS Algorithm in Active Noise Control System有源噪声控制系统中mov-fxlms算法的最优惩罚因子
PREAI
分享收藏
查看更多内容