2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2016
DOI: 10.1109/icassp.2016.7472215
|View full text |Cite
|
Sign up to set email alerts
|

Non-asymptotic performance bounds of eigenvalue based detection of signals in non-Gaussian noise

Abstract: The core component of a cognitive radio is its detector. When a device is equipped with multiple antennas, the detection method is usually based on an eigenvalue analysis. This paper explores the performance of the most common largest eigenvalue detector, for the case of a narrowband temporally white signal and calibrated receiver noise. In contrast to popular Gaussian assumption, our performance bounds are valid for any signal and noise that belong to the wide class of sub-Gaussian random processes. Moreover,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 30 publications
0
3
0
Order By: Relevance
“…The influence of non-Gaussian (more particularly, sub-Gaussian) distributed noise on the EBD, is explored in [101]. The maximal eigenvalue (ME) λ 1 is regarded as a TS, and an upper bound for the detector's performance, dependent on N RX , N and γ , is derived.…”
Section: Eigenvalue-based Detectionmentioning
confidence: 99%
“…The influence of non-Gaussian (more particularly, sub-Gaussian) distributed noise on the EBD, is explored in [101]. The maximal eigenvalue (ME) λ 1 is regarded as a TS, and an upper bound for the detector's performance, dependent on N RX , N and γ , is derived.…”
Section: Eigenvalue-based Detectionmentioning
confidence: 99%
“…In this section, the complexity of the OSO and COS schemes are compared. The computational complexity of the OSO scheme depends on two major operations; 1) ordering operation and 2) computation of the test statistic T C,OSO (X) in (23) in Cauchy noise environment and T G,OSO (X) in (24) in Gaussian noise environment. For convenience, we assume that the dispersion parameters {γ k } K k=1 are the same in Cauchy noise environment.…”
Section: Complexity Analysismentioning
confidence: 99%
“…Specifically, a random variable w is said to be σ 2 -sub-Gaussian with variance proxy σ 2 if it has zero mean and its moment generating function (MGF) satisfies E[e sw ] ≤ e σ 2 s 2 /2 for all s ∈ R. Clearly, the classic AWGN model is a special case of our model, in which w ∼ N (0, σ 2 ). A more general common communication model that our model captures is the case where the desired signal is attenuated by the fading channel and received with an additive external bounded interferer plus white Gaussian noise [42].…”
Section: A Transmission Schemementioning
confidence: 99%