Improved Blind Spectrum Sensing by Covariance Matrix Cholesky Decomposition and RBF-SVM Decision Classification at Low SNRs

Abstract

An improved blind spectrum sensing scheme is established by the covariance matrix Cholesky decomposition and radial basis function (RBF)-support vector machine (SVM) decision classification at low signal-to-noise ratios (SNRs). Under strong background noises, the proposed scheme improves the recognition rate of primary users (PUs) than that of the current blind spectrum sensing. First, the ratio of the maximum-to-minimum eigenvalue of a covariance matrix obtained by the Cholesky decomposition is used to construct the statistics. Second, the statistics are labeled with ''+1'' or ''−1,'' namely, the energy characteristics of the training samples are extracted and marked with ''+1'' for PUs and ''−1'' for noises. Finally, an RBF-SVM classification model, with an intelligent RBF as the SVM kernel function, is obtained by training the above-mentioned statistics and the labels. Thus, the received signals are classified as PUs or not be trained in the SVM model. The threshold possesses self-learning ability, and it distinguishes PU signals from noises effectively. The classification among PU signals and noises is implemented by the optimal SVM decision boundary, derived from maximizing the margin of the decision boundary of trained samples for efficient detection. In addition, the complexity of the statistic construction is lower than that of the conventional maximum minimum eigenvalue (MME). The simulation results show that the RBF in our scheme has 77.5% accuracy at −10 dB, and it outperforms linear kernel function significantly by about 27.5% in accuracy at −10 dB. In addition, the average error probability of the proposed scheme is reduced by about 26% when compared with those of original SVM schemes at −20 dB. The proposed scheme also outperforms the current MME detection in detection probability over 10% at −20 dB. Therefore, the proposed blind spectrum sensing scheme can be efficiently used to detect the PUs by the covariance matrix Cholesky decomposition and the RBF-SVM decision classification in the fifth-generation (5G) communications, especially at low SNRs.

Complex Fault Source Identification Method for High-Voltage Trip-Offs of Wind Farms Based on SU-MRMR and PSO-SVM

“…Originally, SVM is used to solve binary classification problems. For nonlinear classification, it is transformed into a problem of linear classification in high dimension space by the use of kernel functions [29], [30].…”

A Comprehensive Review on Artificial Intelligence/Machine Learning Algorithms for Empowering the Future IoT Toward 6G Era

“…Low enery utilization and synchronization error SVM [84] Blind spectrum sensing Primary user detection at low SNR values [85] DoA estimation of ESPAR antenna Estimation accuracy obtained from RSS values [86] Video traffic prediction Validation of the prediction model formed by incorporating smoothing mechanism and SVM [87] Passenger traffic modelling Validation of the model in crowded situation [88] Sensor network fault detection Validation of the classifier performance [89] Precision determination of the collected data…”

Adjustment strategy of a learning‐based faulty zone locator for distribution systems

“…In the case of using the Gaussian RBF kernel in Equation (7), only two parameters are required, the first one is related to the kernel transformation (σ), and the other is the penalization constant of the optimization problem (C). 27,28,30 In the proposed approach, the strategy proposed in Reference 29 is used to determine the SVM parameters.…”