Closed-Form Blind 2D-DOD and 2D-DOA Estimation for MIMO Radar with Arbitrary Arrays

Authors:
Jianfeng Li;Xiaofei Zhang
Affiliations:
College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China 210016;College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China 210016
Venue:
Wireless Personal Communications: An International Journal
Year:
2013

Citing 5
Cited 1

The root-MUSIC algorithm for direction finding with interpolated arrays

Signal Processing
Multitarget identification and localization using bistatic MIMO radar systems

EURASIP Journal on Advances in Signal Processing
Adaptive algorithms to track the PARAFAC decomposition of a third-order tensor

IEEE Transactions on Signal Processing
On the MUSIC-derived Approaches of Angle Estimation for Bistatic MIMO Radar

WNIS '09 Proceedings of the 2009 International Conference on Wireless Networks and Information Systems
Direction finding using ESPRIT with interpolated arrays

IEEE Transactions on Signal Processing

Two-dimensional angle estimation for monostatic MIMO arbitrary array with velocity receive sensors and unknown locations

Digital Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the problem of four-dimensional angle estimation for bistatic multiple-input multiple-output (MIMO) radar with arbitrary arrays, and propose a close-form joint two-dimensional direction of departure and two-dimensional direction of arrival estimation algorithm. Our work is to extend the estimation of signal parameters via rotational invariance techniques (ESPRIT) algorithm to angle estimation in MIMO-radar with arbitrary arrays. The algorithm can achieve automatically paired four-dimensional angles, requires no peak searching, has low complexity, and does not need to compensate for the phase. Furthermore, the proposed algorithm has much better angle estimation performance than the interpolated ESPRIT algorithm and propagator method. We also analyze and derive the complexity of the algorithm and the Cramer---Rao bound. The simulation results verify the effectiveness of the algorithm.