.png){kind=icon}
.png){kind=icon}
Return
Constrained least lncosh adaptive filtering algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2021.108044.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Constrained adaptive filtering
Lncosh cost function
System identification
Steady-state mean square analysis
Impulsive noise
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W