Labeling Diversity for 2x2 WLAN Coded-Cooperative Networks

Labelling diversity is an efficient technique recently proposed in the literature and aims to improve the bit error rate(BER) performance of wireless local area network (WLAN) systems with two transmit and two receive antennas without increasing the transmit power and bandwidth requirements. In this paper, we employ labelling diversity with different space-time channel codes such as convolutional, turbo and low density parity check (LDPC) for both point-to-point and coded-cooperative communication scenarios. Joint iterative decoding schemes for distributed turbo and LDPC codes are also presented. BER performance bounds at an error floor (EF) region are derived and verified with the help of numerical simulations for both cooperative and non-cooperative schemes. Numerical simulations show that the coded-cooperative schemes with labelling diversity achieve better BER performances and use of labelling diversity at the source node significantly lowers relay outage probability and hence the overall BER performance of the coded-cooperative scheme is improved manifolds

On Optimal Turbo Decoding of Wideband MIMO-OFDM Systems Under Imperfect Channel State Information

We consider the decoding of bit interleaved coded modulation (BICM) applied to both multiband and MIMO OFDM systems for typical scenarios where only a noisy (possibly very bad) estimate of the channel is provided by sending a limited number of pilot symbols. First, by using a Bayesian framework involving the channel a posteriori density, we adopt a practical decoding metric that is robust to the presence of channel estimation errors. Then this metric is used in the demapping part of BICM multiband and MIMO OFDM receivers. We also compare our results with the performance of a mismatched decoder that replaces the channel by its estimate in the decoding metric. Numerical results over both realistic UWB and theoretical Rayleigh fading channels show that the proposed method provides significant gain in terms of bit error rate compared to the classical mismatched detector, without introducing any additional complexity

Media-Based MIMO: A New Frontier in Wireless Communications

The idea of Media-based Modulation (MBM), is based on embedding information in the variations of the transmission media (channel state). This is in contrast to legacy wireless systems where data is embedded in a Radio Frequency (RF) source prior to the transmit antenna. MBM offers several advantages vs. legacy systems, including "additivity of information over multiple receive antennas", and "inherent diversity over a static fading channel". MBM is particularly suitable for transmitting high data rates using a single transmit and multiple receive antennas (Single Input-Multiple Output Media-Based Modulation, or SIMO-MBM). However, complexity issues limit the amount of data that can be embedded in the channel state using a single transmit unit. To address this shortcoming, the current article introduces the idea of Layered Multiple Input-Multiple Output Media-Based Modulation (LMIMO-MBM). Relying on a layered structure, LMIMO-MBM can significantly reduce both hardware and algorithmic complexities, as well as the training overhead, vs. SIMO-MBM. Simulation results show excellent performance in terms of Symbol Error Rate (SER) vs. Signal-to-Noise Ratio (SNR). For example, a $4\times 16$ LMIMO-MBM is capable of transmitting $32$ bits of information per (complex) channel-use, with SER $\simeq 10^{-5}$ at $E_b/N_0\simeq -3.5$dB (or SER $\simeq 10^{-4}$ at $E_b/N_0=-4.5$dB). This performance is achieved using a single transmission and without adding any redundancy for Forward-Error-Correction (FEC). This means, in addition to its excellent SER vs. energy/rate performance, MBM relaxes the need for complex FEC structures, and thereby minimizes the transmission delay. Overall, LMIMO-MBM provides a promising alternative to MIMO and Massive MIMO for the realization of 5G wireless networks.Comment: 26 pages, 11 figures, additional examples are given to further explain the idea of Media-Based Modulation. Capacity figure adde

Cyclic division algebras: a tool for space-time coding

Multiple antennas at both the transmitter and receiver ends of a wireless digital transmission channel may increase both data rate and reliability. Reliable high rate transmission over such channels can only be achieved through Space–Time coding. Rank and determinant code design criteria have been proposed to enhance diversity and coding gain. The special case of full-diversity criterion requires that the difference of any two distinct codewords has full rank. Extensive work has been done on Space–Time coding, aiming at finding fully diverse codes with high rate. Division algebras have been proposed as a new tool for constructing Space–Time codes, since they are non-commutative algebras that naturally yield linear fully diverse codes. Their algebraic properties can thus be further exploited to improve the design of good codes. The aim of this work is to provide a tutorial introduction to the algebraic tools involved in the design of codes based on cyclic division algebras. The different design criteria involved will be illustrated, including the constellation shaping, the information lossless property, the non-vanishing determinant property, and the diversity multiplexing trade-off. The final target is to give the complete mathematical background underlying the construction of the Golden code and the other Perfect Space–Time block codes

Space-time coding techniques with bit-interleaved coded modulations for MIMO block-fading channels

The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving conditions, which enables a global optimization taking into account channel coding. Thanks to a diversity upperbound derived from the Singleton bound, an appropriate choice of the time dimension of the space-time coding is possible, which maximizes diversity while minimizing complexity. Based on the analysis, an optimized interleaver and a set of linear precoders, called dispersive nucleo algebraic (DNA) precoders are proposed. The proposed precoders have good performance with respect to the state of the art and exist for any number of transmit antennas and any time dimension. With turbo codes, they exhibit a frame error rate which does not increase with frame length.Comment: Submitted to IEEE Trans. on Information Theory, Submission: January 2006 - First review: June 200

