Abstract
Like its linear counterpart, the Kernel Least Mean Square (KLMS) algorithm is also becoming popular in nonlinear adaptive filtering due to its simplicity and robustness. The "kernelization" of the linear adaptive filters modifies the statistics of the input signals, which now depends on the parameters of the used kernel. A Gaussian KLMS has two design parameters; the step size and the kernel bandwidth. Thus, new analytical models are required to predict the kernel-based algorithm behavior as a function of the design parameters. This pa per studies the stochastic behavior of the Gaussian KLMS algorithm for white Gaussian input signals. The resulting model accurately predicts the algorithm behavior and can be used for choosing the algorithm parameters in order to achieve a prescribed performance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
