Cooperative spectrum sensing based on the limiting eigenvalue ratio distribution in wishart matrices

Recent advances in random matrix theory have spurred the adoption of eigenvalue-based detection techniques for cooperative spectrum sensing in cognitive radio. These techniques use the ratio between the largest and the smallest eigenvalues of the received signal covariance matrix to infer the presence or absence of the primary signal. The results derived so far are based on asymptotical assumptions, due to the difficulties in characterizing the exact eigenvalues ratio distribution. By exploiting a recent result on the limiting distribution of the smallest eigenvalue in complex Wishart matrices, in this paper we derive an expression for the limiting eigenvalue ratio distribution, which turns out to be much more accurate than the previous approximations also in the non-asymptotical region. This result is then applied to calculate the decision sensing threshold as a function of a target probability of false alarm. Numerical simulations show that the proposed detection rule provides a substantial improvement compared to the other eigenvalue-based algorithms.