Index modulation for next generation wireless communications.

Doctoral Degree. University of KwaZulu-Natal, Durban.A multicarrier index modulation technique in the form of quadrature spatial modulation (QSM) orthogonal frequency division multiplexing (QSM-OFDM) is proposed, in which transmit antenna indices are employed to transmit additional bits. Monte Carlo simulation results demonstrates a 5 dB gain in signal-to-noise ratio (SNR) over other OFDM schemes. Furthermore, an analysis of the receiver computational complexity is presented. A low-complexity near-ML detector for space-time block coded (STBC) spatial modulation (STBC-SM) with cyclic structure (STBC-CSM), which demonstrate near-ML error performance and yields significant reduction in computational complexity is proposed. In addition, the union-bound theoretical framework to quantify the average bit-error probability (ABEP) of STBC-CSM is formulated and validates the Monte Carlo simulation results. The application of media-based modulation (MBM), to STBC-SM and STBC-CSM employing radio frequency (RF) mirrors, in the form of MBSTBC-SM and MBSTBC-CSM is proposed to improve the error performance. Numerical results of the proposed schemes demonstrate significant improvement in error performance when compared with STBC-CSM and STBC-SM. In addition, the analytical framework of the union-bound on the ABEP of MBSTBC-SM and MBSTBC-CSM for the ML detector is formulated and agrees well with Monte Carlo simulations. Furthermore, a low-complexity near-ML detector for MBSTBC-SM and MBSTBC-CSM is proposed, and achieves a near-ML error performance. Monte Carlo simulation results demonstrate a trade-off between the error performance and the resolution of the detector that is employed. Finally, the application of MBM, an index modulated system to spatial modulation, in the form of spatial MBM (SMBM) is investigated. SMBM employs RF mirrors located around the transmit antenna units to create distinct channel paths to the receiver. This thesis presents an easy to evaluate theoretical bound for the error performance of SMBM, which is validated by Monte Carlo simulation results. Lastly, two low-complexity suboptimal mirror activation pattern (MAP) optimization techniques are proposed, which improve the error performance of SMBM significantly

Uncoded space-time labelling diversity : data rate & reliability enhancements and application to real-world satellite broadcasting.

Doctoral Degree. University of KwaZulu-Natal, Durban.Abstract available in PDF

Unified bit-based probabilistic data association aided MIMO detection for high-order QAM constellations

A unified Bit-based Probabilistic Data Association (B-PDA) detection approach is proposed for Multiple-Input Multiple-Output (MIMO) systems employing high-order rectangular Quadrature Amplitude Modulation (QAM). The new approach transforms the symbol detection process of QAM to a bit-based process by introducing a Unified Matrix Representation (UMR) of QAM. Both linear natural and nonlinear binary reflected Gray bit-to-symbol mappings are considered. With the aid of simulation results, we demonstrate that the linear natural mapping based B-PDA approach typically attained an improved detection performance (measured in terms of both Bit Error Ratio (BER) and Symbol Error Ratio (SER)) in comparison to the conventional symbol-based PDA aided MIMO detector, despite its dramatically reduced computational complexity. The only exception is that at low SNRs, the linear natural mapping based B-PDA is slightly inferior in terms of its BER to the conventional symbol-based PDA using binary reflected Gray mapping. Furthermore, the simulation results show that the linear natural mapping based B-PDA MIMO detector may approach the best-case performance provided by the nonlinear binary reflected Gray mapping based B-PDA MIMO detector under ideal conditions. Additionally, the implementation of the B-PDA MIMO detector is shown to be much simpler in the case of the linear natural mapping. Based on these two points, we conclude that in the context of the uncoded B-PDA MIMO detector it is preferable to use the linear natural bit-to-symbol mapping, rather than the nonlinear Gray mapping

Analysis of hybrid-ARQ based relaying protocols under modulation constraints

In a seminal paper published in 2001, Caire and Tuninetti derived an information theoretic bound on the throughput of hybrid-ARQ in the presence of block fading. However, the results placed no constraints on the modulation used, and therefore the input to the channel was Gaussian. The purpose of this thesis is to investigate the impact of modulation constraints on the throughput of hybrid-ARQ in a block fading environment. First, we consider the impact of modulation constraints on information outage probability for a block fading channel with a fixed length codeword. Then, we consider the effect of modulation constraints upon the throughput of hybrid-ARQ, where the rate of the codeword varies depending on the instantaneous channel conditions. These theoretical bounds are compared against the simulated performance of HSDPA, a newly standardized hybrid-ARQ protocol that uses QPSK and 16-QAM bit interleaved turbo-coded modulation. The results indicate how much of the difference between HSDPA and the previous unconstrained modulation bound is due to the use of the turbo-code and how much is due to the modulation constraints. (Abstract shortened by UMI.)