Terminated and Tailbiting Spatially-Coupled Codes with Optimized Bit Mappings for Spectrally Efficient Fiber-Optical Systems

We study the design of spectrally efficient fiber-optical communication systems based on different spatially coupled (SC) forward error correction (FEC) schemes. In particular, we optimize the allocation of the coded bits from the FEC encoder to the modulation bits of the signal constellation. Two SC code classes are considered. The codes in the first class are protograph-based low-density parity-check (LDPC) codes which are decoded using iterative soft-decision decoding. The codes in the second class are generalized LDPC codes which are decoded using iterative hard-decision decoding. For both code classes, the bit allocation is optimized for the terminated and tailbiting SC cases based on a density evolution analysis. An optimized bit allocation can significantly improve the performance of tailbiting SC codes codes over the baseline sequential allocation, up to the point where they have a comparable gap to capacity as their terminated counterparts, at a lower FEC overhead. For the considered terminated SC codes, the optimization only results in marginal performance improvements, suggesting that in this case a sequential allocation is close to optimal.Comment: This paper has been accepted for publication in the IEEE/OSA Journal of Lightwave Technolog

Inter-layer turbo coded unequal error protection for multi-layer video transmission

In layered video streaming, the enhancement layers (ELs) must be discarded by the video decoder, when the base layer (BL) is corrupted or lost due to channel impairments. This implies that the transmit power assigned to the ELs is wasted, when the BL is corrupted. To combat this effect, in this treatise we investigate the inter-layer turbo (IL-turbo) code, where the systematic bits of the BL are implanted into the systematic bits of the ELs at the transmitter. At the receiver, when the BL cannot be successfully decoded, the information of the ELs may be utilized by the IL-turbo decoder for the sake of assisting in decoding the BL. Moreover, for providing further insights into the IL technique the benefits of the IL-turbo scheme are analyzed using extrinsic information transfer (EXIT) charts in the scenario of unequal error protection (UEP) coded layered video transmission. Finally, our data partitioning based experiments show that the proposed scheme outperforms the traditional turbo code based UEP scheme by about an Eb/N0 of 1.1 dB at a peak signal-to-noise ratio (PSNR) of 36 dB or 3 dB of PSNR at an Eb/N0 of -5.5 dB at the cost of a complexity increase of 13%

Windowed Decoding of Protograph-based LDPC Convolutional Codes over Erasure Channels

We consider a windowed decoding scheme for LDPC convolutional codes that is based on the belief-propagation (BP) algorithm. We discuss the advantages of this decoding scheme and identify certain characteristics of LDPC convolutional code ensembles that exhibit good performance with the windowed decoder. We will consider the performance of these ensembles and codes over erasure channels with and without memory. We show that the structure of LDPC convolutional code ensembles is suitable to obtain performance close to the theoretical limits over the memoryless erasure channel, both for the BP decoder and windowed decoding. However, the same structure imposes limitations on the performance over erasure channels with memory.Comment: 18 pages, 9 figures, accepted for publication in the IEEE Transactions on Information Theor

Turbo Decoding and Detection for Wireless Applications

A historical perspective of turbo coding and turbo transceivers inspired by the generic turbo principles is provided, as it evolved from Shannon’s visionary predictions. More specifically, we commence by discussing the turbo principles, which have been shown to be capable of performing close to Shannon’s capacity limit. We continue by reviewing the classic maximum a posteriori probability decoder. These discussions are followed by studying the effect of a range of system parameters in a systematic fashion, in order to gauge their performance ramifications. In the second part of this treatise, we focus our attention on the family of iterative receivers designed for wireless communication systems, which were partly inspired by the invention of turbo codes. More specifically, the family of iteratively detected joint coding and modulation schemes, turbo equalization, concatenated spacetime and channel coding arrangements, as well as multi-user detection and three-stage multimedia systems are highlighted

Design Of Fountain Codes With Error Control

This thesis is focused on providing unequal error protection (uep) to two disjoint sources which are communicating to a comdestination via a comrelay by using distributed lt codes over a binary erasure channel (bec), and designing fountain codes with error control property by integrating lt codes with turbo codes over a binary input additive white gaussian noise (bi-awgn) channel. A simple yet efficient technique for decomposing the rsd into two entirely different degree distributions is developed and presented in this thesis. These two distributions are used to encode data symbols at the sources and the encoded symbols from the sources are selectively xored at the relay based on a suitable relay operation before the combined codeword is transmitted to the destination. By doing so, it is shown that the uep can be provided to these sources. The performance of lt codes over the awgn channel is well studied and presented in this thesis which indicates that these codes have weak error correction ability over the channel. But, errors introduced into individual symbols during the transmission of information over noisy channels need correction by some error correcting codes. Since it is found that lt codes alone are weak at correcting those errors, lt codes are integrated with turbo codes which are good error correcting codes. Therefore, the source data (symbols) are at first turbo encoded and then lt encoded and transmitted over the awgn channel. When the corrupted encoded symbols are received at receiver, lt decoding is conducted folloby turbo decoding. The overall performance of the integrated system is studied and presented in this thesis, which suggests that the errors left after lt decoding can be corrected to some extent by turbo decoder

