泛函维纳滤波器
The Functional Wiener Filter
摘要:
在再生核希尔伯特空间(RKHS)中给出了著名的维纳滤波器的一个封闭形式的解,我们称之为泛函维纳滤波器(FWF)。而不是使用Wiener-Hopf分解理论,在这里,我们定义了一个新的滞后RKHS嵌入信号统计的相关熵函数的基础上。实质上,我们将Parzen $'$关于自相关函数RKHS的工作推广到非线性泛函空间。FWF推导也与核自适应滤波(KAF)算法非常不同,后者利用搜索方法。的分析FWF解决方案中导出的高斯核RKHS具有恒定的计算复杂度类似的维纳解决方案,从来没有组成,也不采用传统的最佳建模的错误。由于高斯RKHS和时间序列空间之间缺乏一致性,我们比较了两种预成像算法的性能:一种是在RKHS中找到近似解的定点优化算法(FWFFP),另一种是名为FWFLM的局部模型实现。实验结果表明,FWF的性能与KAF的时间序列建模,它需要更少的计算。
英文摘要:
This paper presents a close form solution in Reproducing Kernel Hilbert Space (RKHS) for the famed Wiener filter, which we called the functional Wiener filter(FWF). Instead of using the Wiener-Hopf factorization theory, here we define a new lagged RKHS that embeds signal statistics based on the correntropy function. In essence, we extend Parzen$'$s work on the autocorrelation function RKHS to nonlinear functional spaces. The FWF derivation is also quite different from kernel adaptive filtering (KAF) algorithms, which utilize a search approach. The analytic FWF solution is derived in the Gaussian kernel RKHS with a constant computational complexity similar to the Wiener solution, and never composes nor employs the error as in conventional optimal modeling. Because of the lack of congruence between the Gaussian RKHS and the space of time series, we compare performance of two pre-imaging algorithms: a fixed-point optimization (FWFFP) that finds and approximate solution in the RKHS, and a local model implementation named FWFLM. The experimental results show that the FWF performance is on par with the KAF for time series modeling, and it requires far less computation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。