Capacity -based parameter optimization of bandwidth constrained CPM

Continuous phase modulation (CPM) is an attractive modulation choice for bandwidth limited systems due to its small side lobes, fast spectral decay and the ability to be noncoherently detected. Furthermore, the constant envelope property of CPM permits highly power efficient amplification. The design of bit-interleaved coded continuous phase modulation is characterized by the code rate, modulation order, modulation index, and pulse shape. This dissertation outlines a methodology for determining the optimal values of these parameters under bandwidth and receiver complexity constraints. The cost function used to drive the optimization is the information-theoretic minimum ratio of energy-per-bit to noise-spectral density found by evaluating the constrained channel capacity. The capacity can be reliably estimated using Monte Carlo integration. A search for optimal parameters is conducted over a range of coded CPM parameters, bandwidth efficiencies, and channels. Results are presented for a system employing a trellis-based coherent detector. To constrain complexity and allow any modulation index to be considered, a soft output differential phase detector has also been developed.;Building upon the capacity results, extrinsic information transfer (EXIT) charts are used to analyze a system that iterates between demodulation and decoding. Convergence thresholds are determined for the iterative system for different outer convolutional codes, alphabet sizes, modulation indices and constellation mappings. These are used to identify the code and modulation parameters with the best energy efficiency at different spectral efficiencies for the AWGN channel. Finally, bit error rate curves are presented to corroborate the capacity and EXIT chart designs

Irregular Variable Length Coding

In this thesis, we introduce Irregular Variable Length Coding (IrVLC) and investigate its applications, characteristics and performance in the context of digital multimedia broadcast telecommunications. During IrVLC encoding, the multimedia signal is represented using a sequence of concatenated binary codewords. These are selected from a codebook, comprising a number of codewords, which, in turn, comprise various numbers of bits. However, during IrVLC encoding, the multimedia signal is decomposed into particular fractions, each of which is represented using a different codebook. This is in contrast to regular Variable Length Coding (VLC), in which the entire multimedia signal is encoded using the same codebook. The application of IrVLCs to joint source and channel coding is investigated in the context of a video transmission scheme. Our novel video codec represents the video signal using tessellations of Variable-Dimension Vector Quantisation (VDVQ) tiles. These are selected from a codebook, comprising a number of tiles having various dimensions. The selected tessellation of VDVQ tiles is signalled using a corresponding sequence of concatenated codewords from a Variable Length Error Correction (VLEC) codebook. This VLEC codebook represents a specific joint source and channel coding case of VLCs, which facilitates both compression and error correction. However, during video encoding, only particular combinations of the VDVQ tiles will perfectly tessellate, owing to their various dimensions. As a result, only particular sub-sets of the VDVQ codebook and, hence, of the VLEC codebook may be employed to convey particular fractions of the video signal. Therefore, our novel video codec can be said to employ IrVLCs. The employment of IrVLCs to facilitate Unequal Error Protection (UEP) is also demonstrated. This may be applied when various fractions of the source signal have different error sensitivities, as is typical in audio, speech, image and video signals, for example. Here, different VLEC codebooks having appropriately selected error correction capabilities may be employed to encode the particular fractions of the source signal. This approach may be expected to yield a higher reconstruction quality than equal protection in cases where the various fractions of the source signal have different error sensitivities. Finally, this thesis investigates the application of IrVLCs to near-capacity operation using EXtrinsic Information Transfer (EXIT) chart analysis. Here, a number of component VLEC codebooks having different inverted EXIT functions are employed to encode particular fractions of the source symbol frame. We show that the composite inverted IrVLC EXIT function may be obtained as a weighted average of the inverted component VLC EXIT functions. Additionally, EXIT chart matching is employed to shape the inverted IrVLC EXIT function to match the EXIT function of a serially concatenated inner channel code, creating a narrow but still open EXIT chart tunnel. In this way, iterative decoding convergence to an infinitesimally low probability of error is facilitated at near-capacity channel SNRs

Serially Concatenated Continuous Phase Modulation with SOVA Turbo Decoding

