当前位置: X-MOL 学术IEEE Commun. Lett. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Improved DFT Algorithm For 2D DOA Estimation Based On 1D Nested Array Motion
IEEE Communications Letters ( IF 4.1 ) Pub Date : 2020-09-01 , DOI: 10.1109/lcomm.2020.2997030
Jianfeng Li , Penghui Ma , Xiaofei Zhang , Gaofeng Zhao

In this letter, two-dimensional (2D) direction of arrival (DOA) estimation using one-dimensional (1D) nested array motion is studied, and an improved Discrete Fourier transform (DFT) algorithm is proposed. Exploiting nested array to move vertically along its axis enables 2D DOA estimation with large-scale and hole-free difference co-array. DFT algorithm has lower complexity than multiple signal classifications(MUSIC) method, but traditional DFT algorithm still requires multiple extra searches to ensure estimation accuracy. We use DFT to obtain the initial angle estimations, and then compensate the estimation offsets via total least squares (TLS) constructed from Taylor expansion approximation. Compared with the traditional DFT search method, the proposed method has lower complexity and better performance. Multiple simulations are conducted to verify the effectiveness of our approach.

中文翻译:

基于一维嵌套阵列运动的二维 DOA 估计的改进 DFT 算法

在这封信中,研究了使用一维 (1D) 嵌套阵列运动的二维 (2D) 到达方向 (DOA) 估计,并提出了一种改进的离散傅立叶变换 (DFT) 算法。利用嵌套阵列沿其轴垂直移动,可以使用大规模无孔差分共阵列进行二维 DOA 估计。DFT算法的复杂度低于多信号分类(MUSIC)方法,但传统的DFT算法仍然需要多次额外搜索才能保证估计精度。我们使用 DFT 来获得初始角度估计,然后通过由泰勒展开近似构造的总最小二乘法 (TLS) 来补偿估计偏移。与传统的DFT搜索方法相比,所提出的方法具有更低的复杂度和更好的性能。
更新日期:2020-09-01
down
wechat
bug