242 research outputs found
Generalized Spatially-Coupled Parallel Concatenated Codes With Partial Repetition
A new class of spatially-coupled turbo-like codes (SC-TCs), dubbed generalized spatially coupled parallel concatenated codes (GSC-PCCs), is introduced. These codes are constructed by applying spatial coupling on parallel concatenated codes (PCCs) with a fraction of information bits repeated q times. GSC-PCCs can be seen as a generalization of the original spatially-coupled parallel concatenated codes proposed by Moloudi et al. [2]. To characterize the asymptotic performance of GSC-PCCs, we derive the corresponding density evolution equations and compute their decoding thresholds. The threshold saturation effect is observed and proven. Most importantly, we rigorously prove that the rate-R GSC-PCC ensemble with 2-state convolutional component codes achieves at least a fraction 1-R/R+q of the capacity of the binary erasure channel (BEC) for repetition factor q ≥ 2 and this multiplicative gap vanishes as q tends to infinity. To the best of our knowledge, this is the first class of SC-TCs that are proven to be capacity-achieving. Further, the connection between the strength of the component codes, the decoding thresholds of GSC-PCCs, and the repetition factor is established. The superiority of the proposed codes with finite blocklength is exemplified by comparing their error performance with that of existing SC-TCs via computer simulations
Analysis and Design of Partially Information- and Partially Parity-Coupled Turbo Codes
In this paper, we study a class of spatially coupled turbo codes, namely
partially information- and partially parity-coupled turbo codes. This class of
codes enjoy several advantages such as flexible code rate adjustment by varying
the coupling ratio and the encoding and decoding architectures of the
underlying component codes can remain unchanged. For this work, we first
provide the construction methods for partially coupled turbo codes with
coupling memory and study the corresponding graph models. We then derive
the density evolution equations for the corresponding ensembles on the binary
erasure channel to precisely compute their iterative decoding thresholds.
Rate-compatible designs and their decoding thresholds are also provided, where
the coupling and puncturing ratios are jointly optimized to achieve the largest
decoding threshold for a given target code rate. Our results show that for a
wide range of code rates, the proposed codes attain close-to-capacity
performance and the decoding performance improves with increasing the coupling
memory. In particular, the proposed partially parity-coupled turbo codes have
thresholds within 0.0002 of the BEC capacity for rates ranging from to
, yielding an attractive way for constructing rate-compatible
capacity-approaching channel codes.Comment: 15 pages, 13 figures. Accepted for publication in IEEE Transactions
on Communication
Physical Layer Performance Evaluation of LTE-Advanced Pro Broadcast and ATSC 3.0 Systems
This work provides a detailed performance analysis of the physical layer of two state-of-the-art point-to-multipoint (PTM) technologies: evolved Multimedia Broadcast Multicast Services (eMBMS) and Advanced Television Systems Committee - Third Generation (ATSC 3.0). The performance of these technologies is evaluated and compared using link-level simulations, considering relevant identified scenarios. A selection of Key Performance Indicators (KPI) for the International Mobile Telecommunications 2020 (IMT-2020) evaluation process has been considered. Representative use cases are also aligned to the test environments as defined in the IMT-2020 evaluation guidelines. It is observed that ATSC 3.0 outperforms both eMBMS solutions, i.e. MBMS over Single Frequency Networks (MBSFN) and Single-Cell PTM (SC-PTM) in terms of spectral efficiency, peak data rate and mobility, among others. This performance evaluation serves as a benchmark for comparison with a potential 5G PTM solution
Challenges and Some New Directions in Channel Coding
Three areas of ongoing research in channel coding are surveyed, and recent developments are presented in each area: spatially coupled Low-Density Parity-Check (LDPC) codes, nonbinary LDPC codes, and polar coding.This is the author accepted manuscript. The final version is available from IEEE via http://dx.doi.org/10.1109/JCN.2015.00006
Design and Analysis of Graph-based Codes Using Algebraic Lifts and Decoding Networks
Error-correcting codes seek to address the problem of transmitting information efficiently and reliably across noisy channels. Among the most competitive codes developed in the last 70 years are low-density parity-check (LDPC) codes, a class of codes whose structure may be represented by sparse bipartite graphs. In addition to having the potential to be capacity-approaching, LDPC codes offer the significant practical advantage of low-complexity graph-based decoding algorithms. Graphical substructures called trapping sets, absorbing sets, and stopping sets characterize failure of these algorithms at high signal-to-noise ratios. This dissertation focuses on code design for and analysis of iterative graph-based message-passing decoders. The main contributions of this work include the following: the unification of spatially-coupled LDPC (SC-LDPC) code constructions under a single algebraic graph lift framework and the analysis of SC-LDPC code construction techniques from the perspective of removing harmful trapping and absorbing sets; analysis of the stopping and absorbing set parameters of hypergraph codes and finite geometry LDPC (FG-LDPC) codes; the introduction of multidimensional decoding networks that encode the behavior of hard-decision message-passing decoders; and the presentation of a novel Iteration Search Algorithm, a list decoder designed to improve the performance of hard-decision decoders.
Adviser: Christine A. Kelle
- …