Robust kernel recursive adaptive filtering algorithms based on M-estimate

Signal Processing(2023)

引用 1|浏览23
暂无评分
摘要
When coping with the large outliers in measurement caused by the non-Gaussian environmental noise, although the MCC criterion adopts the high-order statistics, the residual error for large outliers still exists. Considering that the M-estimate works well in minimum square error criterion and it can truncate the outliers and further improve the robustness, in this paper, we propose the robust kernel recursive least squares algorithms and the robust kernel recursive maximum correntropy algorithms based on three M-estimate methods. Then, numerical simulations verify that the M-estimates help the proposed algorithms have better performance than the conventional kernel recursive adaptive filtering against the non-Gaussian noise.
更多
查看译文
关键词
Kernel adaptive filter (KAF),M-estimate,Kernel recursive least squares (KRLS),Kernel recursive maximum correntropy (KRMC)
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要