.png){kind=icon}
返回
Constrained least lncosh adaptive filtering algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2021.108044.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a constrained least lncosh (CLL) adaptive filtering algorithm, which, as we show, provides better performance than other algorithms in impulsive noise environment. The proposed CLL algorithm is derived via incorporating a lncosh function in a constrained optimization problem under non-Gaussian noise environment. The lncosh cost function is a natural logarithm of a hyperbolic cosine function, and it can be considered as a combination of mean-square error and mean-absolute-error criteria. The theoretical analysis of convergence and steady-state mean-squared-deviation of the CLL algorithm in identification scenarios is presented. The theoretical analysis agrees well with simulation results and these results verify that the CLL algorithm possesses superior performance and higher robustness than other CAF algorithms under various non-Gaussian impulsive noises. (C) 2021 Elsevier B.V. All rights reserved.
Keyword:
Constrained adaptive filtering
Lncosh cost function
System identification
Steady-state mean square analysis
Impulsive noise
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
Performance and Analysis of Recursive Constrained Least Lncosh Algorithm Under Impulsive Noises
PREAI
分享收藏
查看更多内容