稀疏传感基础(II):丢番图采样与阵列配置
On the Foundation of Sparse Sensing (Part II): Diophantine Sampling and Array Configuration
摘要:
在系列论文的第二部分,我们开始研究稀疏感知的算法效率。源于互质感知,我们提出了一个广义的框架,称为丢番图传感,它利用一般丢番图方程理论和高阶稀疏标尺,以加强采样时间,自由度(DoF),和采样稀疏性,同时。借助于高阶矩统计,提出的丢番图框架提出了两个根本的改进。首先,在频率估计上,我们证明了在任意大的下采样率下,存在采样方案,其中所需的样本数仅与DoF和所需的快照数之和成比例,这意味着线性采样时间。其次,在到达方向(DoA)估计,我们提出了两种通用的阵列结构,使得给定N个传感器,传感器之间的最小距离可以是N,O(N^q)的多项式,这表明,一个任意稀疏的阵列(具有任意小的互耦)存在给定足够多的传感器。此外,渐近地,所提出的阵列配置产生的最佳已知的自由度界相比,现有的稀疏阵列设计。
英文摘要:
In the second part of the series papers, we set out to study the algorithmic efficiency of sparse sensing. Stemmed from co-prime sensing, we propose a generalized framework, termed Diophantine sensing, which utilizes generic Diophantine equation theory and higher-order sparse ruler to strengthen the sampling time, the degree of freedom (DoF), and the sampling sparsity, simultaneously. Resorting to higher-moment statistics, the proposed Diophantine framework presents two fundamental improvements. First, on frequency estimation, we prove that given arbitrarily large down-sampling rates, there exist sampling schemes where the number of samples needed is only proportional to the sum of DoF and the number of snapshots required, which implies a linear sampling time. Second, on Direction-of-arrival (DoA) estimation, we propose two generic array constructions such that given N sensors, the minimal distance between sensors can be as large as a polynomial of N, O(N^q), which indicates that an arbitrarily sparse array (with arbitrarily small mutual coupling) exists given sufficiently many sensors. In addition, asymptotically, the proposed array configurations produce the best known DoF bound compared to existing sparse array designs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。