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

On Fundamental Limits of Joint Sparse Support Recovery Using Certain Correlation Priors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

2
11
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 33 publications
(13 citation statements)
references
References 49 publications
2
11
0
Order By: Relevance
“…The second condition is that m 2 ≥ d, which is much stronger than our m ≥ (log k) 2 condition 1 In [21], a LASSO-based approach is proposed to recover the common support using correlation among the X i s. The authors empirically show that support recovery is possible using the same measurement matrix across samples (with large n) for support size k ≥ m and conjecture that k can be as large as O(m 2 ). In another recent work closely related to ours [19], the authors demonstrate the possibility of operating in the m < k regime. Their results are for the same measurement matrix across samples and for {X i } n i=1 drawn from a certain prior.…”
Section: Introductionsupporting
confidence: 59%
“…The second condition is that m 2 ≥ d, which is much stronger than our m ≥ (log k) 2 condition 1 In [21], a LASSO-based approach is proposed to recover the common support using correlation among the X i s. The authors empirically show that support recovery is possible using the same measurement matrix across samples (with large n) for support size k ≥ m and conjecture that k can be as large as O(m 2 ). In another recent work closely related to ours [19], the authors demonstrate the possibility of operating in the m < k regime. Their results are for the same measurement matrix across samples and for {X i } n i=1 drawn from a certain prior.…”
Section: Introductionsupporting
confidence: 59%
“…In space and air communication, the relative highspeed motion of the transceivers increases the complexity of beam alignment. Therefore, the accurate direction of arrival (DoA) and direction of departure (DoD) estimation is a key issue in MIMO communication [90][91][92]. Solutions have been proposed not only through the implementation of estimation algorithms such as Multiple Signal Classification (MU-SIC) and Estimation of Signal Parameters via Rational Invariance Techniques (ESPRIT), the implemen- tations of customized circuit blocks can also improve the speed and accuracy of alignment significantly [93].…”
Section: Space and Satellite Communicationmentioning
confidence: 99%
“…Both ℓ 1 -SVD and ℓ 1 -SRACV require reduced computational cost than the well-known ℓ 2,1 mixed norm, and are capable of handling coherent signals. The theoretical guarantees for this joint sparse recovery problem from MMVs developed in [26] (the overdetermined case) and [27], [28] (the underdetermined case with sparse arrays and uncorrelated sources) are based on a fixed deterministic measurement matrix representing the steering matrix of an array structure, which deviates from usual scenarios in compressed sensing relying on the randomness of the measurement matrix, while the support recovery for both the deterministic and random measurement matrix is discussed in [29]. Based on the fundamental ℓ 2,1 mixed norm, the MMV atomic norm approach [30] focusing mainly on the noiseless case and the SPARROW approach [31] are proposed as variants capable of incorporating the gridless optimization.…”
Section: Introductionmentioning
confidence: 99%