2016 Eighth International Conference on Ubiquitous and Future Networks (ICUFN) 2016
DOI: 10.1109/icufn.2016.7537024
|View full text |Cite
|
Sign up to set email alerts
|

Exact quickest spectrum sensing algorithms for eigenvalue-based change detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…A well‐known algorithm used in quickest detection is the cumulative sum (CUSUM) algorithm [20]. It evaluates recursively on a sample‐by‐sample basis, so we set the number of sensing samples L to be 1 [7, 10, 11].…”
Section: Quickest Detectionmentioning
confidence: 99%
See 1 more Smart Citation
“…A well‐known algorithm used in quickest detection is the cumulative sum (CUSUM) algorithm [20]. It evaluates recursively on a sample‐by‐sample basis, so we set the number of sensing samples L to be 1 [7, 10, 11].…”
Section: Quickest Detectionmentioning
confidence: 99%
“…Even if a very strong PU signal is present, we need to wait for the entire block before a decision is made. This may introduce significant delays, which may either result in interference for the PUs or reduce the data rate by shortening the transmission window of the SUs [11].…”
Section: Introductionmentioning
confidence: 99%