arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.03070eess.SP
收藏

基于迭代稀疏渐近最小方差的阵列处理方法

Iterative Sparse Asymptotic Minimum Variance Based Approaches for Array Processing

Habti Abeida, Qilin Zhang, Jian Li, Nadjim Merabtine

摘要:

本文基于渐近最小方差(AMV)准则,提出了一系列适用于阵列处理应用的无用户参数迭代稀疏渐近最小方差(SAMV)方法。在波达方向(DOA)估计问题中假设有丰富的快拍数据,利用所提出的迭代AMV方法联合估计信号功率和噪声方差,并证明了该方法与最大似然估计(ML)方法的一致性。然后,我们提出了一系列基于功率的迭代SAMV方法,这是强大的快照不足,相干源和任意阵列的几何形状。此外,为了克服方向网格对估计精度的限制,SAMV-Stochastic ML(SAMV-SML)方法通过显式地最小化关于一个标量参数的封闭形式的随机ML代价函数而导出,消除了任何额外的网格细化技术的需要。为了帮助性能评估,SAMV方法的近似解也分别提供在高信噪比(SNR)和低SNR。最后,数值例子生成所提出的方法与现有的方法的性能进行比较。

英文摘要:

This paper presents a series of user parameter-free iterative Sparse Asymptotic Minimum Variance (SAMV) approaches for array processing applications based on the asymptotically minimum variance (AMV) criterion. With the assumption of abundant snapshots in the direction-of-arrival (DOA) estimation problem, the signal powers and noise variance are jointly estimated by the proposed iterative AMV approach, which is later proved to coincide with the Maximum Likelihood (ML) estimator. We then propose a series of power-based iterative SAMV approaches, which are robust against insufficient snapshots, coherent sources and arbitrary array geometries. Moreover, to overcome the direction grid limitation on the estimation accuracy, the SAMV-Stochastic ML (SAMV-SML) approaches are derived by explicitly minimizing a closed form stochastic ML cost function with respect to one scalar parameter, eliminating the need of any additional grid refinement techniques. To assist the performance evaluation, approximate solutions to the SAMV approaches are also provided at high signal-to-noise ratio (SNR) and low SNR, respectively. Finally, numerical examples are generated to compare the performance of the proposed approaches with existing approaches.

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

↑