Continuous Transmission of Spatially Coupled LDPC Code Chains

We propose a novel encoding/transmission scheme called continuous chain (CC) transmission that is able to improve the finite-length performance of a system using spatially coupled low-density parity-check (SC-LDPC) codes. In CC transmission, instead of transmitting a sequence of independent code words from a terminated SC-LDPC code chain, we connect multiple chains in a layered format, where encoding, transmission, and decoding are performed in a continuous fashion. The connections between chains are created at specific points, chosen to improve the finite-length performance of the code structure under iterative decoding. We describe the design of CC schemes for different SC-LDPC code ensembles constructed from protographs: a (J,K) -regular SC-LDPC code chain, a spatially coupled repeat-accumulate (SC-RA) code, and a spatially coupled accumulate-repeat-jagged-accumulate (SC-ARJA) code. In all cases, significant performance improvements are reported and it is shown that using CC transmission only requires a small increase in decoding complexity and decoding delay with respect to a system employing a single SC-LDPC code chain for transmission.This material is based upon work supported in part by the National Science Foundation under Grant Nos. CCF-1161754 and CCSS-1710920, in part by NSERC Canada, and in part by the Spanish Ministry of Economy and Competitiveness and the Spanish National Research Agency under grants TEC2016-78434-C3-3-R (AEI/FEDER, EU) and Juan de la Cierva Fellowship IJCI-2014-19150

Techniques for unequal error protection.

Ho Man-Shing.Thesis (M.Phil.)--Chinese University of Hong Kong, 2001.Includes bibliographical references (leaves 65-66).Abstracts in English and Chinese.Acknowledgement --- p.iAbstract --- p.iiList of Abbreviation --- p.iiiChapter 1. --- Introduction --- p.1Chapter 1.1 --- Digital Communication System --- p.3Chapter 1.2 --- Thesis Organization --- p.4Chapter 2. --- Error-Correcting Codes --- p.6Chapter 2.1 --- Convolutional Codes --- p.7Chapter 2.1.1 --- Generator Polynomials --- p.8Chapter 2.1.2 --- Generator Matrix --- p.9Chapter 2.1.3 --- Circuit Diagram --- p.10Chapter 2.1.4 --- State-transition Diagram --- p.11Chapter 2.1.4 --- Trellis Diagram --- p.12Chapter 2.1.5 --- Distance property --- p.13Chapter 2.2 --- Rate-Compatible Punctured Convolutional Codes --- p.14Chapter 2.3 --- Trellis-Coded Modulation --- p.17Chapter 2.3.1 --- General Model of TCM --- p.18Chapter 2.3.2 --- Trellis Representation --- p.20Chapter 2.3.3 --- Set Partitioning --- p.21Chapter 2.3.4 --- Code Modulation --- p.23Chapter 2.4 --- Decoding Algorithm --- p.25Chapter 2.4.1 --- Viterbi Algorithm --- p.27Chapter 2.4.2 --- List Viterbi Algorithm --- p.30Chapter 3. --- Unequal-Error-Protection for Embedded Image Coder --- p.33Chapter 3.1 --- SPIHT Coder --- p.35Chapter 3.1.1 --- Progressive Image Transmission --- p.36Chapter 3.1.2 --- Set Partitioning Sorting Algorithm --- p.37Chapter 3.1.3 --- Spatial Orientation Trees --- p.38Chapter 3.2 --- System Description --- p.39Chapter 3.3 --- Code Allocation --- p.41Chapter 3.4 --- System Complexity --- p.42Chapter 3.5 --- Simulation Result --- p.43Chapter 4. --- Unequal-Error-Protection Provided by Trellis-Coded Modulation --- p.51Chapter 4.1 --- System Description --- p.52Chapter 4.2 --- Unequal Constellation --- p.53Chapter 4.3 --- Free Distance --- p.55Chapter 4.4 --- Simulation Results --- p.59Chapter 5. --- Conclusion --- p.63Bibliography --- p.6