Sparsity-Constrained Kernel Generalized Maximum Versoria Criterion With Variable Center

doi:10.1109/TCSII.2023.3282595

Sparsity-Constrained Kernel Generalized Maximum Versoria Criterion With Variable Center

2023-11-01

1

PRE

AI

DOI：10.1109/TCSII.2023.3282595

原文链接

原文求助

摘要

En 中文

Sparsity-aware kernel adaptive filtering algorithms using maximum correntropy criterion (MCC) and maximum Versoria criterion (MVC) have emerged as a promising candidate for nonlinear sparse parameter estimation under non-Gaussian distortions. However, the existing zero-attracting (ZA) kernel-MCC (ZA-KMCC) and ZA-kernel-MVC (ZA-KMVC) algorithms deliver suboptimal performance for non-zero-mean noise distributions due to the fixed center located at origin. In this brief, first we propose a novel generalized MVC with variable center (GMVC-VC) based learning paradigm by introducing a center at any location, which consists of higher order central moments of error. Next, we propose a novel generalized Versoria zero-attracting kernel GMVC-VC (GVZA-KGMVC-VC) algorithm, which is robust for nonlinear sparse systems under non-Gaussian noise having non-zero-mean. Furthermore, the detailed convergence analysis in both mean and mean-square sense is performed for the proposed algorithm. Simulations demonstrate that the proposed GVZA-KGMVC-VC approach delivers lower mean square deviation over the existing state-of-art benchmarks.

Keyword:

Sparsity-aware

maximum Versoria criterion

zero-attracting

reproducing kernel Hilbert space

nonlinear

sparse parameter estimation

non-Gaussian

non-zero-mean

Sparsity-Constrained Kernel Generalized Maximum Versoria Criterion With Variable Center

摘要

期刊

机构