arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.4155cs.ITmath.ITstat.CO
收藏

互质阵列的无搜索DOA估计算法

A Search-free DOA Estimation Algorithm for Coprime Arrays

Zhiyuan Weng, Petar Djuric

摘要:

最近,互质阵列一直是研究的焦点,因为它们在利用冗余跨越大孔径与更少的元素比理论建议的潜力。互质阵列由两个均匀线性子阵列组成,其元件间间距为$Mλ/2$和$Nλ/2$,其中$M$和$N$是互质整数,而$λ$是信号的波长。本文提出了一种基于互质阵列的快速无搜索波达方向估计方法。它是基于使用的方法,操作上的互质阵列的均匀线性子阵列,并享有许多处理优势。我们首先分别估计每个均匀线性子阵的DOA,然后将来自子阵的估计合并。为了结合估计,我们提出了一种方法,该方法将二维平面中的估计点投影到对应于整个角域的一维线段上。通过这样做,我们避免了搜索步骤,因此,我们大大降低了计算复杂性的方法。通过计算机模拟验证了该方法的性能,并与FD-root MUSIC方法进行了比较。

英文摘要:

Recently, coprime arrays have been in the focus of research because of their potential in exploiting redundancy in spanning large apertures with fewer elements than suggested by theory. A coprime array consists of two uniform linear subarrays with inter-element spacings $Mλ/2$ and $Nλ/2$, where $M$ and $N$ are coprime integers and $λ$ is the wavelength of the signal. In this paper, we propose a fast search-free method for direction-of-arrival (DOA) estimation with coprime arrays. It is based on the use of methods that operate on the uniform linear subarrays of the coprime array and that enjoy many processing advantages. We first estimate the DOAs for each uniform linear subarray separately and then combine the estimates from the subarrays. For combining the estimates, we propose a method that projects the estimated point in the two-dimensional plane onto one-dimensional line segments that correspond to the entire angular domain. By doing so, we avoid the search step and consequently, we greatly reduce the computational complexity of the method. We demonstrate the performance of the method with computer simulations and compare it with that of the FD-root MUSIC method.

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

↑