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

Histogram equalization for robust text-independent speaker verification in telephone environments

Word processed copy. Includes bibliographical references

Automatic classification of digital communication signal modulations

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel UniversityAutomatic modulation classification detects the modulation type of received communication signals. It has important applications in military scenarios to facilitate jamming, intelligence, surveillance, and threat analysis. The renewed interest from civilian scenes has been fuelled by the development of intelligent communications systems such as cognitive radio and software defined radio. More specifically, it is complementary to adaptive modulation and coding where a modulation can be deployed from a set of candidates according to the channel condition and system specification for improved spectrum efficiency and link reliability. In this research, we started by improving some existing methods for higher classification accuracy but lower complexity. Machine learning techniques such as k-nearest neighbour and support vector machine have been adopted for simplified decision making using known features. Logistic regression, genetic algorithm and genetic programming have been incorporated for improved classification performance through feature selection and combination. We have also developed a new distribution test based classifier which is tailored for modulation classification with the inspiration from Kolmogorov-Smirnov test. The proposed classifier is shown to have improved accuracy and robustness over the standard distribution test. For blind classification in imperfect channels, we developed the combination of minimum distance centroid estimator and non-parametric likelihood function for blind modulation classification without the prior knowledge on channel noise. The centroid estimator provides joint estimation of channel gain and carrier phase o set where both can be compensated in the following nonparametric likelihood function. The non-parametric likelihood function, in the meantime, provide likelihood evaluation without a specifically assumed noise model. The combination has shown to have higher robustness when different noise types are considered. To push modulation classification techniques into a more timely setting, we also developed the principle for blind classification in MIMO systems. The classification is achieved through expectation maximization channel estimation and likelihood based classification. Early results have shown bright prospect for the method while more work is needed to further optimize the method and to provide a more thorough validation.School of Engineering and Design Brunel University London, the Faculty of Engineering University of Liverpool, and the University of Liverpool Graduate Association (Hong Kong)

Adaptive multicoding and robust linear-quadratic receivers for uncertain CDMA frequency-selective fading channels

Wideband Code Division Multiple Access (WCDMA) communications in the presence of channel uncertainty poses a challenging problem with many practical applications in the wireless communications filed. In this dissertation, robust linear-quadratic (LQ) receivers for time-varying, frequency-selective CDMA channels in the presence of uncertainty regarding instantaneous channel state information are proposed and studied. In order to enhance the performance of the LQ receivers, a novel modulation technique adaptive multicoding is employed. We proposed a simple, intuitively appealing cost function the modified deflection ratio that can be maximized to find signal constellations and associated LQ receivers that are optimal in a certain sense. We discuss the properties of the proposed LQ cost function and derive a related adaptive algorithm for the simultaneous design of signals and receivers based on a simple multicoding technique. The Chernoff bound for the LQ receivers is also derived to compensate for the analytical intractability of the probability of bit error. Finally, in order to achieve higher data rate transmission in favorable channels, we extend our approach from binary signals to M-ary signal constellations in a multi-dimension subspace

Physiologically-Motivated Feature Extraction Methods for Speaker Recognition

Speaker recognition has received a great deal of attention from the speech community, and significant gains in robustness and accuracy have been obtained over the past decade. However, the features used for identification are still primarily representations of overall spectral characteristics, and thus the models are primarily phonetic in nature, differentiating speakers based on overall pronunciation patterns. This creates difficulties in terms of the amount of enrollment data and complexity of the models required to cover the phonetic space, especially in tasks such as identification where enrollment and testing data may not have similar phonetic coverage. This dissertation introduces new features based on vocal source characteristics intended to capture physiological information related to the laryngeal excitation energy of a speaker. These features, including RPCC, GLFCC and TPCC, represent the unique characteristics of speech production not represented in current state-of-the-art speaker identification systems. The proposed features are evaluated through three experimental paradigms including cross-lingual speaker identification, cross song-type avian speaker identification and mono-lingual speaker identification. The experimental results show that the proposed features provide information about speaker characteristics that is significantly different in nature from the phonetically-focused information present in traditional spectral features. The incorporation of the proposed glottal source features offers significant overall improvement to the robustness and accuracy of speaker identification tasks

Employing Emotion Cues to Verify Speakers in Emotional Talking Environments

