Compressed Spectrum Sensing Using Sparse Recovery Convergence Patterns through Machine Learning Classification

Despite the well-known success of sub-Nyquist sampling in reducing the hardware and computational costs of spectrum sensing, it still has the shortcoming of requiring a pre-determined spectrum sparsity level. This paper proposes an algorithm for sub-Nyquist wide-band spectrum sensing addressing this shortcoming. The proposed algorithm divides the spectrum into narrow, contagious frequency subbands and learns a subband dictionary for each subband. A subband dictionary is well-suited for the representation of signals in its corresponding subband. A compressed version of the received signal is sparsely coded over each subband dictionary. We show that the convergence patterns over a specific dictionary can be used for identifying the occupancy of its underlying subband. Therefore, the convergence patterns obtained by the gradient operator are used as distinctive classifying features. Then, a machine learning-based classifier is trained over these features and used to make the decision about spectrum occupancy. As the interest is only to characterize sparse coding convergence patterns, we alleviate the need for a specific or an estimated sparsity level. Besides, using subband dictionaries at different frequencies omits the need for a frequency-splitting filterbank. The proposed algorithm achieves significant performance improvements in terms of the probability-of-detection and false-alarm-rate measures. This result is validated through simulations with various operating scenarios.