2013 IEEE International Conference on Acoustics, Speech and Signal Processing 2013
DOI: 10.1109/icassp.2013.6638594
|View full text |Cite
|
Sign up to set email alerts
|

Dictionary-based reconstruction of the cyclic autocorrelation via &#x2113;<inf>1</inf>-minimization for cyclostationary spectrum sensing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…In [31], a method for estimating the cyclic autocorrelation function using a short observation interval is presented. Cyclic spectrum estimation for wide-sense cyclostationary signals sampled at sub-Nyquist rate is made in [57] by uniform sampling and in [18,382] by non-uniform (random) sampling.…”
Section: Compressive Sensingmentioning
confidence: 99%
“…In [31], a method for estimating the cyclic autocorrelation function using a short observation interval is presented. Cyclic spectrum estimation for wide-sense cyclostationary signals sampled at sub-Nyquist rate is made in [57] by uniform sampling and in [18,382] by non-uniform (random) sampling.…”
Section: Compressive Sensingmentioning
confidence: 99%
“…Another one is the symmetry of the CA around the DC component. First steps in this direction showing promising results have been taken in [26]. The drawback of the solution proposed in [26] is that the convex optimization problem used to recover the CA becomes huge for practical parameter choices, which results in a prohibitively large computational complexity.…”
Section: Dictionary Assisted Ca Estimationmentioning
confidence: 99%
“…First steps in this direction showing promising results have been taken in [26]. The drawback of the solution proposed in [26] is that the convex optimization problem used to recover the CA becomes huge for practical parameter choices, which results in a prohibitively large computational complexity. To circumvent this we propose an OMP-based greedy algorithm that takes advantage of the additional prior knowledge while featuring a much smaller complexity than the optimization problem.…”
Section: Dictionary Assisted Ca Estimationmentioning
confidence: 99%