A Linear Subspace Approach to Burst Communication Signal Processing

This dissertation focuses on the topic of burst signal communications in a high interference environment. It derives new signal processing algorithms from a mathematical linear subspace approach instead of the common stationary or cyclostationary approach. The research developed new algorithms that have well-known optimality criteria associated with them. The investigation demonstrated a unique class of multisensor filters having a lower mean square error than all other known filters, a maximum likelihood time difference of arrival estimator that outperformed previously optimal estimators, and a signal presence detector having a selectivity unparalleled in burst interference environments. It was further shown that these improvements resulted in a greater ability to communicate, to locate electronic transmitters, and to mitigate the effects of a growing interference environment

Experimental detection using cyclostationary feature detectors for cognitive radios

© 2014 IEEE. Signal detection is widely used in many applications. Some examples include Cognitive Radio (CR) and military intelligence. Without guaranteed signal detection, a CR cannot reliably perform its role. Spectrum sensing is currently one of the most challenging problems in cognitive radio design because of various factors such as multi-path fading and signal to noise ratio (SNR). In this paper, we particularly focus on the detection method based on cyclostationary feature detectors (CFD) estimation. The advantage of CFD is its relative robustness against noise uncertainty compared with energy detection methods. The experimental result present in this paper show that the cyclostationary feature-based detection can be robust compared to energy-based technique for low SNR levels

A Cooperative Spectrum Sensing Network with Signal Classification Capabilities

This report describes the design and implementation of the spectrum sensing and signal classification sub-systems of a cooperative network. A sensor blindly receives and calculates the cyclic statistics of a signal decides whether or not the signal represents information or noise. If the signal\u27s statistics indicate the presence of data, the system attempts to classify its modulation scheme. Finally, the decisions of several independent sensors are combined to provide a reliable estimate of the contents of the spectrum of interest. Independently, sensors correctly classify a signal about 60-70% of the time in a low SNR environment. The data fusion module improves this number significantly - especially as the number of sensors increases

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

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

Automatic Modulation Classification Using Cyclic Features via Compressed Sensing

Cognitive Radios (CRs) are designed to operate with minimal interference to the Primary User (PU), the incumbent to a radio spectrum band. To ensure that the interference generated does not exceed a specific level, an estimate of the Signal to Interference plus Noise Ratio (SINR) for the PU’s channel is required. This can be accomplished through determining the modulation scheme in use, as it is directly correlated with the SINR. To this end, an Automatic Modulation Classification (AMC) scheme is developed via cyclic feature detection that is successful even with signal bandwidths that exceed the sampling rate of the CR. In order to accomplish this, Compressed Sensing (CS) is applied, allowing for reconstruction, even with very few samples. The use of CS in spectrum sensing and interpretation is becoming necessary for a growing number of scenarios where the radio spectrum band of interest cannot be fully measured, such as low cost sensor networks, or high bandwidth radio localization services. In order to be able to classify a wide range of modulation types, cumulants were chosen as the feature to use. They are robust to noise and provide adequate discrimination between different types of modulation, even those that are fairly similar, such as 16-QAM and 64-QAM. By fusing cumulants and CS, a novel method of classification was developed which inherited the noise resilience of cumulants, and the low sample requirements of CS. Comparisons are drawn between the proposed method and existing ones, both in terms of accuracy and resource usages. The proposed method is shown to perform similarly when many samples are gathered, and shows improvement over existing methods at lower sample counts. It also uses less resources, and is able to produce an estimate faster than the current systems

Wideband Spectrum Sensing for Dynamic Spectrum Sharing

