论文标题
关于通过稀疏线性阵列进行一位DOA估计的性能
On the Performance of One-Bit DoA Estimation via Sparse Linear Arrays
论文作者
论文摘要
使用稀疏线性阵列(SLA)的到达方向(DOA)估计最近在阵列处理中引起了极大的关注,这要归功于它们在解决不相关的源信号方面提供增强的自由度。此外,一位模数转换器(ADC)的部署已成为阵列处理中的重要主题,因为它提供了低成本和低复杂性的实现。在本文中,我们研究了SLA收到的一位测量值DOA估计的问题。具体而言,我们首先从一位SLA数据中研究DOA估计问题的可识别性条件,并与从无限位非量化测量结果估算的情况下建立了相当的情况。为了确定一位量化数据的DOA估计的性能限制,我们得出了相应的Cramér-Rao结合(CRB)的悲观近似。然后,这种悲观的CRB被用作评估一位DOA估计器的性能的基准。我们还提出了一种新算法,用于估算一位量化数据的DOA。我们通过得出DOA估计误差的渐近分布的协方差矩阵来研究所提出方法的分析性能,并表明它的表现优于文献中现有的算法。提供数值模拟以验证分析推导并证实所得的性能改善。
Direction of Arrival (DoA) estimation using Sparse Linear Arrays (SLAs) has recently gained considerable attention in array processing thanks to their capability to provide enhanced degrees of freedom in resolving uncorrelated source signals. Additionally, deployment of one-bit Analog-to-Digital Converters (ADCs) has emerged as an important topic in array processing, as it offers both a low-cost and a low-complexity implementation. In this paper, we study the problem of DoA estimation from one-bit measurements received by an SLA. Specifically, we first investigate the identifiability conditions for the DoA estimation problem from one-bit SLA data and establish an equivalency with the case when DoAs are estimated from infinite-bit unquantized measurements. Towards determining the performance limits of DoA estimation from one-bit quantized data, we derive a pessimistic approximation of the corresponding Cramér-Rao Bound (CRB). This pessimistic CRB is then used as a benchmark for assessing the performance of one-bit DoA estimators. We also propose a new algorithm for estimating DoAs from one-bit quantized data. We investigate the analytical performance of the proposed method through deriving a closed-form expression for the covariance matrix of the asymptotic distribution of the DoA estimation errors and show that it outperforms the existing algorithms in the literature. Numerical simulations are provided to validate the analytical derivations and corroborate the resulting performance improvement.