2018
DOI: 10.1109/tsp.2018.2872012
|View full text |Cite
|
Sign up to set email alerts
|

Direction-of-Arrival Estimation for Coprime Array via Virtual Array Interpolation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
204
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 470 publications
(226 citation statements)
references
References 46 publications
0
204
0
Order By: Relevance
“…This parametrizes the optimization problem only in terms of the desired parameters, i.e., γ 0 , · · · , γ K and thereby eliminates the constraints corresponding to δ i 0 , · · · , δ i K ∀i. Towards this, in what follows, we use the fact that the remainder h i (z) generated by division of q i (z) by f (z) is zero according to (23). Letñ be an integer such that a ĩ n < K and a ĩ n+1 ≥ K. It is then possible to rewrite…”
Section: Wls Implementation For Slas With Holes In Co-arraysmentioning
confidence: 99%
See 2 more Smart Citations
“…This parametrizes the optimization problem only in terms of the desired parameters, i.e., γ 0 , · · · , γ K and thereby eliminates the constraints corresponding to δ i 0 , · · · , δ i K ∀i. Towards this, in what follows, we use the fact that the remainder h i (z) generated by division of q i (z) by f (z) is zero according to (23). Letñ be an integer such that a ĩ n < K and a ĩ n+1 ≥ K. It is then possible to rewrite…”
Section: Wls Implementation For Slas With Holes In Co-arraysmentioning
confidence: 99%
“…Further, CAB-MUSIC and CAB-ESPRIT suffer from an inherent performance loss when applied to SLAs with holes in their difference co-arrays, such as co-prime arrays, since they discard the information contained in the non-contiguous segment of the difference co-array. To avoid this performance loss, array interpolation-based algorithms has been used for co-prime arrays in [23]- [25] where a convex optimization problem is formulated to recover the covariance matrix of a virtual ULA interpolated from the co-prime array. The performance of interpolation-based algorithms has been analyzed in [26].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…erefore, the fast-moving targets are defined as the ones with nonstationary DOA between adjacent pulses. e compressed sensing-(CS-) based methods have been proposed [29,30] to improve the DOA estimation performance with fewer measurements, where the target sparsity is exploited in the spatial domain [31][32][33][34][35]. erefore, the DOA estimation for the sparse targets is transformed into the sparse reconstruction problem in the CS-based methods [36,37,37], and the sparse-based methods can be used in the scenario with fast-moving targets.…”
Section: Introductionmentioning
confidence: 99%
“…Many sparse signal recovery algorithms have been proposed in CS literature, which can be applied to estimate the DOAs by exploiting the spatial sparsity [20][21][22][23][24]. FOCUSS (FOcal Underdetermined System Solver) [25] uses an iterative method which is based on weighted norm minimization.…”
Section: Introductionmentioning
confidence: 99%