在单比特通信下实现原始CRLB的渐近高效递归识别
Asymptotically Efficient Recursive Identification Under One-Bit Communications Achieving Original CRLB
AI总结:
本文提出了一种在单比特通信下实现原始CRLB的渐近高效递归识别方法,通过整合历史数据减少信息损失,提升估计效率。
摘要:
本文开发了一种用于具有外生输入的自回归系统在单比特通信下的渐近高效递归识别算法。特别地,所提出的方法在量化前的数据基础上渐近地达到Cramer-Rao下界(CRLB),即原始CRLB,而现有方法通常只能达到量化观测对应的CRLB。主要原因在于现有方法仅量化当前系统的输出,导致在单比特量化下产生不可忽视的信息损失。为克服这一挑战,我们提出了一种新的量化方法,该方法整合了当前和历史系统的输出和输入,以在单比特数据中提供更丰富的参数信息,使量化导致的信息损失相对于原始CRLB成为次要项。基于此技术,进一步提出了相应的远程估计算法。为解决非独立性导致的收敛分析挑战,我们建立了新的框架,分析由结合当前和历史系统输出和输入前形成的数据的尾部概率,从而消除了对量化数据传统独立性假设的需要。证明了远程估计在渐近意义上是正态的,误差协方差矩阵收敛到原始CRLB,确认了其渐近效率。与现有单比特数据下的识别算法相比,该方法至少将渐近均方误差减少了36%。几个数值示例被模拟以展示所提出算法的有效性。
英文摘要:
This paper develops an asymptotically efficient recursive identification algorithm for autoregressive systems with exogenous inputs under one-bit communications. In particular, the proposed method asymptotically achieves the Cramer-Rao lower bound (CRLB) based on the original data before quantization (original CRLB), whereas existing approaches typically attain only the CRLB corresponding to the quantized observations. The primary reason is that the existing methods quantize only the current system output, resulting in non-negligible information loss under one-bit quantization. To overcome this challenge, we present a novel quantization method that integrates both current and historical system outputs and inputs to provide richer parameter information in one-bit data, allowing the information loss caused by quantization to become a minor term relative to the original CRLB. Based on this technique, a corresponding remote estimation algorithm is further proposed. To address the convergence analysis challenge posed by the non-independence of the one-bit data, we establish a new framework that analyzes the tail probability of integrated data formed by combining current and historical system outputs and inputs before quantization, thereby eliminating the need for the traditional independence assumption on the quantized data. It is proven that the remote estimate achieves asymptotic normality, and the error covariance matrix converges to the original CRLB, confirming its asymptotic efficiency. Compared to existing identification algorithms under one-bit data, this method reduces the asymptotic mean squared error by at least 36%. Several numerical examples are simulated to show the effectiveness of the proposed algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。