预调字典核LMS算法的收敛性分析
Convergence analysis of kernel LMS algorithm with pre-tuned dictionary
摘要:
核最小均方(KLMS)算法由于其简单性和鲁棒性而成为非线性系统在线辨识的有力工具。KLMS自适应滤波器的设计除了需要选择再生核和设置滤波器参数外,还需要选择一个字典,以得到一个有限阶模型。这个字典对性能有很大的影响,需要仔细考虑。KLMS作为词典设置的功能的理论分析很少,如果有的话,在文献中得到解决。在作者先前发表的分析中,假设字典元素由输入数据的相同概率密度函数控制。在本文中,我们修改这项研究,考虑字典的一部分,过滤器参数设置。该理论分析为KLMS字典设计的进一步研究奠定了基础。
英文摘要:
The kernel least-mean-square (KLMS) algorithm is an appealing tool for online identification of nonlinear systems due to its simplicity and robustness. In addition to choosing a reproducing kernel and setting filter parameters, designing a KLMS adaptive filter requires to select a so-called dictionary in order to get a finite-order model. This dictionary has a significant impact on performance, and requires careful consideration. Theoretical analysis of KLMS as a function of dictionary setting has rarely, if ever, been addressed in the literature. In an analysis previously published by the authors, the dictionary elements were assumed to be governed by the same probability density function of the input data. In this paper, we modify this study by considering the dictionary as part of the filter parameters to be set. This theoretical analysis paves the way for future investigations on KLMS dictionary design.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。