.png){kind=icon}
.png){kind=icon}
Return
Recursive Constrained Adaptive Algorithm Under q-Renyi Kernel Function
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2020.3048609.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this brief, we proposed a recursive constrained maximum q-Renyi kernel (RCMqR) adaptive filtering algorithm, which is derived via introducing a q-Renyi kernel function into constrained adaptive algorithm and using q-Renyi kernel function to construct a new cost function and providing its recursive form to create a linear constrained filter. The created RCMqR algorithm can achieve superior performance compared with other conventional algorithms under non-Gaussian noises environment. Theoretical transient mean-square deviation (MSD) of the RCMqR algorithm is presented when the system background noises are Gaussian-noise and non-Gaussian noise, and a sufficient condition has been achieved to make sure RCMqR algorithm converge. Various computer simulations are performed in system identification for the purpose of comparison. The simulation results verified that the theoretical analysis match well with the simulations and the proposed algorithm has better robustness than other algorithms under non-Gaussian impulsive noise.
Keywords:
Recursive constrained adaptive filter
q-Renyi kernel function
linear system identification
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
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W