Usually, people talk neutrally in environments where there are no abnormal talking conditions such as stress and emotion. Other emotional conditions that might affect people talking tone like happiness, anger, and sadness. Such emotions are directly affected by the patient health status. In neutral talking environments, speakers can be easily verified, however, in emotional talking environments, speakers cannot be easily verified as in neutral talking ones. Consequently, speaker verification systems do not perform well in emotional talking environments as they do in neutral talking environments. In this work, a two-stage approach has been employed and evaluated to improve speaker verification performance in emotional talking environments. This approach employs speaker emotion cues (text-independent and emotion-dependent speaker verification problem) based on both Hidden Markov Models (HMMs) and Suprasegmental Hidden Markov Models (SPHMMs) as classifiers. The approach is comprised of two cascaded stages that combines and integrates emotion recognizer and speaker recognizer into one recognizer. The architecture has been tested on two different and separate emotional speech databases: our collected database and Emotional Prosody Speech and Transcripts database. The results of this work show that the proposed approach gives promising results with a significant improvement over previous studies and other approaches such as emotion-independent speaker verification approach and emotion-dependent speaker verification approach based completely on HMMs.Comment: Journal of Intelligent Systems, Special Issue on Intelligent Healthcare Systems, De Gruyter, 201

Study and simulation of low rate video coding schemes

The semiannual report is included. Topics covered include communication, information science, data compression, remote sensing, color mapped images, robust coding scheme for packet video, recursively indexed differential pulse code modulation, image compression technique for use on token ring networks, and joint source/channel coder design

Ultra-Reliable Short-Packet Communications: Fundamental Limits and Enabling Technologies

The paradigm shift from 4G to 5G communications, anticipated to enable ultra-reliable low-latency communications (URLLC), will enforce a radical change in the design of wireless communication systems. Unlike in 4G systems, where the main objective is to provide a large transmission rate, in URLLC, as implied by its name, the objective is to enable transmissions with low latency and, simultaneously, very high reliability. Since low latency implies the use of short data packets, the tension between blocklength and reliability is studied in URLLC.Several key enablers for URLLC communications have been designated in the literature. Of special importance are diversity-enabling technologies such as multiantenna systems and feedback protocols. Furthermore, it is not only important to introduce additional diversity by means of the above examples, one must also guarantee that thescarce number of channel uses are used in an optimal way. Therefore, it is imperative to develop design guidelines for how to enable reliable detection of incoming data, how to acquire channel-state information, and how to construct efficient short-packet channel codes. The development of such guidelines is at the heart of this thesis. This thesis focuses on the fundamental performance of URLLC-enabling technologies. Specifically, we provide converse (upper) bounds and achievability (lower) bounds on the maximum coding rate, based on finite-blocklength information theory, for systems that employ the key enablers outlined above. With focus on the wireless channel, modeled via a block-fading assumption, we are able to provide answers to questions like: howto optimally utilize spatial and frequency diversity, how far from optimal short-packet channel codes perform, how multiantenna systems should be designed to serve a given number of users, and how to design feedback schemes when the feedback link is noisy. In particular, this thesis is comprised out of four papers. In Paper A, we study the short-packet performance over the Rician block-fading channel. In particular, we present achievability bounds for pilot-assisted transmission with several different decoders that allow us to quantify the impact, on the achievable performance, of imposed pilots and mismatched decoding. Furthermore, we design short-packet channel codes that perform within 1 dB of our achievability bounds. Paper B studies multiuser massive multiple-input multiple-output systems with short packets. We provide an achievability bound on the average error probability over quasistatic spatially correlated Rayleigh-fading channels. The bound applies to arbitrary multiuser settings, pilot-assisted transmission, and mismatched decoding. This makes it suitable to assess the performance in the uplink/downlink for arbitrary linear signal processing. We show that several lessons learned from infinite-blocklength analyses carry over to the finite-blocklength regime. Furthermore, for the multicell setting with randomly placed users, pilot contamination should be avoided at all cost and minimum mean-squared error signal processing should be used to comply with the stringent requirements of URLLC.In Paper C, we consider sporadic transmissions where the task of the receiver is to both detect and decode an incoming packet. Two novel achievability bounds, and a novel converse bound are presented for joint detection-decoding strategies. It is shown that errors associated with detection deteriorates performance significantly for very short packet sizes. Numerical results also indicate that separate detection-decoding strategies are strictly suboptimal over block-fading channels.Finally, in Paper D, variable-length codes with noisy stop-feedback are studied via a novel achievability bound on the average service time and the average error probability. We use the bound to shed light on the resource allocation problem between the forward and the feedback channel. For URLLC applications, it is shown that enough resources must be assigned to the feedback link such that a NACK-to-ACK error becomes rarer than the target error probability. Furthermore, we illustrate that the variable-length stop-feedback scheme outperforms state-of-the-art fixed-length no-feedback bounds even when the stop-feedback bit is noisy