In this paper, we propose a novel primary user detection scheme for spectrum sensing in cognitive radio. Inspired by the conventional signal classification approach, the spectrum sensing is translated into a classification problem. On the basis of feature-based classification, the spectral correlation of a second-order cyclostationary analysis is applied as the feature extraction method, whereas a stacked denoising autoencoders network is applied as the classifier. Two training methods for signal detection, interception-based detection and simulation-based detection, are considered, for different prior information and implementation conditions. In an interception-based detection method, inspired by the two-step sensing, we obtain training data from the interception of actual signals after a sophisticated sensing procedure, to achieve detection without priori information. In addition, benefiting from practical training data, this interception-based detection is superior under actual transmission environment conditions. The alternative, a simulation-based detection method utilizes some undisguised parameters of the primary user in the spectrum of interest. Owing to the diversified predetermined training data, simulation-based detection exhibits transcendental robustness against harsh noise environments, although it demands a more complicated classifier network structure. Additionally, for the above-described training methods, we discuss the classifier complexity over implementation conditions and the trade-off between robustness and detection performance. The simulation results show the advantages of the proposed method over conventional spectrum-sensing schemes.

In this paper, we address the survivable routing problem with and without wavelength-continuity constraints by proposing a new Integer Linear Programming (ILP) algorithm, which is based on a simplified necessary and sufficient condition. Numerical results are given and discussed to show the efficiency of our algorithm and the impact of wavelength-continuity constraints.

The spectrum sensing of the orthogonal frequency division multiplexing (OFDM) system in cognitive radio (CR) has always been challenging, especially for user terminals that utilize the full-duplex (FD) mode. We herein propose an advanced FD spectrum-sensing scheme that can be successfully performed even when severe self-interference is encountered from the user terminal. Based on the “classification-converted sensing” framework, the cyclostationary periodogram generated by OFDM pilots is exhibited in the form of images. These images are subsequently plugged into convolutional neural networks (CNNs) for classifications owing to the CNN's strength in image recognition. More importantly, to realize spectrum sensing against residual self-interference, noise pollution, and channel fading, we used adversarial training, where a CR-specific, modified training database was proposed. We analyzed the performances exhibited by the different architectures of the CNN and the different resolutions of the input image to balance the detection performance with computing capability. We proposed a design plan of the signal structure for the CR transmitting terminal that can fit into the proposed spectrum-sensing scheme while benefiting from its own transmission. The simulation results prove that our method has excellent sensing capability for the FD system; furthermore, our method achieves a higher detection accuracy than the conventional method.

In this paper, we propose a genetic algorithm (GA) based equalization approach for direct sequence ultra-wideband (DS-UWB) wireless communication systems, where the GA is combined with a RAKE receiver to combat the inter-symbol interference (ISI) due to the frequency selective nature of UWB channels for high data rate transmission. The proposed GA based equalizer outperforms significantly the RAKE and the RAKE-minimum mean square error (MMSE) receivers according to results obtained from intensive simulation work. The RAKE-GA receiver also provides bit-error-rate (BER) performance very close to that of the optimal RAKE-maximum likelihood detection (MLD) approach, while offering a much lower computational complexity.