.png){kind=icon}
返回
Sparsity Constrained Recursive Generalized Maximum Correntropy Criterion With Variable Center Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2020.2986053.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This brief developed a novel sparsity constrained recursive adaptive filtering algorithm via the generalized correntropy criterion with variable center (GMCC-VC) for sparse system parameters estimation. In order to improve the performance of the adaptive filtering algorithm with GMCC under the non-Gaussian and non-zero mean noise environments, the GMCC is extended by adding a center which can be located at any position in the generalized Gaussian kernel function. Specifically, we proposed a novel adaptive online update method to optimize the kernel method and center. In addition, we mainly derived a recursive GMCC-VC algorithm based on the GMCC with the sparse constraint to exploit sparsity. Numerical simulation results are given to show that the proposed algorithm is efficient for sparse system parameter estimation problems in non-Gaussian and non-mean noise environments.
Keyword:
Filtering algorithms
Kernel
Adaptive filters
Parameter estimation
Optimization
Circuits and systems
Signal processing algorithms
Generalized correntropy with variable center
sparse recursive adaptive filter
sparse parameter estimation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
4.9
论文数:
8.8K
被引数:
2.5W
机构
引用论文
Norm-adaption penalized least mean square/fourth algorithm for sparse channel estimation.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
分享收藏分享收藏
查看更多内容