Advanced methods in automatic modulation classification for emerging technologies

Modulation classification (MC) is of large importance in both military and commercial communication applications. It is a challenging problem, especially in non-cooperative wireless environments, where channel fading and no prior knowledge on the incoming signal are major factors that deteriorate the reception performance. Although the average likelihood ratio test method can provide an optimal solution to the MC problem with unknown parameters, it suffers from high computational complexity and in some cases mathematical intractability. Instead, in this research, an array-based quasi-hybrid likelihood ratio test (qHLRT) algorithm is proposed, which depicts two major advantages. First, it is simple yet accurate enough parameter estimation with reduced complexity. Second the incorporation of antenna arrays offers an effective ability to combat fading. Furthermore, a practical array-based qHLRT classifier scheme is implemented, which applies maximal ratio combining (MRC) to increase the accuracy of both carrier frequency offset (CFO) estimation and likelihood function calculation in channel fading. In fact, double CFO estimations are executed in this classifier. With the first the unknown CFO, phase offsets and amplitudes are estimated as prerequisite for MRC operation. Then, MRC is performed using these estimates, followed by a second CFO estimator. Since the input of the second CFO estimator is the output of the MRC, fading effects on the incoming signals are removed significantly and signal-to-noise ratio (SNR) is augmented. As a result, a more accurate CFO estimate is obtained. Consequently, the overall classification performance is improved, especially in low SNR environment. Recently, many state-of-the-arts communication technologies, such as orthogonal frequency division multiplexing (OFDM) modulations, have been emerging. The need for distinguishing OFDM signal from single carrier has become obvious. Besides, some vital parameters of OFDM signals should be extracted for further processing. In comparison to the research on MC for single carrier single antenna transmission, much less attention has been paid to the MC for emerging modulation methods. A comprehensive classification system is proposed for recognizing the OFDM signal and extracting its parameters. An automatic OFDM modulation classifier is proposed, which is based on the goodness-of-fittest. Since OFDM signal is Gaussian, Cramer-von Mises technique, working on the empirical distribution function, has been applied to test the presence of the normality. Numerical results show that such approach can successfully identify OFDM signals from single carrier modulations over a wide SNR range. Moreover, the proposed scheme can provide the acceptable performance when frequency-selective fading is present. Correlation test is then applied to estimate OFDM cyclic prefix duration. A two-phase searching scheme, which is based on Fast Fourier Transform (FFT) as well as Gaussianity test, is devised to detect the number of subcarriers. In the first phase, a coarse search is carried out iteratively. The exact number of subcarriers is determined by the fine tune in the second phase. Both analytical work and numerical results are presented to verify the efficiency of the proposed scheme

A Survey of Blind Modulation Classification Techniques for OFDM Signals

Blind modulation classification (MC) is an integral part of designing an adaptive or intelligent transceiver for future wireless communications. Blind MC has several applications in the adaptive and automated systems of sixth generation (6G) communications to improve spectral efficiency and power efficiency, and reduce latency. It will become a integral part of intelligent software-defined radios (SDR) for future communication. In this paper, we provide various MC techniques for orthogonal frequency division multiplexing (OFDM) signals in a systematic way. We focus on the most widely used statistical and machine learning (ML) models and emphasize their advantages and limitations. The statistical-based blind MC includes likelihood-based (LB), maximum a posteriori (MAP) and feature-based methods (FB). The ML-based automated MC includes k-nearest neighbors (KNN), support vector machine (SVM), decision trees (DTs), convolutional neural networks (CNNs), recurrent neural networks (RNNs), and long short-term memory (LSTM) based MC methods. This survey will help the reader to understand the main characteristics of each technique, their advantages and disadvantages. We have also simulated some primary methods, i.e., statistical- and ML-based algorithms, under various constraints, which allows a fair comparison among different methodologies. The overall system performance in terms bit error rate (BER) in the presence of MC is also provided. We also provide a survey of some practical experiment works carried out through National Instrument hardware over an indoor propagation environment. In the end, open problems and possible directions for blind MC research are briefly discussed

Strategies for Devising Automatic Signal Recognition Algorithms in a Shared Radio Environment

