715 research outputs found

    Near-Capacity Turbo Trellis Coded Modulation Design

    No full text
    Bandwidth efficient parallel-concatenated Turbo Trellis Coded Modulation (TTCM) schemes were designed for communicating over uncorrelated Rayleigh fading channels. A symbol-based union bound was derived for analysing the error floor of the proposed TTCM schemes. A pair of In-phase (I) and Quadrature-phase (Q) interleavers were employed for interleaving the I and Q components of the TTCM coded symbols, in order to attain an increased diversity gain. The decoding convergence of the IQ-TTCM schemes was analysed using symbol based EXtrinsic Information Transfer (EXIT) charts. The best TTCM component codes were selected with the aid of both the symbol-based union bound and non-binary EXIT charts for the sake of designing capacity-approaching IQ-TTCM schemes in the context of 8PSK, 16QAM and 32QAM signal sets. It will be shown that our TTCM design is capable of approaching the channel capacity within 0.5 dB at a throughput of 4 bit/s/Hz, when communicating over uncorrelated Rayleigh fading channels using 32QAM

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

    Full text link
    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

    Self-concatenated code design and its application in power-efficient cooperative communications

    No full text
    In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions

    Design and Performance Analysis for LDPC Coded Modulation in Multiuser MIMO Systems

    Get PDF
    The channel capacity can be greatly increased by using multiple transmit and receive antennas, which is usually called multi-input multi-output (MIMO) systems. Iterative processing has achieved near-capacity on a single-antenna Gaussian or Rayleigh fading channel. How to use the iterative technique to exploit the capacity potential in single-user and/or multiuser MIMO systems is of great interest. We propose a low-density parity-check (LDPC) coded modulation scheme in multiuser MIMO systems. The receiver can be regarded as a serially concatenated iterative detection and decoding scheme, where the LDPC decoder performs the role of outer decoder and the multiuser demapper does that of the inner decoder. For the proposed scheme, appropriate selection of a bit-to-symbol mapping is crucial to achieve a good performance, so we investigate and find the best mapping under various cases.Analytical bound serves as a useful tool to assess system performance. The search for powerful codes has motivated the introduction of efficient bounding techniques tailored to some ensembles of codes. We then investigate combinatorial union bounding techniques for fast fading multiuser MIMO systems. The union upper bound on maximum likelihood (ML) decoding error probability provides a prediction for the system performance, with which the simulated system performance can be compared. Closed-form expression for the union bound is obtained, which can be evaluated efficiently by using a polynomial expansion. In addition, the constrained channel capacity and the threshold obtained from extrinsic information transfer (EXIT) chart can also serve as performance measures. Based on the analysis for fast fading case, we generalize the union upper bound to the block fading case

    Burst-by-Burst Adaptive Decision Feedback Equalised TCM, TTCM and BICM for H.263-Assisted Wireless Video Telephony

    No full text
    Decision Feedback Equaliser (DFE) aided wideband Burst-by-Burst (BbB) Adaptive Trellis Coded Modulation (TCM), Turbo Trellis Coded Modulation (TTCM) and Bit-Interleaved Coded Modulation (BICM) assisted H.263-based video transceivers are proposed and characterised in performance terms when communicating over the COST 207 Typical Urban wideband fading channel. Specifically, four different modulation modes, namely 4QAM, 8PSK, 16QAM and 64QAM are invoked and protected by the above-mentioned coded modulation schemes. The TTCM assisted scheme was found to provide the best video performance, although at the cost of the highest complexity. A range of lower-complexity arrangements will also be characterised. Finally, in order to confirm these findings in an important practical environment, we have also investigated the adaptive TTCM scheme in the CDMA-based Universal Mobile Telecommunications System's (UMTS) Terrestrial Radio Access (UTRA) scenario and the good performance of adaptive TTCM scheme recorded when communicating over the COST 207 channels was retained in the UTRA environment

    Labeling Diversity for 2x2 WLAN Coded-Cooperative Networks

    Get PDF
    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

    Bandwidth-efficient communication systems based on finite-length low density parity check codes

    Get PDF
    Low density parity check (LDPC) codes are linear block codes constructed by pseudo-random parity check matrices. These codes are powerful in terms of error performance and, especially, have low decoding complexity. While infinite-length LDPC codes approach the capacity of communication channels, finite-length LDPC codes also perform well, and simultaneously meet the delay requirement of many communication applications such as voice and backbone transmissions. Therefore, finite-length LDPC codes are attractive to employ in low-latency communication systems. This thesis mainly focuses on the bandwidth-efficient communication systems using finite-length LDPC codes. Such bandwidth-efficient systems are realized by mapping a group of LDPC coded bits to a symbol of a high-order signal constellation. Depending on the systems' infrastructure and knowledge of the channel state information (CSI), the signal constellations in different coded modulation systems can be two-dimensional multilevel/multiphase constellations or multi-dimensional space-time constellations. In the first part of the thesis, two basic bandwidth-efficient coded modulation systems, namely LDPC coded modulation and multilevel LDPC coded modulation, are investigated for both additive white Gaussian noise (AWGN) and frequency-flat Rayleigh fading channels. The bounds on the bit error rate (BER) performance are derived for these systems based on the maximum likelihood (ML) criterion. The derivation of these bounds relies on the union bounding and combinatoric techniques. In particular, for the LDPC coded modulation, the ML bound is computed from the Hamming distance spectrum of the LDPC code and the Euclidian distance profile of the two-dimensional constellation. For the multilevel LDPC coded modulation, the bound of each decoding stage is obtained for a generalized multilevel coded modulation, where more than one coded bit is considered for level. For both systems, the bounds are confirmed by the simulation results of ML decoding and/or the performance of the ordered-statistic decoding (OSD) and the sum-product decoding. It is demonstrated that these bounds can be efficiently used to evaluate the error performance and select appropriate parameters (such as the code rate, constellation and mapping) for the two communication systems.The second part of the thesis studies bandwidth-efficient LDPC coded systems that employ multiple transmit and multiple receive antennas, i.e., multiple-input multiple-output (MIMO) systems. Two scenarios of CSI availability considered are: (i) the CSI is unknown at both the transmitter and the receiver; (ii) the CSI is known at both the transmitter and the receiver. For the first scenario, LDPC coded unitary space-time modulation systems are most suitable and the ML performance bound is derived for these non-coherent systems. To derive the bound, the summation of chordal distances is obtained and used instead of the Euclidean distances. For the second case of CSI, adaptive LDPC coded MIMO modulation systems are studied, where three adaptive schemes with antenna beamforming and/or antenna selection are investigated and compared in terms of the bandwidth efficiency. For uncoded discrete-rate adaptive modulation, the computation of the bandwidth efficiency shows that the scheme with antenna selection at the transmitter and antenna combining at the receiver performs the best when the number of antennas is small. For adaptive LDPC coded MIMO modulation systems, an achievable threshold of the bandwidth efficiency is also computed from the ML bound of LDPC coded modulation derived in the first part

    Bit-interleaved coded modulation

    Get PDF
    The principle of coding in the signal space follows directly from Shannon’s analysis of waveform Gaussian channels subject to an input constraint. The early design of communication systems focused separately on modulation, and error correcting codes. Bit-interleaved coded modulation (BICM) is a pragmatic approach combining the best out of both worlds: it takes advantage of the signal-space coding perspective, whilst allowing for the use of powerful families of binary codes with virtually any modulation format. As matter of fact, has established itself as a quasi-standard (de-facto) for bandwidth - and power - efficient communication, like DSL, wireless LANs, WiMax. The aim of this thesis is to describe the main aspects of the system, focusing the attention on model characteristics and on the error analysis (based on bit-error rate approximations). Finally I also consider the BICM with iterative decoding and I conclude with an overview of some applications of BIC

    Performance of turbo coded DS-CDMA systems in correlated and uncorrelated satellite communication channels

    Get PDF
    Word processed copy.Includes bibliographical references (leaves 82-88).This thesis aims at presenting the perfonnance of turbo codes in the correlated and uncorrelated satellite fading channel. Turbo codes are known to give very good perfonnance results in A WGN channels, especially for very large input message length codes or interleaver sizes. It can be shown that good perfonnance of the turbo codes can be achieved with small interleaver sizes in a satellite channel

    Bit-Interleaved Coded Modulation

    Get PDF
    corecore