2013
DOI: 10.1109/tap.2013.2256093
|View full text |Cite
|
Sign up to set email alerts
|

Directions-of-Arrival Estimation Through Bayesian Compressive Sensing Strategies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
169
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 242 publications
(172 citation statements)
references
References 36 publications
0
169
0
Order By: Relevance
“…To deal with the complex-valued variables in the context of MT-BCS which was originally developed to handle realvalued problems [14], the real and imaginary components of a complex variable are treated as two separate variables in [16] without utilizing the fact that their nonzero entries usually appear at the same positions. The CMT-BCS algorithm treats the real and imaginary components as group sparse and α q is shared and jointly estimated for both real and imagery components [17].…”
Section: Cmt-bcs Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…To deal with the complex-valued variables in the context of MT-BCS which was originally developed to handle realvalued problems [14], the real and imaginary components of a complex variable are treated as two separate variables in [16] without utilizing the fact that their nonzero entries usually appear at the same positions. The CMT-BCS algorithm treats the real and imaginary components as group sparse and α q is shared and jointly estimated for both real and imagery components [17].…”
Section: Cmt-bcs Algorithmmentioning
confidence: 99%
“…The BCS algorithm based on the relevance vector machine (RVM) [15] has constituted a family of algorithms to recover sparse signals, and it is applied in this paper to solve the sparse reconstruction problem because it can achieve superior performance and is less sensitive to the coherence of the dictionary entries. To handle complex values involved in the underlying DOA estimation problem, a complex value can be decomposed into the real and imaginary components [16]. In this paper, we exploit the complex multitask compressive sensing (CMT-CS) algorithm [17] which achieves an improved performance by exploiting the sparsity pattern shared by the real and imaginary components of the complex-valued observations.…”
Section: Introductionmentioning
confidence: 99%
“…In addition, to apply CS algorithms, the sampling matrix must satisfy the restricted isometry property (RIP) for guaranteeing reliable estimators. Such a condition cannot be easily verified because it results computational demanding [10,11].…”
Section: Introductionmentioning
confidence: 99%
“…The most successful one is L1-SVD [5], which exploits the L 1 norm to reconstruct sparse signals and applies singular value decomposition (SVD) to reduce computational complexity. In [6][7][8], the Bayesian compressive sensing (BCS) framework is successfully applied in DOA estimation. In [9], a algorithm called L1-SRACV is presented for DOA estimation, based on sparse representation of array covariance vectors.…”
Section: Introductionmentioning
confidence: 99%