For a Serially Concatenated Continuous Phase Modulation (SCCPM) system that concatenates a rate of 1/2 Convolutional Code (CC) and an M-ary full response continuous phase modulation (CPM) signal, we design a turbo decoding scheme using the Soft Output Viterbi algorithm (SOVA) and study the system performance. A decomposition model is used in CPM to reduce the number of states and separate the continuous phase encoder (CPE) with the modulator. As a soft-input soft-output (SISO) decoding algorithm, SOVA is used to generate and update the soft information of decoded signal symbols during the iterative process for both the CPM signal and the CC. Newly generated soft information from one component decoder will be used by the other component decoder to constitute an iterative, i.e., turbo, decoding process. Simulation results show that a decoding gain of at least 1 dB can be obtained by using turbo decoding compared to that without turbo decoding

OFDMA/SC-FDMA aided space-time shift keying for dispersive multi-user scenarios

Motivated by the recent concept of Space-Time Shift Keying (STSK) developed for achieving a flexible diversity versus multiplexing gain trade-off, we propose a novel Orthogonal Frequency Division Multiple Access (OFDMA)/Single Carrier Frequency Division Multiple Access (SC-FDMA) aided multi-user STSK scheme for frequency-selective channels. The proposed OFDMA/SC-FDMA STSK scheme is capable of providing an improved performance in dispersive channels, while supporting multiple users in a multiple antenna aided wireless system. Furthermore, the scheme has the inherent potential of benefitting from the low-complexity single-stream Maximum-likelihood (ML) detector. Both an uncoded and a sophisticated near-capacity coded OFDMA/SC-FDMA STSK scheme were studied and their performances were compared in multiuser wideband Multiple-Input Multiple-Output (MIMO) scenarios. Explicitly, OFDMA/SC-FDMA aided STSK exhibits an excellent performance even in the presence of channel impairments due to the frequency-selectivity of wideband channels and proves to be a beneficial choice for high capacity multi-user MIMO systems

Baseband Processing for 5G and Beyond: Algorithms, VLSI Architectures, and Co-design

In recent years the number of connected devices and the demand for high data-rates have been significantly increased. This enormous growth is more pronounced by the introduction of the Internet of things (IoT) in which several devices are interconnected to exchange data for various applications like smart homes and smart cities. Moreover, new applications such as eHealth, autonomous vehicles, and connected ambulances set new demands on the reliability, latency, and data-rate of wireless communication systems, pushing forward technology developments. Massive multiple-input multiple-output (MIMO) is a technology, which is employed in the 5G standard, offering the benefits to fulfill these requirements. In massive MIMO systems, base station (BS) is equipped with a very large number of antennas, serving several users equipments (UEs) simultaneously in the same time and frequency resource. The high spatial multiplexing in massive MIMO systems, improves the data rate, energy and spectral efficiencies as well as the link reliability of wireless communication systems. The link reliability can be further improved by employing channel coding technique. Spatially coupled serially concatenated codes (SC-SCCs) are promising channel coding schemes, which can meet the high-reliability demands of wireless communication systems beyond 5G (B5G). Given the close-to-capacity error correction performance and the potential to implement a high-throughput decoder, this class of code can be a good candidate for wireless systems B5G. In order to achieve the above-mentioned advantages, sophisticated algorithms are required, which impose challenges on the baseband signal processing. In case of massive MIMO systems, the processing is much more computationally intensive and the size of required memory to store channel data is increased significantly compared to conventional MIMO systems, which are due to the large size of the channel state information (CSI) matrix. In addition to the high computational complexity, meeting latency requirements is also crucial. Similarly, the decoding-performance gain of SC-SCCs also do come at the expense of increased implementation complexity. Moreover, selecting the proper choice of design parameters, decoding algorithm, and architecture will be challenging, since spatial coupling provides new degrees of freedom in code design, and therefore the design space becomes huge. The focus of this thesis is to perform co-optimization in different design levels to address the aforementioned challenges/requirements. To this end, we employ system-level characteristics to develop efficient algorithms and architectures for the following functional blocks of digital baseband processing. First, we present a fast Fourier transform (FFT), an inverse FFT (IFFT), and corresponding reordering scheme, which can significantly reduce the latency of orthogonal frequency-division multiplexing (OFDM) demodulation and modulation as well as the size of reordering memory. The corresponding VLSI architectures along with the application specific integrated circuit (ASIC) implementation results in a 28 nm CMOS technology are introduced. In case of a 2048-point FFT/IFFT, the proposed design leads to 42% reduction in the latency and size of reordering memory. Second, we propose a low-complexity massive MIMO detection scheme. The key idea is to exploit channel sparsity to reduce the size of CSI matrix and eventually perform linear detection followed by a non-linear post-processing in angular domain using the compressed CSI matrix. The VLSI architecture for a massive MIMO with 128 BS antennas and 16 UEs along with the synthesis results in a 28 nm technology are presented. As a result, the proposed scheme reduces the complexity and required memory by 35%–73% compared to traditional detectors while it has better detection performance. Finally, we perform a comprehensive design space exploration for the SC-SCCs to investigate the effect of different design parameters on decoding performance, latency, complexity, and hardware cost. Then, we develop different decoding algorithms for the SC-SCCs and discuss the associated decoding performance and complexity. Also, several high-level VLSI architectures along with the corresponding synthesis results in a 12 nm process are presented, and various design tradeoffs are provided for these decoding schemes

