Space-Time Signal Design for Multilevel Polar Coding in Slow Fading Broadcast Channels

Slow fading broadcast channels can model a wide range of applications in wireless networks. Due to delay requirements and the unavailability of the channel state information at the transmitter (CSIT), these channels for many applications are non-ergodic. The appropriate measure for designing signals in non-ergodic channels is the outage probability. In this paper, we provide a method to optimize STBCs based on the outage probability at moderate SNRs. Multilevel polar coded-modulation is a new class of coded-modulation techniques that benefits from low complexity decoders and simple rate matching. In this paper, we derive the outage optimality condition for multistage decoding and propose a rule for determining component code rates. We also derive an upper bound on the outage probability of STBCs for designing the set-partitioning-based labelling. Finally, due to the optimality of the outage-minimized STBCs for long codes, we introduce a novel method for the joint optimization of short-to-moderate length polar codes and STBCs

A Constellation Space Dimensionality Reduced Sub-Optimal Receiver for Orthogonal STBC CPM Modulation in a MIMO Channel

We consider burst orthogonal space-time block coded (OSTBC) CPM modulation in a MIMO flat slow Rayleigh fading channel. The optimal receiver must process a multidimensional non-linear CPM signal on each antenna. This task imposes a high load on the receiver computational performance and increases its complexity. We analytically derive a suboptimal receiver with a reduced number of front end matched filters (MFs) corresponding to the CPM dimension. Our derivation is made fully in the constellation signal space, and the reduction is based on the linear orthogonal projection to the optimal subspace. Criterion optimality is a standard space-time rank and determinant criterion. The optimal arbitrary-dimensional subspace search leads to the eigenvector solution. We present the condition on a sufficient subspace dimension and interpret the meaning of the corresponding eigenvalues. It is shown that the determinant and rank criterion for OSTBC CPM is equivalent to the uncoded CPM Euclidean distance criterion. Hence the proposed receiver may be practical for uncoded CPM and foremost in a serially concatenated (SC) CPM system. All the derivations are supported by suitable error simulations for binary 2REC h= 1/2, but the procedure is generally valid for any CPM variant. We consider OSTBC CPM in a Rayleigh fading AWGN channel and SC CPM in an AWGN channel.

Generalized space-time shift keying designed for flexible diversity-, multiplexing- and complexity-tradeoffs

In this paper, motivated by the recent concept of Spatial Modulation (SM), we propose a novel Generalized Space-Time Shift Keying (G-STSK) architecture, which acts as a unified Multiple-Input Multiple-Output (MIMO) framework. More specifically, our G-STSK scheme is based on the rationale that P out of Q dispersion matrices are selected and linearly combined in conjunction with the classic PSK/QAM modulation, where activating P out of Q dispersion matrices provides an implicit means of conveying information bits in addition to the classic modem. Due to its substantial flexibility, our G-STSK framework includes diverse MIMO arrangements, such as SM, Space-Shift Keying (SSK), Linear Dispersion Codes (LDCs), Space-Time Block Codes (STBCs) and Bell Lab’s Layered Space-Time (BLAST) scheme. Hence it has the potential of subsuming all of them, when flexibly adapting a set of system parameters. Moreover, we also derive the Discrete-input Continuous-output Memoryless Channel (DCMC) capacity for our G-STSK scheme, which serves as the unified capacity limit, hence quantifying the capacity of the class of MIMO arrangements. Furthermore, EXtrinsic Information Transfer (EXIT) chart analysis is used for designing our G-STSK scheme and for characterizing its iterative decoding convergence

Space-Time Codes Concatenated with Turbo Codes over Fading Channels