In an increasingly congested and complex radio environment interference is to be expected, which poses problems for Automatic Signal Recognition (ASR) systems. This thesis explores strategies for improving ASR performance in the presence of interference. The thesis breaks the overall research question down into a number of subquestions and explores each of these in turn. A Phase-symmetric Cross Recurrence Plot is developed and used to show how a radio signal can be manipulated to separate information about the modulation from the information being carried. The Logarithmic Cyclic frequency Domain Profile is introduced to illustrate how a logarithmic representation can be used for analysing mixtures of signals with very different cyclic frequencies. After defining a canonical ASR system architecture, the concepts of an Ideal Feature and Interference Selectivity are introduced and applied to typical features used in ASR processing. Finally it is shown how these algorithmic developments can be combined in a Bayesian chain implementation that can accommodate a wide variety of feature extraction algorithms. It is concluded that future ASR systems will require features that can handle a wide range of signal types with much higher levels of interference selectivity if they are to achieve acceptable performance in shared spectrum bands. Intelligent segmentation is shown to be a requirement for future ASR systems unless features can be developed that have near ideal performance

Blind Estimation of OFDM System Parameters for Automatic Signal Identification

Orthogonal frequency division multiplexing (OFDM) has gained worldwide popular­ ity in broadband wireless communications recently due to its high spectral efficiency and robust performance in multipath fading channels. A growing trend of smart receivers which can support and adapt to multiple OFDM based standards auto­ matically brings the necessity of identifying different standards by estimating OFDM system parameters without a priori information. Consequently, blind estimation and identification of OFDM system parameters has received considerable research atten­ tions. Many techniques have been developed for blind estimation of various OFDM parameters, whereas estimation of the sampling frequency is often ignored. Further­ more, the estimated sampling frequency of an OFDM signal has to be very accurate for data recovery due to the high sensitivity of OFDM signals to sampling clock offset. To address the aforementioned problems, we propose a two-step cyclostation- arity based algorithm with low computational complexity to precisely estimate the sampling frequency of a received oversampled OFDM signal. With this estimated sampling frequency and oversampling ratio, other OFDM system parameters, i.e., the number of subcarriers, symbol duration and cyclic prefix (CP) length can be es­ timated based on the cyclic property from CP sequentially. In addition, modulation scheme used in the OFDM can be classified based on the higher-order statistics (HOS) of the frequency domain OFDM signal. All the proposed algorithms are verified by a lab testing system including a vec­ tor signal generator, a spectrum analyzer and a high speed digitizer. The evaluation results confirm the high precision and efficacy of the proposed algorithm in realistic scenarios

Modulation Classification for MIMO-OFDM Signals via Approximate Bayesian Inference

The problem of modulation classification for a multiple-antenna (MIMO) system employing orthogonal frequency division multiplexing (OFDM) is investigated under the assumption of unknown frequency-selective fading channels and signal-to-noise ratio (SNR). The classification problem is formulated as a Bayesian inference task, and solutions are proposed based on Gibbs sampling and mean field variational inference. The proposed methods rely on a selection of the prior distributions that adopts a latent Dirichlet model for the modulation type and on the Bayesian network formalism. The Gibbs sampling method converges to the optimal Bayesian solution and, using numerical results, its accuracy is seen to improve for small sample sizes when switching to the mean field variational inference technique after a number of iterations. The speed of convergence is shown to improve via annealing and random restarts. While most of the literature on modulation classification assume that the channels are flat fading, that the number of receive antennas is no less than that of transmit antennas, and that a large number of observed data symbols are available, the proposed methods perform well under more general conditions. Finally, the proposed Bayesian methods are demonstrated to improve over existing non-Bayesian approaches based on independent component analysis and on prior Bayesian methods based on the `superconstellation' method.Comment: To be appear in IEEE Trans. Veh. Technolog

Efficient blind symbol rate estimation and data symbol detection algorithms for linearly modulated signals

Blind estimation of unknown channel parameters and data symbol detection represent major open problems in non-cooperative communication systems such as automatic modulation classification (AMC). This thesis focuses on estimating the symbol rate and detecting the data symbols. A blind oversampling-based signal detector under the circumstance of unknown symbol period is proposed. The thesis consists of two parts: a symbol rate estimator and a symbol detector. First, the symbol rate is estimated using the EM algorithm. In the EM algorithm, it is difficult to obtain the closed form of the log-likelihood function and the density function. Therefore, both functions are approximated by using the Particle Filter (PF) technique. In addition, the symbol rate estimator based on cyclic correlation is proposed as an initialization estimator since the EM algorithm requires initial estimates. To take advantage of the cyclostationary property of the received signal, there is a requirement that the sampling period should be at least four times less than the symbol period on the receiver side. Second, the blind data symbol detector based on the PF algorithm is designed. Since the signal is oversampled at the receiver side, a delayed multi-sampling PF detector is proposed to manage inter-symbol interference, which is caused by over- sampling, and to improve the demodulation performance of the data symbols. In the PF algorithm, the hybrid importance function is used to generate both data samples and channel model coe±cients, and the Mixture Kalman Filter (MKF) algorithm is used to marginalize out the fading channel coe±cients. At the end, two resampling schemes are adopted