Quickest Eigenvalue-Based Spectrum Sensing using Random Matrix Theory
Martijn Arts, Andreas Bollig, Rudolf Mathar

TL;DR
This paper explores eigenvalue-based spectrum sensing methods using random matrix theory, deriving analytical detection formulas and proposing quickest detection algorithms for improved primary user detection in cognitive radio networks.
Contribution
It introduces new eigenvalue-based quickest detection algorithms and provides analytical expressions for their performance, advancing spectrum sensing techniques.
Findings
Analytical PDF of maximum-minimum eigenvalue for K=2 SUs.
Proposed CUSUM and GLR-based quickest detection algorithms.
Numerical results show faster detection with quickest detection methods.
Abstract
We investigate the potential of quickest detection based on the eigenvalues of the sample covariance matrix for spectrum sensing applications. A simple phase shift keying (PSK) model with additive white Gaussian noise (AWGN), with primary user (PU) and secondary users (SUs) is considered. Under both detection hypotheses (noise only) and (signal + noise) the eigenvalues of the sample covariance matrix follow Wishart distributions. For the case of SUs, we derive an analytical formulation of the probability density function (PDF) of the maximum-minimum eigenvalue (MME) detector under . Utilizing results from the literature under , we investigate two detection schemes. First, we calculate the receiver operator characteristic (ROC) for MME block detector based on analytical results. Second, we introduce two…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCognitive Radio Networks and Spectrum Sensing · Distributed Sensor Networks and Detection Algorithms · Random Matrices and Applications