The proliferation of wireless devices grows exponentially, demanding more and more data communication capacity over wireless links. Radio spectrum is a scarce resource, and traditional wireless networks deployed by Mobile Network Operators (MNO) are based on an exclusive spectrum band allocation. However, underutilization of some licensed bands in time and geographic domains has been reported, especially in rural areas or areas away from high population density zones. This coexistence of increasingly high data communication needs and spectrum underutilization is an incomprehensible scenario. A more rational and efficient use of the spectrum is the possibility of Licensed Users (known as Primary Users – PU) to lease the spectrum, when not in use, to Unlicensed Users (known as Secondary Users – SU), or allowing the SU to opportunistically use the spectrum after sensing and verifying that the PU is idle. In this latter case, the SU must stop transmitting when the PU becomes active. This thesis addresses the spectrum sensing task, which is essential to provide dynamic spectrum sharing between PUs and SUs. We show that the Spectral Correlation Function (SCF) and the Spectral Coherence Function (SCoF) can provide a robust signal detection algorithm by exploiting the cyclostationary characteristics of the data communication signal. We enhance the most used algorithm to compute de SCF - the FAM (FFT Accumulation Method) algorithm – to efficiently compute the SCF in a local/zoomed region of the support ( ; ) plane (frequency/cycle frequency plane). This will provide the quick identification of spectral bands in use by PUs or free, in a wideband sampling scenario. Further, the characterization of the probability density of the estimates of the SCF and SCoF when only noise is present, using the FAM algorithm, will allow the definition of an adaptive threshold to develop a blind (with respect to the noise statistics) Constant False Alarm Rate (CFAR) detector (using the SCoF) and also a CFAR and a Constant Detection Rate (CDR) detector when that characterization is used to obtain an estimate of the background noise variance (using the SCF).A proliferação de dispositivos sem fios cresce de forma exponencial, exigindo cada vez mais capacidade de comunicação de dados através de ligações sem fios. O espectro radioelétrico é um recurso escasso, e as redes sem fios tradicionais implantadas pelos Operadores de Redes Móveis baseiam-se numa atribuição exclusiva de bandas do espectro. No entanto, tem sido relatada a subutilização de algumas bandas licenciadas quer ao longo do tempo, quer na sua localização geográfica, especialmente em áreas rurais, e em áreas longe de zonas de elevada densidade populacional. A coexistência da necessidade cada vez maior de comunicação de dados, e a subutilização do espectro é um cenário incompreensível. Uma utilização mais racional e eficiente do espectro pressupõe a possibilidade dos Utilizadores Licenciados (conhecidos como Utilizadores Primários – Primary Users - PU) alugarem o espectro, quando este não está a ser utilizado, a Utilizadores Não Licenciados (conhecidos como Utilizadores Secundários – Secondary Users - SU), ou permitir ao SU utilizar oportunisticamente o espectro após a deteção e verificação de que o PU está inativo. Neste último caso, o SU deverá parar de transmitir quando o PU ficar ativo. Nesta tese é abordada a tarefa de deteção espectral, que é essencial para proporcionar a partilha dinâmica do espectro entre PUs e SUs. Mostra-se que a Função de Correlação Espectral (Spectral Correlation Function - SCF) e a Função de Coerência Espectral (Spectral Coherence Function - SCoF) permitem o desenvolvimento de um algoritmo robusto de deteção de sinal, explorando as características ciclo-estacionárias dos sinais de comunicação de dados. Propõe-se uma melhoria ao algoritmo mais utilizado para cálculo da SCF – o método FAM (FFT Accumulation Method) - para permitir o cálculo mais eficiente da SCF numa região local/ampliada do plano de suporte / (plano de frequência/frequência de ciclo). Esta melhoria permite a identificação rápida de bandas espectrais em uso por PUs ou livres, num cenário de amostragem de banda larga. Adicionalmente, é feita a caracterização da densidade de probabilidade das estimativas da SCF e SCoF quando apenas o ruído está presente, o que permite a definição de um limiar adaptativo, para desenvolver um detetor de Taxa de Falso Alarme Constante (Constant False Alarm Rate – CFAR) sem conhecimento do ruído de fundo (usando a SCoF) e também um detetor CFAR e Taxa de Deteção Constante (Constant Detection Rate – CDR), quando se utiliza aquela caracterização para obter uma estimativa da variância do ruído de fundo (usando a SCF)

Turbo equalization for multiple-input multiple-output (MIMO) wireless communication systems

This dissertation investigates both of the frequency domain and time domain turbo equalization with multiple-input multiple-output (MIMO) fading channels for radio frequency and underwater acoustic communications. First, a low complexity frequency domain turbo equalization (FDTE) is proposed for the MIMO systems with zero padding (ZP) or cyclic prefix (CP) inserted between the transmitted data blocks and its performance is tested on the real-world UWA communications experiments. Second, as high speed communication system requires efficient bandwidth usage and power consumption, CP or ZP is not transmitted as auxiliary information. An inter-block interference cancelation and CP reconstruction algorithm is developed to re-arrange the channel matrix into a block diagonal one. This improvement makes the FDTE effectively detects the continuous data stream from the high speed UWA communications and its performance has been verified by processing data collected from the UWA communications experiment. Finally, a low complexity soft interference cancelation (SIC) time domain turbo equalizer for MIMO systems with high level modulation is proposed. Compared with the conventional linear or nonlinear turbo equalizers, the proposed SIC turbo equalizer can theoretically reach the bound set up by the ideal match filter and its bit error rate (BER) performance from Monte Carlo simulation achieves a lower error floor as well as a more rapid convergence speed. --Abstract, page iv