In this paper, a fast search-free method for direction-of-arrival (DOA) estimation

with coprime arrays was proposed. It is based on the use of methods that operate

on the uniform linear subarrays of the coprime array and that enjoy many

processing advantages. We rst estimate the DOAs for each uniform linear

subarray separately and then combine the estimates the subarrays. For

combining the estimates, we propose a method that projects the estimated

point in the two-dimensional plane onto one-dimensional line segments that

correspond to the entire angular domain. By doing so, we avoid the search

step and consequently, we greatly reduce the computational complexity of

the method. We demonstrate the performance of the method with computer

simulations and compare it with that of the FD-root MUSIC method.- In this paper, a fast search-free method for direction-of-arrival (DOA) estimation

with coprime arrays was proposed. It is based on the use of methods that operate

on the uniform linear subarrays of the coprime array and that enjoy many

processing advantages. We rst estimate the DOAs for each uniform linear

subarray separately and then combine the estimates　the subarrays. For

combining the estimates, we propose a method that projects the estimated

point in the two-dimensional plane onto one-dimensional line segments that

correspond to the entire angular domain. By doing so, we avoid the search

step and consequently, we greatly reduce the computational complexity of

the method. We demonstrate the performance of the method with computer

simulations and compare it with that of the FD-root MUSIC method.