Two-Dimensional Direction-of-Arrival Fast Estimation of Multiple Signals with Matrix Completion Theory in Coprime Planar Array
Haiyun Xu, Yankui Zhang, Bin Ba, Daming Wang, Xiangzhi Li
Abstract
Open-access reader
Haiyun Xu, Yankui Zhang, Bin Ba, Daming Wang, Xiangzhi Li
Abstract
Open-access reader
In estimating the two-dimensional (2D) direction-of-arrival (DOA) using a coprime planar array, the main issues are the high complexity of spectral peak search and the limited degree of freedom imposed by the number of sensors. In this paper, we present an algorithm based on the matrix completion theory in coprime planar array that reduces the computational complexity and obtains a high degree of freedom. The algorithm first analyzes the covariance matrix of received signals to estimate the covariance matrix of a virtual uniform rectangular array, which has the same aperture as the coprime planar array. Matrix completion theory is then applied to estimate the missing elements of the virtual array covariance matrix. Finally, a closed-form DOA solution is obtained using the unitary estimation signal parameters via rotational invariance techniques (Unitary-ESPRIT). Simulation results show that the proposed algorithm has a high degree of freedom, enabling the estimation of more signal DOAs than the number of sensors. The proposed algorithm has reduced computational complexity because the spectral peak search is replaced by Unitary-ESPRIT, but attains similarly high levels accuracy to those of the 2D multiple signal classification algorithm.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In estimating the two-dimensional (2D) direction-of-arrival (DOA) using a coprime planar array, the main issues are the high complexity of spectral peak search and the limited degree of freedom imposed by the number of sensors. In this paper, we present an algorithm based on the matrix completion theory in coprime planar array that reduces the computational complexity and obtains a high degree of freedom. The algorithm first analyzes the covariance matrix of received signals to estimate the covariance matrix of a virtual uniform rectangular array, which has the same aperture as the coprime planar array. Matrix completion theory is then applied to estimate the missing elements of the virtual array covariance matrix. Finally, a closed-form DOA solution is obtained using the unitary estimation signal parameters via rotational invariance techniques (Unitary-ESPRIT). Simulation results show that the proposed algorithm has a high degree of freedom, enabling the estimation of more signal DOAs than the number of sensors. The proposed algorithm has reduced computational complexity because the spectral peak search is replaced by Unitary-ESPRIT, but attains similarly high levels accuracy to those of the 2D multiple signal classification algorithm.
Key concepts: Coprime integers, Rotational invariance, Direction of arrival, Algorithm, Planar array, Computational complexity theory, Covariance matrix, Matrix (chemical analysis)