Answers are grounded in this paper and cite their sources.
In this letter, we consider the problem of direction of arrival estimation using sparsity enforced reconstruction methods. Co-prime arrays with$M + N$sensors are utilized to increase the degrees of the freedom from$O(M + N)$to$O(MN)$. The key to the success of sparse-based direction of arrival estimation is that every target must fall on the predefined grid. Off-grid targets can highly jeopardize the reconstruction performance. In this letter, we use joint sparsity reconstruction methods to explore the underlying structure between the sparse signal and the gird mismatch. Two types of sparse reconstruction methods, the greedy method and the convex relaxation method, are considered. By implementing numerical experiments, we demonstrate that our proposed methods can fully utilize the virtual aperture created by co-prime arrays and also outperform the previously proposed MUSIC method with spatial smoothing.
No takes yet. Share an insight, caveat, or question.
Tan et al. (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: