.png){kind=icon}
.png){kind=icon}
Return
Complex Shannon Entropy Based Learning Algorithm and Its Applications
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2021.3109163.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Nowadays, adaptive filters in complex domain have received increasing attention since they can be applied to a wider scenario than real valued cases. As two typical information theoretic criteria, the minimum complex kernel risk-sensitive loss (MCKRSL) and maximum complex correntropy criterion (MCCC) have shown robustness to non-Gaussian noises in complex domain adaptive filtering. However, since both criteria cannot consider the probability distribution of error, they are not optimal in the presence of some non-Gaussian noises. This paper firstly defines a complex Shannon entropy in terms of the probability distribution of error. Then, a novel adaptive filter is proposed using the minimum complex Shannon entropy (MCSE) criterion. More significantly, the convergence behavior of the MCSE algorithm is discussed, and thus the steady-state excess mean square error (EMSE) is calculated for theoretical analysis. Finally, simulated results on system identification and channel estimation validate the obtained theoretical results and the merits of the proposed MCSE algorithm.
Keywords:
Entropy
Signal processing algorithms
Adaptive filters
Kernel
Filtering
Robustness
Convergence
Adaptive filter
complex
MCSE
robustness
shannon entropy
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W