Litcius/Paper detail

Nearest Kronecker Product Decomposition Based Generalized Maximum Correntropy and Generalized Hyperbolic Secant Robust Adaptive Filters

Sankha Subhra Bhattacharjee, Krishna Kumar, Nithin V. George

2020IEEE Signal Processing Letters58 citationsDOI

Abstract

Robust adaptive signal processing algorithms based on a generalized maximum correntropy criterion (GMCC) suffers from high steady state misalignment. In an endeavour to achieve lower steady state misalignment, in this letter we propose a generalized hyperbolic secant function (GHSF) as a robust norm and derive the generalized hyperbolic secant adaptive filter (GHSAF). The new algorithm is seen to offer robust system identification performance over the conventional GMCC algorithm. To further improve the convergence performance under non-Gaussian noise environments, we propose the nearest Kronecker product decomposition based GMCC and GHSAF algorithms. Extensive simulation study show the improved convergence performance provided by the proposed algorithms for system identification.

Topics & Concepts

Kronecker productAdaptive filterMathematicsConvergence (economics)AlgorithmRate of convergenceGaussianSystem identificationGaussian noiseComputer scienceApplied mathematicsMathematical optimizationKronecker deltaKey (lock)Data modelingEconomic growthEconomicsPhysicsDatabaseComputer securityQuantum mechanicsAdvanced Adaptive Filtering TechniquesBlind Source Separation TechniquesSpeech and Audio Processing
Nearest Kronecker Product Decomposition Based Generalized Maximum Correntropy and Generalized Hyperbolic Secant Robust Adaptive Filters | Litcius