.png){kind=icon}
.png){kind=icon}
Return
Sparse array extension for non-circular signals with subspace and compressive sensing based DOA estimation methods
.png){kind=icon}
OA
AI
DOI：10.1016/j.sigpro.2017.11.012.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The virtual array generation process based on typical sparse arrays is studied for a mixture of circular and non-circular impinging signals. It consists of two sub-arrays: one is the traditional difference co-array and the other one is the new sum co-array. The number of consecutive virtual array sensors is analysed for the nested array case, but it is difficult to give a closed-form result for a general sparse array. Based on the extended covariance matrix of the physical array, two classes of direction of arrival (DOA) estimation algorithms are then developed, with one based on the subspace method and one based on sparse representation or the compressive sensing (CS) concept. Both the consecutive and non-consecutive parts of the virtual array can be exploited by the CS-based method, while only the consecutive part can be exploited by the subspace-based one. As a result, the CS-based solution can have a better performance than the subspace-based one, though at the cost of significantly increased computational complexity. The two classes of algorithms can also deal with the special case when all the signals are noncircular. Simulation results are provided to verify the performance of the proposed algorithms. (C) 2017 Elsevier B.V. All rights reserved.
Keywords:
Non-circular signal
Sparse array
Direction of arrival estimation
Subspace
Compressive sensing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W