Finite random matrices for blind spectrum sensing

Giuseppe Thadeu Freitas De Abreu, Wensheng Zhang, Yukitoshi Sanada

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

4 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. Utilizing recently-derived closed-form and exact expressions for the distribution of the standard condition number (SCN) of dual random Wishart matrices, we design a new blind algorithm to detect the presence of PU signals. An inherent property of the technique, which is due to the reliance on SCN's, is that no SNR estimation or any other information on the PU signal is required. Like some similar asymptotic RMT-based techniques recently proposed, the algorithm also admits for a tolerated probability of false alarm α to be accounted for by design. The proposed finite RMT-based algorithm, however, outperforms all known similar alternatives, in consequence of the fact that the distribution of SCN's utilized are in closed-form and exact, for any given matrix size.

Original languageEnglish
Title of host publicationConference Record - Asilomar Conference on Signals, Systems and Computers
Pages116-120
Number of pages5
DOIs
Publication statusPublished - 2010
Event44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010 - Pacific Grove, CA, United States
Duration: 2010 Nov 72010 Nov 10

Other

Other44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010
CountryUnited States
CityPacific Grove, CA
Period10/11/710/11/10

Fingerprint

Cognitive radio

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing

Cite this

De Abreu, G. T. F., Zhang, W., & Sanada, Y. (2010). Finite random matrices for blind spectrum sensing. In Conference Record - Asilomar Conference on Signals, Systems and Computers (pp. 116-120). [5757480] https://doi.org/10.1109/ACSSC.2010.5757480

Finite random matrices for blind spectrum sensing. / De Abreu, Giuseppe Thadeu Freitas; Zhang, Wensheng; Sanada, Yukitoshi.

Conference Record - Asilomar Conference on Signals, Systems and Computers. 2010. p. 116-120 5757480.

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

De Abreu, GTF, Zhang, W & Sanada, Y 2010, Finite random matrices for blind spectrum sensing. in Conference Record - Asilomar Conference on Signals, Systems and Computers., 5757480, pp. 116-120, 44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010, Pacific Grove, CA, United States, 10/11/7. https://doi.org/10.1109/ACSSC.2010.5757480
De Abreu GTF, Zhang W, Sanada Y. Finite random matrices for blind spectrum sensing. In Conference Record - Asilomar Conference on Signals, Systems and Computers. 2010. p. 116-120. 5757480 https://doi.org/10.1109/ACSSC.2010.5757480
De Abreu, Giuseppe Thadeu Freitas ; Zhang, Wensheng ; Sanada, Yukitoshi. / Finite random matrices for blind spectrum sensing. Conference Record - Asilomar Conference on Signals, Systems and Computers. 2010. pp. 116-120
@inproceedings{fdc4f5cf4ba74c949642dbdfb64678a1,
title = "Finite random matrices for blind spectrum sensing",
abstract = "We address the Primary User (PU) detection (spectrum sensing) problem, relevant to cognitive radio, from a finite random matrix theoretical (RMT) perspective. Utilizing recently-derived closed-form and exact expressions for the distribution of the standard condition number (SCN) of dual random Wishart matrices, we design a new blind algorithm to detect the presence of PU signals. An inherent property of the technique, which is due to the reliance on SCN's, is that no SNR estimation or any other information on the PU signal is required. Like some similar asymptotic RMT-based techniques recently proposed, the algorithm also admits for a tolerated probability of false alarm α to be accounted for by design. The proposed finite RMT-based algorithm, however, outperforms all known similar alternatives, in consequence of the fact that the distribution of SCN's utilized are in closed-form and exact, for any given matrix size.",
author = "{De Abreu}, {Giuseppe Thadeu Freitas} and Wensheng Zhang and Yukitoshi Sanada",
year = "2010",
doi = "10.1109/ACSSC.2010.5757480",
language = "English",
isbn = "9781424497218",
pages = "116--120",
booktitle = "Conference Record - Asilomar Conference on Signals, Systems and Computers",

}

TY - GEN

T1 - Finite random matrices for blind spectrum sensing

AU - De Abreu, Giuseppe Thadeu Freitas

AU - Zhang, Wensheng

AU - Sanada, Yukitoshi

PY - 2010

Y1 - 2010

N2 - We address the Primary User (PU) detection (spectrum sensing) problem, relevant to cognitive radio, from a finite random matrix theoretical (RMT) perspective. Utilizing recently-derived closed-form and exact expressions for the distribution of the standard condition number (SCN) of dual random Wishart matrices, we design a new blind algorithm to detect the presence of PU signals. An inherent property of the technique, which is due to the reliance on SCN's, is that no SNR estimation or any other information on the PU signal is required. Like some similar asymptotic RMT-based techniques recently proposed, the algorithm also admits for a tolerated probability of false alarm α to be accounted for by design. The proposed finite RMT-based algorithm, however, outperforms all known similar alternatives, in consequence of the fact that the distribution of SCN's utilized are in closed-form and exact, for any given matrix size.

AB - We address the Primary User (PU) detection (spectrum sensing) problem, relevant to cognitive radio, from a finite random matrix theoretical (RMT) perspective. Utilizing recently-derived closed-form and exact expressions for the distribution of the standard condition number (SCN) of dual random Wishart matrices, we design a new blind algorithm to detect the presence of PU signals. An inherent property of the technique, which is due to the reliance on SCN's, is that no SNR estimation or any other information on the PU signal is required. Like some similar asymptotic RMT-based techniques recently proposed, the algorithm also admits for a tolerated probability of false alarm α to be accounted for by design. The proposed finite RMT-based algorithm, however, outperforms all known similar alternatives, in consequence of the fact that the distribution of SCN's utilized are in closed-form and exact, for any given matrix size.

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

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

U2 - 10.1109/ACSSC.2010.5757480

DO - 10.1109/ACSSC.2010.5757480

M3 - Conference contribution

AN - SCOPUS:79957989662

SN - 9781424497218

SP - 116

EP - 120

BT - Conference Record - Asilomar Conference on Signals, Systems and Computers

ER -