Joint Interleaver and Modulation Design For Multi-User SWIPT-NOMA

Radio frequency (RF) signals can be relied upon for conventional wireless information transfer (WIT) and for challenging wireless power transfer (WPT), which triggers the significant research interest in the topic of simultaneous wireless information and power transfer (SWIPT). By further exploiting the advanced non-orthogonal-multiple-access (NOMA) technique, we are capable of improving the spectrum efficiency of the resource-limited SWIPT system. In our SWIPT system, a hybrid access point (H-AP) superimposes the modulated symbols destined to multiple WIT users by exploiting the power-domain NOMA, while WPT users are capable of harvesting the energy carried by the superposition symbols. In order to maximize the amount of energy transferred to the WPT users, we propose a joint design of the energy interleaver and the constellation rotation-based modulator in the symbol-block level by constructively superimposing the symbols destined to the WIT users in the power domain. Furthermore, a transmit power allocation scheme is proposed to guarantee the symbol-error-ratio (SER) of all the WIT users. By considering the sensitivity of practical energy harvesters, simulation results demonstrate that our scheme is capable of substantially increasing the WPT performance without any remarkable degradation of the WIT performance

Super-orthogonal space-time turbo coded OFDM systems.

Thesis (Ph.D.)-University of KwaZulu-Natal, Durban, 2012.The ever increasing demand for fast and efficient broadband wireless communication services requires future broadband communication systems to provide a high data rate, robust performance and low complexity within the limited available electromagnetic spectrum. One of the identified, most-promising techniques to support high performance and high data rate communication for future wireless broadband services is the deployment of multi-input multi-output (MIMO) antenna systems with orthogonal frequency division multiplexing (OFDM). The combination of MIMO and OFDM techniques guarantees a much more reliable and robust transmission over a hostile wireless channel through coding over the space, time and frequency domains. In this thesis, two full-rate space-time coded OFDM systems are proposed. The first one, designed for two transmit antennas, is called extended super-orthogonal space-time trellis coded OFDM (ESOSTTC-OFDM), and is based on constellation rotation. The second one, called super-quasi-orthogonal space-time trellis coded OFDM (SQOSTTCOFDM), combines a quasi-orthogonal space-time block code with a trellis code to provide a full-rate code for four transmit antennas. The designed space-time coded MIMO-OFDM systems achieve a high diversity order with high coding gain by exploiting the diversity advantage of frequency-selective fading channels. Concatenated codes have been shown to be an effective technique of achieving reliable communication close to the Shannon limit, provided that there is sufficient available diversity. In a bid to improve the performance of the super orthogonal space-time trellis code (SOSTTC) in frequency selective fading channels, five distinct concatenated codes are proposed for MIMO-OFDM over frequency-selective fading channels in the second part of this thesis. Four of the coding schemes are based on the concatenation of convolutional coding, interleaving, and space-time coding, along multiple-transmitter diversity systems, while the fifth coding scheme is based on the concatenation of two space-time codes and interleaving. The proposed concatenated Super-Orthogonal Space-Time Turbo-Coded OFDM System I. B. Oluwafemi 2012 vii coding schemes in MIMO-OFDM systems achieve high diversity gain by exploiting available diversity resources of frequency-selective fading channels and achieve a high coding gain through concatenations by employing the turbo principle. Using computer software simulations, the performance of the concatenated SOSTTC-OFDM schemes is compared with those of concatenated space-time trellis codes and those of conventional SOSTTC-OFDM schemes in frequency-selective fading channels. Simulation results show that the concatenated SOSTTC-OFDM system outperformed the concatenated space-time trellis codes and the conventional SOSTTC-OFDM system under the various channel scenarios in terms of both diversity order and coding gain