.png){kind=icon}
Return
Kernel Least Mean Square with Single Feedback
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2014.2377726.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, a novel kernel adaptive filtering algorithm, namely the kernel least mean square with single feedback (SF-KLMS) algorithm, is proposed. In SF-KLMS, only a single delayed output is used to update the weights in a recurrent fashion. The use of past information accelerates the convergence rate significantly. Compared with the kernel adaptive filter using multiple feedback, SF-KLMS has a more compact and efficient structure. Simulations in the context of time-series prediction and nonlinear regression show that SF-KLMS outperforms not only the kernel adaptive filter with multiple feedback but also the kernel adaptive filter without feedback in terms of convergence rate and mean square error.
Keywords:
Kernel adaptive filter
KLMS
recurrent fashion
single feedback
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSave
View more