Accelerate Convergence of Polarized Random Fourier Feature-Based Kernel Adaptive Filtering With Variable Forgetting Factor and Step Size

The random Fourier feature as an efficient kernel approximation method can effectively suppress the network growth of the traditional kernel-based adaptive filtering algorithm. Polarized random Fourier feature kernel least-mean-square(PRFFKLMS) remarkably improved the accuracy performance of random Fourier feature-based kernel least-mean-square algorithm and become the most representative random Fourier feature-based least-mean-square algorithm. In this paper, we studied the method that can improve the convergence speed of random Fourier feature-based least-mean-square algorithm. Based on the variable forgetting factor and variable step size strategy, three algorithm are proposed. The computational complexity of proposed algorithms are also given. The simulation results show that compared with PRFFKLMS algorithm, the convergence speed of the proposed algorithm is significantly improved.