The uses of space-time code (STC) and iterative processing have enabled robust communications over fading channels at previously unachievable signal-to-noise ratios. Maintaining desired transmission rate while improving the diversity from STC is challenging, and the performance of the STC suffers considerably due to lack of channel state information (CSI). This dissertation research addresses issues of considerable importance in the design of STC with emphasis on efficient concatenation of channel coding and STC with theoretical bound derivation of the proposed schemes, iterative space-time trellis coding (STTC), and differential space-time codes. First, we concatenate space-time block code (STBC) with turbo code for improving diversity gain as well as coding gain. Proper soft-information sharing is indispensable to the iterative decoding process. We derive the required soft outputs from STBC decoders for passing to outer turbo code. Traditionally, the performance of STBC schemes has been evaluated under perfect channel estimation. For fast time-varying channel, obtaining the CSI is tedious if not impossible. We introduce a scheme of calculating the CSI at the receiver from the received signal without the explicit channel estimation. The encoder of STTC, which is generally decoded using Viterbi like algorithm, is based on a trellis structure. This trellis structure provides an inherent advantage for the STTC scheme that an iterative decoding is feasible with the minimal addition computational complexity. An iteratively decoded space-time trellis coding (ISTTC) is proposed in this dissertation, where the STTC schemes are used as constituent codes of turbo code. Then, the performance upper bound of the proposed ISTTC is derived. Finally, for implementing STBC without channel estimation and maintaining trans- mission rate, we concatenate differential space-time block codes (DSTBC) with ISTTC. The serial concatenation of DSTBC or STBC with ISTTC offers improving performance, even without an outer channel code. These schemes reduce the system complexity com- pared to the standalone ISTTC and increase the transmission rate under the same SNR condition. Detailed design procedures of these proposed schemes are analyzed

Improved Spatial Modulation Techniques for Wireless Communications

Transmission and reception methods with multiple antennas have been demonstrated to be very useful in providing high data rates and improving reliability in wireless communications. In particular, spatial modulation (SM) has recently emerged as an attractive transmission method for multiple-antennas systems due to its better energy efficiency and lower system complexity. This thesis is concerned with developing transmission techniques to improve the spectral efficiency of SM where antenna/subcarrier index involves in conveying information bits. In the first part of the thesis, new transmission techniques are developed for SM over frequency-flat fading channels. The first proposed scheme is based on a high-rate space-time block code instead of using the classical Alamouti STBC, which helps to increase the spectral efficiency and achieve a transmit diversity order of two. A simplified maximum likelihood detection is also developed for this proposed scheme. Analysis of coding gains and simulation results demonstrate that the proposed scheme outperforms previously-proposed SM schemes at high data transmission rates. Then, a new space-shift keying (SSK) modulation scheme is proposed which requires a smaller number of transmit antennas than that required in the bi-space shift keying (BiSSK). Such a proposed SSK-based scheme is obtained by multiplexing two in-phase and quadrature generalized SSK streams and optimizing the carrier signals transmitted by the activated antennas. Performance of the proposed scheme is compared with other SSK-based schemes via minimum Euclidean distance analysis and computer simulation. The third scheme proposed in this part is an improved version of quadrature SM (QSM). The main feature of this proposed scheme is to send a second constellation symbol over the in-phase and quadrature antenna dimensions. A significant performance advantage of the proposed scheme is realized at the cost of a slight increase in the number of radio-frequency (RF) chains. Performance comparisons with the most recent SM schemes confirm the advantage of the proposed scheme. The last contribution of the first part is an optimal constellation design for QSM to minimize the average probability of error. It is shown that, the error performance of QSM not only depends on the Euclidean distances between the amplitude phase modulation (APM) symbols and the energies of APM symbols, but also on the in-phase and quadrature components of the QSM symbols. The analysis of the union bound of the average error probability reveals that at a very large number of transmit antennas, the optimal constellations for QSM converge to a quadrature phase shift keying (QPSK) constellation. Simulation results demonstrate the performance superiority of the obtained constellations over other modulation schemes. In the second part of the thesis, the applications of SM in frequency-selective fading channels are studied. First, a new transmission scheme that employs SM for each group of subcarriers in orthogonal frequency-division multiplexing (OFDM) transmission is investigated. Specifically, OFDM symbols in each group are passed through a precoder to maximize the diversity and coding gains, while SM is applied in each group to convey more information bits by antenna indices. Performance analysis and simulation results are carried out to demonstrate the superiority of the proposed scheme over a previously-proposed combination of SM and OFDM. Next, the performance of OFDM based on index modulation and a flexible version of OFDM, knows as OFDM with multiple constellations, is compared for both case of "no precoding'' and "with precoding'' of data symbols. It is shown that the precoded OFDM with multiple constellations outperforms precoded-IM based OFDM systems over frequency-selective fading channels. The last part of the thesis investigates a multiuser downlink transmission system based on in-phase and quadrature space-shift keying modulation and precoding to reduce the minimum number of transmit antennas while keeping the complexity of the receiver low. In addition to the maximum likelihood (ML) detection, the low complexity zero forcing (ZF) receiver is also studied. Theoretical upper bounds for the error probabilities of both ML and ZF receivers are obtained and corroborated with simulation results

