Frequency-Hopped Multiple-Access Communications With Noncoherent M-ary OFDM-ASK

A noncoherent, bandwidth-efficient modulation scheme is proposed for frequency-hopping multiple-access (FH-MA) networks. The proposed scheme is a combination of noncoherent M-ary amplitude-shift keying (NMASK) and orthogonal frequency-division multiplexing (OFDM). Using this scheme minimizes the required data bandwidth. The number of frequency slots available to the users increases significantly for a fixed spread-spectrum bandwidth (BWSS). The effect of the multiple-access interference is reduced. Simple and accurate bit error rate expressions have been derived for FH-OFDM-MASK in additive white Gaussian noise channels and for FH-OFDM-ASK in Rayleigh fading channels

Optimizing performance of multiple access multi-carrier multilevel frequency shift keying systems

Master'sMASTER OF ENGINEERIN

Time-Hopping Multicarrier Code-Division Multiple-Access

A time-hopping multicarrier code-division multiple-access (TH/MC-CDMA) scheme is proposed and investigated. In the proposed TH/MC-CDMA each information symbol is transmitted by a number of time-domain pulses with each time-domain pulse modulating a subcarrier. The transmitted information at the receiver is extracted from one of the, say $M$, possible time-slot positions, i.e., assuming that $M$-ary pulse position modulation is employed. Specifically, in this contribution we concentrate on the scenarios such as system design, power spectral density (PSD) and single-user based signal detection. The error performance of the TH/MC-CDMA system is investigated, when each subcarrier signal experiences flat Nakagami-$m$ fading in addition to additive white Gaussian noise (AWGN). According to our analysis and results, it can be shown that the TH/MC-CDMA signal is capable of providing a near ideal PSD, which is flat over the system bandwidth available, while decreases rapidly beyond that bandwidth. Explicitly, signals having this type of PSD is beneficial to both broadband and ultra-wide bandwidth (UWB) communications. Furthermore, our results show that, when optimum user address codes are employed, the single-user detector considered is near-far resistant, provided that the number of users supported by the system is lower than the number of subcarriers used for conveying an information symbol

Multicarrier Frequency Hopping Spread Spectrum Techniques With Quasi-Cyclic Low Density Parity Check Codes Channel Coding

This work presents a new proposed Multicarrier Frequency Hopping Spread Spectrum (MCFH-SS) system employing Quasi-Cyclic Low Density Parity Check (QC-LDPC) codes instead of the conventional LDPC codes. A new technique for constructing the QC-LDPC codes based on row division method is proposed. The new codes offer more flexibility in terms of high girth, multiple code rates and block length. Moreover, a new scheme for channel prediction in MCFH-SS system is proposed. The technique adaptively estimates the channel conditions and eliminates the need for the system to transmit a request message prior to transmitting the packet data. The ready-to-use channel will be occupied with a Pseudonoise (PN) code and use for transmission or else, it will be banned

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

Timing and Carrier Synchronization in Wireless Communication Systems: A Survey and Classification of Research in the Last 5 Years

Timing and carrier synchronization is a fundamental requirement for any wireless communication system to work properly. Timing synchronization is the process by which a receiver node determines the correct instants of time at which to sample the incoming signal. Carrier synchronization is the process by which a receiver adapts the frequency and phase of its local carrier oscillator with those of the received signal. In this paper, we survey the literature over the last 5 years (2010–2014) and present a comprehensive literature review and classification of the recent research progress in achieving timing and carrier synchronization in single-input single-output (SISO), multiple-input multiple-output (MIMO), cooperative relaying, and multiuser/multicell interference networks. Considering both single-carrier and multi-carrier communication systems, we survey and categorize the timing and carrier synchronization techniques proposed for the different communication systems focusing on the system model assumptions for synchronization, the synchronization challenges, and the state-of-the-art synchronization solutions and their limitations. Finally, we envision some future research directions