.png){kind=icon}
.png){kind=icon}
Return
Complex-Valued Adaptive Filtering Based on the Random Fourier Features Method
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2019.2957817.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The complex kernel adaptive filters (CKAFs) developed in complex reproducing kernel Hilbert space (RKHS) improve the performance of complex linear adaptive filters, but result in large burdens of computation and memory. To address these issues, a novel complex random Fourier features mapping (CRFFM) is proposed to approximate the kernel-induced mapping by applying the complexification of real RKHSs, and thus projects the complex-valued data from the original data space into the fixed-dimensional complex random Fourier features space (RFFS). To combat complex-valued non-Gaussian noises, a complex Cauchy loss function is presented, and the complex random Fourier features recursive complex Cauchy (CRFFRCC) algorithm is therefore proposed by the combination of CRFFM and the stochastic recursive method. The proposed CRFFRCC with a linear filter structure can reduce the computational and space complexities of CKAFs, significantly. Monte Carlo simulations conducted in the complex-valued nonlinear channel equalization validate the superiorities of CRFFRCC.
Keywords:
Kernel
Signal processing algorithms
Complexity theory
Adaptive systems
Probability density function
Filtering
Complex kernel adaptive filter
random Fourier features
complex Cauchy loss
recursive method
complexity
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