Digital signal processing techniques for peak-to-average power ratio mitigation in MIMO–OFDM systems

The focus of this thesis is to mitigate the very large peak-to-average transmit power ratios (PAPRs) inherent to conventional orthogonal frequency division multiplexing (OFDM) systems, particularly in the context of transmission over multi-input multi-output (MIMO) wireless broadband channels. This problem is important as a large PAPR generally needs an expensive radio frequency (RF) power amplifier at the transmitter due to the requirement for linear operation over a wide amplitude range and such a cost would be compounded when multiple transmit antennas are used. Advanced signal processing techniques which can reduce PAPR whilst retain the integrity of digital transmission therefore have considerable potential for application in emergent MIMO–OFDM wireless systems and form the technical contributions of this study. [Continues.

Design and analysis of space-time block and trellis coding schemes for single-band UWB communications systems

Ultra Wide-Band (UWB) technology has recently attracted much research interest due to its appealing features in short-range mobile communications. These features include high-data rates, low power consumption, multiple-access communications and precise positioning capabilities. Space-Time Coding (STC) techniques, such as block coding and trellis coding, are known to be simple and practical ways to increase both the spectral efficiency and the capacity in wireless communications. The the- sis aims at designing robust and efficient space-time coding schemes well adapted to single-band UWB signalling. Thus, this work incorporates a fine analysis of a stan- dard Single Input Single Output (SISO) single-band UWB system, scrutinising every important aspect of this system including transceiver structure, channel modelling, multiple-access techniques and detection process. Research also leads to the deriva- tion of a novel closed-form approximation for the average probability of bit-error for single-band UWB systems. This in-depth study highlights drawbacks inherent to UWB systems such as time-jitter effects or rake-receiver complexity and proposes schemes that benefit from spatial diversity to mitigate these problems. Thus, the thesis concentrates on the design of new multiple-antenna space-time coding systems tailored for UWB communications. As a result, this work derives and generates gen- eralised full-rate space-time block codes based on orthogonal pulses to capture both spatial and multipath diversities. Space-time trellis coded modulation is then revis- ited to further improve the spectral efficiency limit and to deliver the high-data rates promised by UWB technology. A new version of space-time trellis coding is developed for the peculiar UWB signalling structure. Finally, thanks to a novel closed-form ap- proximation, a theoretical comparison is undertaken between any SISO-UWB system and the multiple antenna UWB systems proposed in this thesis. The results clearly underline the impact of STC on a single-band UWB system in terms of enhanced robustness against timing-jitter effects, higher spectral efficiency and capacity im- provement. These advantages are finally confirmed through the numerical evaluation of the error-rate performance.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Distributed Turbo Product Coding Techniques Over Cooperative Communication Systems

In this dissertation, we propose a coded cooperative communications framework based on Distributed Turbo Product Code (DTPC). The system uses linear block Extended Bose-Chaudhuri-Hochquenghem (EBCH) codes as component codes. The source broadcasts the EBCH coded frames to the destination and nearby relays. Each relay constructs a product code by arranging the corrected bit sequences in rows and re-encoding them vertically using EBCH as component codes to obtain an Incremental Redundancy (IR) for source\u27s data. Under this frame, we have investigated a number of interesting and important issues. First, to obtain, independent vertical parities from each relay in the same code space, we propose circular interleaving of the decoded EBCH rows before reencoding vertically. We propose and derive a novel soft information relay for the DTPC over cooperative network based on EBCH component codes. The relay generates Log-Likelihood Ratio (LLR) values for the decoded rows are used to construct a product code by re-encoding the matrix along the columns using a novel soft block encoding technique to obtain soft parity bits with different reliabilities that can be used as soft IR for source\u27s data which is forwarded to the destination. To minimize the overall decoding errors, we propose a power allocation method for the distributed encoded system when the channel attenuations for the direct and relay channels are known. We compare the performance of our proposed power allocation method with the fixed power assignments for DTPC system. We also develop a power optimization algorithm to check the validity of our proposed power allocation algorithm. Results for the power allocation and the power optimization prove on the potency of our proposed power allocation criterion and show the maximum possible attainable performance from the DTPC cooperative system. Finally, we propose new joint distributed Space-Time Block Code (STBC)-DTPC by generating the vertical parity on the relay and transmitting it to the destination using STBC on the source and relay. We tested our proposed system in a fast fading environment on the three channels connecting the three nodes in the cooperative network