.png){kind=icon}
Return
Array Interpolation Using Covariance Matrix Completion of Minimum-Size Virtual Array
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2017.2708750.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Sparse arrays increase aperture and resolution capability for direction-of-arrival estimation. Spatial smoothing step in coarrayMUSIC algorithm prevents us from using the full coarray; so, there is a limitation for aperture Na and degrees of freedom that are determined by minimum redundancy arrays. Interpolation methods can reduce this limitation and make it possible to use the full coarray of partially augmentable arrays. In interpolation methods based on matrix completion techniques, we should complete an N-a x N-a Toeplitzmatrix. For this purpose, a semidefinite programming (SDP) with O(Na-6) complexity should be solved. In this letter, we introduce a set that contains arrays that have the equal aperture with original array and have filled coarray. By selecting the array that have minimum number of sensors in this set, we formulate a new structured matrix completion problem. Numerical examples indicate that the proposed structured matrix completion not only decreases the complexity of SDP problem but also, in many instances, increases the estimation accuracy and probability of resolution.
Keywords:
Direction-of-arrival (DOA)
interpolation
matrix completion
sparse arrays
virtual array
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave
View more