KEYWORDS: Sensors, Signal to noise ratio, Matrices, Detection and tracking algorithms, Reconstruction algorithms, Array processing, Radar signal processing
In this paper, we address the problem of direction finding using coprime array, which is one of the most preferred sparse array configurations in the radar community. Motivated by the fact that conventional algorithms based on the convex relaxation is computationally expensive, we propose a non-convex accelerated structured alternating projection-based direction-of-arrival (DoA) estimation approach without the need to solve a semi-definite programming. The low rank Hankel matrices constructed by the sub-arrays of the virtual uniform linear array (ULA) and the sparse hole signal respectively correspond to the sets of low-rank matrices and sparse manifolds. After initialization, we update the estimations by iterative projections between the two sets, which employs an accelerated low-rank approximation method. Once the desired Hankel matrix with DoA information is recovered, simple subspace-based spectral estimation algorithms can be applied to obtain the target directions. The estimation performance in terms of root-mean-square error is examined and the superiority of the proposed method over the competitive approaches in the computational cost sense is also demonstrated.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.