Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Circuits and Systems II: Express Briefs
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.