2020
DOI: 10.1109/access.2020.2975536
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 converg… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 34 publications
(36 reference statements)
0
2
0
Order By: Relevance
“…When the forgetting factor is small, the historical data are easily forgotten to a large extent, and the tracking output changes are better, but the stability is poor. Therefore, the forgetting factor is generally between 0.95 and 0.995 according to previous research [54]. To sum up, a single forgetting factor cannot precisely implement the model identification process in a system with time-varying parameters.…”
Section: Optimized Piecewise Forgetting Factor Strategymentioning
confidence: 99%
“…When the forgetting factor is small, the historical data are easily forgotten to a large extent, and the tracking output changes are better, but the stability is poor. Therefore, the forgetting factor is generally between 0.95 and 0.995 according to previous research [54]. To sum up, a single forgetting factor cannot precisely implement the model identification process in a system with time-varying parameters.…”
Section: Optimized Piecewise Forgetting Factor Strategymentioning
confidence: 99%
“…Therefore, this paper uses a variable forgetting factor (VFF) with an adaptive law, which considers the balance between disturbance compensation performance and noise sensitivity, to design the AKF. In developing recursive least squares (RLS) methods for unknown parameter estimation, the VFF [22]- [24] has been used [25]- [28]. The VFF-based AKFD can adequately handle observation noise and provide an accurate simultaneous estimation of state and disturbance variables.…”
Section: Introductionmentioning
confidence: 99%