arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2008.00726eess.SP
收藏

条件与无条件最大似然波达方向估计的分辨概率研究

On the Resolution Probability of Conditional and Unconditional Maximum Likelihood DoA Estimation

Xavier Mestre, Pascal Vallet

AI总结:

本文针对阈值区域的最大似然波达方向估计问题,利用随机矩阵理论分析了天线数与快拍数相当的渐近场景下条件、无条件ML算法代价函数的高斯分布特性,推导渐近协方差闭式表达式,刻画了分辨概率的渐近行为。

摘要:

在波达方向(Direction of Arrival,DoA)估计领域历经数十年研究后,最大似然(Maximum Likelihood,ML)算法如今在分辨能力方面仍具备最优性能。ML算法以多维搜索为代价,可显著降低阈值区域内的离群点产生机制,该区域的特征为每天线的快拍数和/或信噪比(signal to noise ratio,SNR)较低。本文旨在刻画ML算法在阈值区域的分辨能力。研究同时考察了条件版与无条件版ML算法,分析场景为天线数与快拍数均较大且量级相当的渐近情形。借助随机矩阵理论方法,本文证明两种代价函数的有限维分布在该渐近情形下服从高斯分布,并给出了对应渐近协方差矩阵的闭式表达式。这些结果可用于刻画分辨概率的渐近行为,分辨概率的定义为:在真实DoA处计算的代价函数值小于其在其他渐近局部极小值点处取值的概率。

英文摘要:

After decades of research in Direction of Arrival (DoA) estimation, today Maximum Likelihood (ML) algorithms still provide the best performance in terms of resolution capabilities. At the cost of a multidimensional search, ML algorithms achieve a significant reduction of the outlier production mechanism in the threshold region, where the number of snapshots per antenna and/or the signal to noise ratio (SNR) are low. The objective of this paper is to characterize the resolution capabilities of ML algorithms in the threshold region. Both conditional and unconditional versions of the ML algorithms are investigated in the asymptotic regime where both the number of antennas and the number of snapshots are large but comparable in magnitude. By using random matrix theory techniques, the finite dimensional distributions of both cost functions are shown to be Gaussian distributed in this asymptotic regime, and a closed form expression of the corresponding asymptotic covariance matrices is provided. These results allow to characterize the asymptotic behavior of the resolution probability, which is defined as the probability that the cost function evaluated at the true DoAs is smaller than the values that it takes at the positions of the other asymptotic local minima.

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

↑