Exact distributions of finite random matrices and their applications to spectrum sensing

The exact and simple distributions of finite random matrix theory (FRMT) are critically important for cognitive radio networks (CRNs). In this paper, we unify some existing distributions of the FRMT with the proposed coefficient matrices (vectors) and represent the distributions with the coefficient-based formulations. A coefficient reuse mechanism is studied, i.e., the same coefficient matrices (vectors) can be exploited to formulate different distributions. For instance, the same coefficient matrices can be used by the largest eigenvalue (LE) and the scaled largest eigenvalue (SLE); the same coefficient vectors can be used by the smallest eigenvalue (SE) and the Demmel condition number (DCN). A new and simple cumulative distribution function (CDF) of the DCN is also deduced. In particular, the dimension boundary between the infinite random matrix theory (IRMT) and the FRMT is initially defined. The dimension boundary provides a theoretical way to divide random matrices into infinite random matrices and finite random matrices. The FRMT-based spectrum sensing (SS) schemes are studied for CRNs. The SLE-based scheme can be considered as an asymptotically-optimal SS scheme when the dimension K is larger than two. Moreover, the standard condition number (SCN)-based scheme achieves the same sensing performance as the SLE-based scheme for dual covariance matrix K=2. The simulation results verify that the coefficient-based distributions can fit the empirical results very well, and the FRMT-based schemes outperform the IRMT-based schemes and the conventional SS schemes.