338 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

    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

    Near-capacity iterative decoding of binary self-concatenated codes using soft decision demapping and 3-D EXIT charts

    No full text
    In this paper 3-D Extrinsic Information Transfer (EXIT) charts are used to design binary Self-Concatenated Convolutional Codes employing Iterative Decoding (SECCC-ID), exchanging extrinsic information with the soft-decision demapper to approach the channel capacity. Recursive Systematic Convolutional (RSC) codes are selected as constituent codes, an interleaver is used for randomising the extrinsic information exchange of the constituent codes, while a puncturer helps to increase the achievable bandwidth efficiency. The convergence behaviour of the decoder is analysed with the aid of bit-based 3-D EXIT charts, for accurately calculating the operating EbN0 threshold, especially when SP based soft demapper is employed. Finally, we propose an attractive system configuration, which is capable of operating within about 1 dB from the channel capacity

    Three-Dimensional EXIT Chart Analysis of Iterative Detection Aided Coded Modulation Schemes

    No full text
    The iterative convergence of iteratively detected coded modulation schemes having different block lengths, decoding complexity and an unequal error protection capability is studied, when communicating over AWGNchannels using 8PSK modulation. More specifically, the coded modulation schemes investigated include Multilevel Coding (MLC), Trellis Coded Modulation (TCM), Turbo Trellis Coded Modulation (TTCM), Bit-Interleaved Coded Modulation (BICM) as well as Bit-Interleaved Coded Modulation employing Iterative Decoding (BICM-ID). A novel three dimensional EXIT chart was introduced for studying the iterative convergence behaviour of the Multistage Decoding (MSD) scheme used in MLC

    On the Computation of EXIT Characteristics for Symbol-Based Iterative Decoding

    No full text
    In this paper we propose an efficient method for computing index-based extrinsic information transfer (EXIT) charts, which are useful for estimating the convergence properties of non-binary iterative decoding. A standard method is to apply <i>a priori</i> reliability information to the <i>a posteriori</i> probability (APP) constituent decoder and compute the resulting average extrinsic information at the decoder output via multidimensional histogram measurements. However, this technique is only reasonable for very small index lengths as the complexity of this approach grows exponentially with the index length. We show that by averaging over a function of the extrinsic APPs for a long block the extrinsic information can be estimated with very low complexity. In contrast to using histogram measurements this method allows to generate EXIT charts even for larger index alphabets. Examples for a non-binary serial concatenated code and for turbo trellis-coded modulation, resp., demonstrate the capabilities of the proposed approach

    An optimization method for designing high rate and high performance SCTCM systems with in-line interleavers

    Get PDF
    We present a method for designing high-rate, high-performance SCTCM systems with in-line interleavers. Using in-line EXIT charts and ML performance analysis, we develop criteria for choosing constituent codes and optimization methods for selecting the best ones. To illustrate our methods, we show that an optimized SCTCM system with an in-line interleaver for rate r = 5/6 and 64QAM has better performance than other turbo-like TCMs with the same parameters

    Turbo-Detected Unequal Protection MPEG-4 Wireless Video Telephony using Multi-Level Coding, Trellis Coded Modulation and Space-Time Trellis Coding

    No full text
    Most multimedia source signals are capable of tolerating lossy, rather than lossless delivery to the human eye, ear and other human sensors. The corresponding lossy and preferably low-delay multimedia source codecs however exhibit unequal error sensitivity, which is not the case for Shannon’s ideal entropy codec. This paper proposes a jointly optimised turbo transceiver design capable of providing unequal error protection for MPEG-4 coding aided wireless video telephony. The transceiver investigated consists of space-time trellis coding (STTC) invoked for the sake of mitigating the effects of fading, in addition to bandwidth efficient trellis coded modulation or bit-interleaved coded modulation, combined with a multi-level coding scheme employing either two different-rate non-systematic convolutional codes (NSCs) or two recursive systematic convolutional codes for yielding a twin-class unequal-protection. A single-class protection based benchmark scheme combining STTC and NSC is used for comparison with the unequal-protection scheme advocated. The video performance of the various schemes is evaluated when communicating over uncorrelated Rayleigh fading channels. It was found that the proposed scheme requires about 2.8 dBs lower transmit power than the benchmark scheme in the context of the MPEG-4 videophone transceiver at a similar decoding complexity

    EXIT charts for system design and analysis

    No full text
    Near-capacity performance may be achieved with the aid of iterative decoding, where extrinsic soft information is exchanged between the constituent decoders in order to improve the attainable system performance. Extrinsic information Transfer (EXIT) charts constitute a powerful semi-analytical tool used for analysing and designing iteratively decoded systems. In this tutorial, we commence by providing a rudimentary overview of the iterative decoding principle and the concept of soft information exchange. We then elaborate on the concept of EXIT charts using three iteratively decoded prototype systems as design examples. We conclude by illustrating further applications of EXIT charts, including near-capacity designs, the concept of irregular codes and the design of modulation schemes

    On the Convergence Speed of Turbo Demodulation with Turbo Decoding

    Full text link
    Iterative processing is widely adopted nowadays in modern wireless receivers for advanced channel codes like turbo and LDPC codes. Extension of this principle with an additional iterative feedback loop to the demapping function has proven to provide substantial error performance gain. However, the adoption of iterative demodulation with turbo decoding is constrained by the additional implied implementation complexity, heavily impacting latency and power consumption. In this paper, we analyze the convergence speed of these combined two iterative processes in order to determine the exact required number of iterations at each level. Extrinsic information transfer (EXIT) charts are used for a thorough analysis at different modulation orders and code rates. An original iteration scheduling is proposed reducing two demapping iterations with reasonable performance loss of less than 0.15 dB. Analyzing and normalizing the computational and memory access complexity, which directly impact latency and power consumption, demonstrates the considerable gains of the proposed scheduling and the promising contributions of the proposed analysis.Comment: Submitted to IEEE Transactions on Signal Processing on April 27, 201

    Near-capacity dirty-paper code design : a source-channel coding approach

    Get PDF
    This paper examines near-capacity dirty-paper code designs based on source-channel coding. We first point out that the performance loss in signal-to-noise ratio (SNR) in our code designs can be broken into the sum of the packing loss from channel coding and a modulo loss, which is a function of the granular loss from source coding and the target dirty-paper coding rate (or SNR). We then examine practical designs by combining trellis-coded quantization (TCQ) with both systematic and nonsystematic irregular repeat-accumulate (IRA) codes. Like previous approaches, we exploit the extrinsic information transfer (EXIT) chart technique for capacity-approaching IRA code design; but unlike previous approaches, we emphasize the role of strong source coding to achieve as much granular gain as possible using TCQ. Instead of systematic doping, we employ two relatively shifted TCQ codebooks, where the shift is optimized (via tuning the EXIT charts) to facilitate the IRA code design. Our designs synergistically combine TCQ with IRA codes so that they work together as well as they do individually. By bringing together TCQ (the best quantizer from the source coding community) and EXIT chart-based IRA code designs (the best from the channel coding community), we are able to approach the theoretical limit of dirty-paper coding. For example, at 0.25 bit per symbol (b/s), our best code design (with 2048-state TCQ) performs only 0.630 dB away from the Shannon capacity
    corecore