2017
DOI: 10.1016/j.dsp.2017.06.026
|View full text |Cite
|
Sign up to set email alerts
|

A generic top-level mechanism for accelerating signal recovery in compressed sensing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 50 publications
0
3
0
Order By: Relevance
“…Therefore, we may be able to scale more sub-carriers, and hence further reduce PAPR, without affecting spectral efficiency. This approach is highly appealing especially in the presence of recent fast compressed sensing decoding mechanisms [74], in addition to its ability to perform efficiently in a highly noisy environment [75], [76].…”
Section: Discussionmentioning
confidence: 99%
“…Therefore, we may be able to scale more sub-carriers, and hence further reduce PAPR, without affecting spectral efficiency. This approach is highly appealing especially in the presence of recent fast compressed sensing decoding mechanisms [74], in addition to its ability to perform efficiently in a highly noisy environment [75], [76].…”
Section: Discussionmentioning
confidence: 99%
“…The literature provides many synthesis methods for reconfigurable antenna arrays, as, for example, [6][7][8] . Here, it is worth noticing that the advantages provided by beam design are also recognized in related works of other research topics, such as, for example, imaging [9,10] , remote sensing [11,12] , signal recovery and reconstruction [13][14][15] and wireless sensor networks [16][17][18] .…”
Section: Introductionmentioning
confidence: 94%
“…Several authors have investigated the use of RP for convex optimization. For example, Rateb et al [13] employed a fixed point precision quadratic programming (QP) 1 -Solver, and a half floating point ADMM was investigated by Wills et al [14]. An approximate stochastic gradient descent (SGD) method was introduced [15] with fewer quantisation steps; this allowed a faster implementation with a slight reduction in performance.…”
Section: Introductionmentioning
confidence: 99%