Spectrum sensing algorithms via finite random matrix theory

Giuseppe Thadeu Freitas De Abreu, Wensheng Zhang, Yukitoshi Sanada

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

We address the Primary User (PU) detection (spectrum sensing) problem, relevant to cognitive radio, from a finite random matrix theoretical (RMT) perspective. Specifically, we employ recently-derived closed-form and exact expressions for the distribution of the standard condition number (SCN) of uncorrelated and semi-correlated random dual Wishart matrices of finite sizes, to design Hypothesis-Testing algorithms to detect the presence of PU signals. An inherent characteristic of the SCN/RMT-based approach, is that no signal-to-noise ratio (SNR) estimation or any other information on the PU signal is required. On top of this property, other attractive advantages of the new techniques are: a) due to the accuracy of the finite SCN distributions, superior performance is achieved under a finite number of samples, compared to asymptotic RMT-based alternatives; b) since expressions to model the SCN statistics both in the absence (H0) and presence (H1) of PU signal are used, the statistics of the spectrum sensing problem in question is completely characterized; c) as a consequence of a) and b), accurate and simple analytical expressions for the receiver operating characteristic (ROC) - both in terms of PD as a function of PF and in terms of PA as a function of PM - are yielded. It is also shown that the proposed finite RMT-based algorithms outperforms all similar alternatives currently known in the literature, at a substantially lower complexity.

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
DOIs
Publication statusPublished - 2011
Event2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, Japan
Duration: 2011 Jun 52011 Jun 9

Other

Other2011 IEEE International Conference on Communications, ICC 2011
CountryJapan
CityKyoto
Period11/6/511/6/9

Fingerprint

Statistics
Cognitive radio
Signal to noise ratio
Testing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

De Abreu, G. T. F., Zhang, W., & Sanada, Y. (2011). Spectrum sensing algorithms via finite random matrix theory. In IEEE International Conference on Communications [5963196] https://doi.org/10.1109/icc.2011.5963196

Spectrum sensing algorithms via finite random matrix theory. / De Abreu, Giuseppe Thadeu Freitas; Zhang, Wensheng; Sanada, Yukitoshi.

IEEE International Conference on Communications. 2011. 5963196.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

De Abreu, GTF, Zhang, W & Sanada, Y 2011, Spectrum sensing algorithms via finite random matrix theory. in IEEE International Conference on Communications., 5963196, 2011 IEEE International Conference on Communications, ICC 2011, Kyoto, Japan, 11/6/5. https://doi.org/10.1109/icc.2011.5963196
De Abreu GTF, Zhang W, Sanada Y. Spectrum sensing algorithms via finite random matrix theory. In IEEE International Conference on Communications. 2011. 5963196 https://doi.org/10.1109/icc.2011.5963196
De Abreu, Giuseppe Thadeu Freitas ; Zhang, Wensheng ; Sanada, Yukitoshi. / Spectrum sensing algorithms via finite random matrix theory. IEEE International Conference on Communications. 2011.
@inproceedings{50a9614df53b4015a1ca7d91e79d6904,
title = "Spectrum sensing algorithms via finite random matrix theory",
abstract = "We address the Primary User (PU) detection (spectrum sensing) problem, relevant to cognitive radio, from a finite random matrix theoretical (RMT) perspective. Specifically, we employ recently-derived closed-form and exact expressions for the distribution of the standard condition number (SCN) of uncorrelated and semi-correlated random dual Wishart matrices of finite sizes, to design Hypothesis-Testing algorithms to detect the presence of PU signals. An inherent characteristic of the SCN/RMT-based approach, is that no signal-to-noise ratio (SNR) estimation or any other information on the PU signal is required. On top of this property, other attractive advantages of the new techniques are: a) due to the accuracy of the finite SCN distributions, superior performance is achieved under a finite number of samples, compared to asymptotic RMT-based alternatives; b) since expressions to model the SCN statistics both in the absence (H0) and presence (H1) of PU signal are used, the statistics of the spectrum sensing problem in question is completely characterized; c) as a consequence of a) and b), accurate and simple analytical expressions for the receiver operating characteristic (ROC) - both in terms of PD as a function of PF and in terms of PA as a function of PM - are yielded. It is also shown that the proposed finite RMT-based algorithms outperforms all similar alternatives currently known in the literature, at a substantially lower complexity.",
author = "{De Abreu}, {Giuseppe Thadeu Freitas} and Wensheng Zhang and Yukitoshi Sanada",
year = "2011",
doi = "10.1109/icc.2011.5963196",
language = "English",
isbn = "9781612842332",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Spectrum sensing algorithms via finite random matrix theory

AU - De Abreu, Giuseppe Thadeu Freitas

AU - Zhang, Wensheng

AU - Sanada, Yukitoshi

PY - 2011

Y1 - 2011

N2 - We address the Primary User (PU) detection (spectrum sensing) problem, relevant to cognitive radio, from a finite random matrix theoretical (RMT) perspective. Specifically, we employ recently-derived closed-form and exact expressions for the distribution of the standard condition number (SCN) of uncorrelated and semi-correlated random dual Wishart matrices of finite sizes, to design Hypothesis-Testing algorithms to detect the presence of PU signals. An inherent characteristic of the SCN/RMT-based approach, is that no signal-to-noise ratio (SNR) estimation or any other information on the PU signal is required. On top of this property, other attractive advantages of the new techniques are: a) due to the accuracy of the finite SCN distributions, superior performance is achieved under a finite number of samples, compared to asymptotic RMT-based alternatives; b) since expressions to model the SCN statistics both in the absence (H0) and presence (H1) of PU signal are used, the statistics of the spectrum sensing problem in question is completely characterized; c) as a consequence of a) and b), accurate and simple analytical expressions for the receiver operating characteristic (ROC) - both in terms of PD as a function of PF and in terms of PA as a function of PM - are yielded. It is also shown that the proposed finite RMT-based algorithms outperforms all similar alternatives currently known in the literature, at a substantially lower complexity.

AB - We address the Primary User (PU) detection (spectrum sensing) problem, relevant to cognitive radio, from a finite random matrix theoretical (RMT) perspective. Specifically, we employ recently-derived closed-form and exact expressions for the distribution of the standard condition number (SCN) of uncorrelated and semi-correlated random dual Wishart matrices of finite sizes, to design Hypothesis-Testing algorithms to detect the presence of PU signals. An inherent characteristic of the SCN/RMT-based approach, is that no signal-to-noise ratio (SNR) estimation or any other information on the PU signal is required. On top of this property, other attractive advantages of the new techniques are: a) due to the accuracy of the finite SCN distributions, superior performance is achieved under a finite number of samples, compared to asymptotic RMT-based alternatives; b) since expressions to model the SCN statistics both in the absence (H0) and presence (H1) of PU signal are used, the statistics of the spectrum sensing problem in question is completely characterized; c) as a consequence of a) and b), accurate and simple analytical expressions for the receiver operating characteristic (ROC) - both in terms of PD as a function of PF and in terms of PA as a function of PM - are yielded. It is also shown that the proposed finite RMT-based algorithms outperforms all similar alternatives currently known in the literature, at a substantially lower complexity.

UR - http://www.scopus.com/inward/record.url?scp=80052173711&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052173711&partnerID=8YFLogxK

U2 - 10.1109/icc.2011.5963196

DO - 10.1109/icc.2011.5963196

M3 - Conference contribution

AN - SCOPUS:80052173711

SN - 9781612842332

BT - IEEE International Conference on Communications

ER -