稀疏阵列超分辨:时空权衡的非渐近分析
Super-resolution with Sparse Arrays: A Non-Asymptotic Analysis of Spatio-temporal Trade-offs
摘要:
稀疏阵列由于其增强的自由度(DOF)和优异的分辨率,已经成为传统均匀线阵的一种流行替代方案。在被动设置中,这些优点是通过利用不同传感器处接收到的信号之间的相关性来实现的。这导致人们相信稀疏阵列需要大量的时间测量来可靠地从这些相关性估计感兴趣的参数,因此它们在样本匮乏的情况下可能不是优选的。在本文中,我们揭穿这个神话进行严格的非渐近分析的Coarray ESPRIT算法。这个看似违反直觉的结果是协阵流形的奇异值的缩放的结果,其补偿了在有限的快照制度中潜在的大的协方差估计误差。具体来说,我们表明,对于一个嵌套阵列的制度下运作的来源比传感器少($S=O(1)$),可以通过任意小的量来限制估计的和真实的到达方向(DOA)之间的匹配距离误差($ε$)具有高概率,(一)时间的数量;($L$)仅与传感器的数量($P$)(即$L=Ω(\ln(P)/ε^2)$)成数学比例,以及(ii)满足合适的分离条件。我们的研究结果还正式证明了稀疏阵列的众所周知的经验分辨率的好处,通过建立源之间的最小间隔可以是$Ω(1/P^2)$,而不是分离$Ω(1/P)$所需的具有相同数量的传感器的阵列。我们的样本复杂度表达式揭示了对其他关键模型参数的依赖性,如SNR和源功率的动态范围。这使我们能够在理论和经验上建立嵌套阵列的优越的抗噪能力。
英文摘要:
Sparse arrays have emerged as a popular alternative to the conventional uniform linear array (ULA) due to the enhanced degrees of freedom (DOF) and superior resolution offered by them. In the passive setting, these advantages are realized by leveraging correlation between the received signals at different sensors. This has led to the belief that sparse arrays require a large number of temporal measurements to reliably estimate parameters of interest from these correlations, and therefore they may not be preferred in the sample-starved regime. In this paper, we debunk this myth by performing a rigorous non-asymptotic analysis of the Coarray ESPRIT algorithm. This seemingly counter-intuitive result is a consequence of the scaling of the singular value of the coarray manifold, which compensates for the potentially large covariance estimation error in the limited snapshot regime. Specifically, we show that for a nested array operating in the regime of fewer sources than sensors ($S=O(1)$), it is possible to bound the matching distance error between the estimated and true directions of arrival (DOAs) by an arbitrarily small quantity ($ε$) with high probability, provided (i) the number of temporal snapshots ($L$) scales only logarithmically with the number of sensors ($P$), i.e. $L=Ω(\ln(P)/ε^2)$, and (ii) a suitable separation condition is satisfied. Our results also formally prove the well-known empirical resolution benefits of sparse arrays, by establishing that the minimum separation between sources can be $Ω(1/P^2)$, as opposed to separation $Ω(1/P)$ required by a ULA with the same number of sensors. Our sample complexity expression reveals the dependence on other key model parameters such as SNR and the dynamic range of the source powers. This enables us to establish the superior noise-resilience of nested arrays both theoretically and empirically.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。