Robust Generalized Chinese-Remainder- Theorem-Based DOA Estimation for a Coprime Array

In this paper, we consider the problem of determining the direction of arrival (DOA) of two sources for a coprime array. The novelty of this paper is that we present an efficient algorithm to estimate two DOAs from their wrapped phases with errors. The proposed robust generalized Chinese remainder theorem is considerably less computational complex than the searching method while maintaining comparable estimation precision. Moreover, the largest range of DOA that leads to an unambiguous determination is obtained for a given coprime array. Numerical simulations are presented to verify the efficiency and the robustness of the proposed algorithm. The simulation results show that the proposed algorithm is much faster than the searching method while achieving a similar root-mean-square error.