Gaussian kernel adaptive filters with adaptive kernel bandwidth

Publication Type:
Journal Article
Signal Processing, 2020, 166
Issue Date:
Filename Description Size
1-s2.0-S016516841930324X-main.pdfPublished version926.84 kB
Adobe PDF
Full metadata record
© 2019 Gaussian kernel adaptive filters (GKAFs) have been successfully applied in functional approximation. The kernel bandwidth for GKAFs not only impacts on the smoothness of function approximation and the locality of training samples, but also affects the convergence rate and testing accuracy. However, in practice, it is hard to predesign an optimal one. In this paper, for practical applications, we propose a novel framework for kernel bandwidth adaptation in sparsification case. In this framework, we consider the latest K kernel bandwidths as free parameters, and sequentially update them using a gradient decent method to minimize the instantaneous squared error. Furthermore, we apply the proposed method to the quantized kernel least mean square (QKLMS) algorithm, and conduct convergence analysis for the algorithm. Extensive simulation results are provided and validate the superiority of our method compared to some state-of-the-art algorithms.
Please use this identifier to cite or link to this item: