秩一张量模型上的非线性自适应算法
Nonlinear Adaptive Algorithms on Rank-One Tensor Models
AI总结:
本文提出低复杂度非线性模型,基于可分解的Volterra核,推导出精确梯度型算法,进而发展出LMS滤波器及TRUE-LMS算法,通过仿真验证其在非线性处理中的优越性能。
摘要:
本文提出了一种低复杂度的非线性模型,并在此基础上开发了自适应算法。该模型基于可分解(或称秩一,在张量语言中)的Volterra核,也可描述为FIR滤波器的乘积,这解释了其低复杂度特性。秩一模型之所以有趣,是因为它来源于逼近理论中的良好定义问题。本文在估计理论背景下使用该模型,推导出精确的梯度型算法,从而发展出如最小均方(LMS)滤波器及其数据重用版本---TRUE-LMS算法。讨论了稳定性与收敛性问题。随后在仿真中测试这些算法,结果显示其在与其他非线性处理算法相比时具有良好的性能。
英文摘要:
This work proposes a low complexity nonlinearity model and develops adaptive algorithms over it. The model is based on the decomposable---or rank-one, in tensor language---Volterra kernels. It may also be described as a product of FIR filters, which explains its low-complexity. The rank-one model is also interesting because it comes from a well-posed problem in approximation theory. The paper uses such model in an estimation theory context to develop an exact gradient-type algorithm, from which adaptive algorithms such as the least mean squares (LMS) filter and its data-reuse version---the TRUE-LMS---are derived. Stability and convergence issues are addressed. The algorithms are then tested in simulations, which show its good performance when compared to other nonlinear processing algorithms in the literature.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。