arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2412.05136eess.SYcs.SY
收藏

基于二值观测的递归无投影辨识

Recursive Projection-Free Identification with Binary-Valued Observations

Tianning Han, Ying Wang, Yanlong Zhao

AI总结:

针对二值观测FIR系统参数辨识中现有算法依赖投影算子导致复杂度高的问题,提出递归无投影算法,引入截断系数消除投影算子,加入加速系数实现O(1/k)收敛率,扩展为信息矩阵无投影算法且对一阶系统渐近有效。

摘要:

本文研究低计算复杂度下具有二值观测的有限脉冲响应(FIR)系统的参数辨识问题。现有大多数基于二值观测的算法依赖投影算子,导致计算复杂度远高于O(n²)。对此,本文提出一种递归无投影辨识算法,该算法引入专用截断系数以充分利用先验信息,从而无需投影算子。该算法被证明是均方收敛和几乎必然收敛的。此外,为更好地利用先验信息,引入自适应加速系数,使均方收敛率达到O(1/k),与精确观测下的收敛率一致。受克拉美-罗下界结构的启发,通过设计自适应权重系数,该算法可扩展为信息矩阵无投影算法,该扩展被证明对一阶FIR系统渐近有效,仿真表明对高阶FIR系统也有类似结果。最后,通过数值例子验证了主要结果。

英文摘要:

This paper is concerned with parameter identification problem for finite impulse response (FIR) systems with binary-valued observations under low computational complexity. Most of the existing algorithms under binary-valued observations rely on projection operators, which leads to a high computational complexity of much higher than O(n^2). In response, this paper introduces a recursive projection-free identification algorithm that incorporates a specialized cut-off coefficient to fully utilize prior information, thereby eliminating the need for projection operators. The algorithm is proved to be mean square and almost surely convergent. Furthermore, to better leverage prior information, an adaptive accelerated coefficient is introduced, resulting in a mean square convergence rate of O(1/k) , which matches the convergence rate with accurate observations. Inspired by the structure of the Cramer-Rao lower bound, the algorithm can be extended to an information-matrix projection-free algorithm by designing adaptive weight coefficients. This extension is proved to be asymptotically efficient for first-order FIR systems, with simulations indicating similar results for high order FIR systems. Finally, numerical examples are provided to demonstrate the main results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