A GESPRIT-based algorithm for two-dimensional direction finding with non-uniform L-shaped array

The problem of two-dimensional (2D) direction of arrival (DOA) estimation with non-uniform L-shaped array is discussed. The generalized ESPRIT algorithm (GESPRIT) has an advantage of being suitable to arbitrary array geometry. However, the direct applying of (GESPRIT) algorithm in non-uniform L-shaped array (called 2D-GESPRIT) needs an exhaustive 2D spectral search, which makes it unfeasible in practice. Motivated by this, the proposed algorithm employs the GESPRIT in the two directions of the L-shaped array separately, and replaces the high-complexity 2D search by several one-dimensional (1D) searches. The 2D-DOA estimates are finally achieved via pair matching and simple calculation. The proposed algorithm can still be applied to non-uniform L-shaped array. However, it avoids the high computational cost of 2D-GESPRIT. Moreover, the proposed algorithm outperforms the 2D-GESPRIT significantly since it avoids the ambiguity problem. The simulation results verify the effectiveness and improvement of the proposed algorithm.