2014 IEEE International Symposium on Information Theory 2014
DOI: 10.1109/isit.2014.6875153
|View full text |Cite
|
Sign up to set email alerts
|

A greedy search algorithm with tree pruning for sparse signal recovery

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…In order to achieve further reduction in complexity, we also employ a new stopping criterion with marginal performance loss by limiting the minimum pruning threshold. Moreover, compared to [ 31 ], we demonstrate that such modifications not only reduce the search complexity, but also improve the exact recovery condition (ERC) bound. From numerical simulations, we show that our proposed method outperforms the existing methods with practical complexity and provides additional flexibility for hardware implementation.…”
Section: Introductionmentioning
confidence: 94%
See 1 more Smart Citation
“…In order to achieve further reduction in complexity, we also employ a new stopping criterion with marginal performance loss by limiting the minimum pruning threshold. Moreover, compared to [ 31 ], we demonstrate that such modifications not only reduce the search complexity, but also improve the exact recovery condition (ERC) bound. From numerical simulations, we show that our proposed method outperforms the existing methods with practical complexity and provides additional flexibility for hardware implementation.…”
Section: Introductionmentioning
confidence: 94%
“…While the preliminary version of this work was presented for an arbitrary system in [ 31 ], we show that the proposed method is highly suitable for ECG processing with some modifications and performs close to the best possible estimator (the estimator referred to as the oracle least squares (LS) estimator where the support information is given) [ 32 ]. To be specific, we reduced the cardinality of Θ for constructing smaller number of paths in the search tree for real-time implementation.…”
Section: Introductionmentioning
confidence: 99%