Generalized Spatially-Coupled Parallel Concatenated Codes With Partial Repetition

Min Qiu, Xiaowei Wu, Jinhong Yuan, Alexandre Graell i Amat

Introduction

In modern digital communications, approaching the Shannon capacity limit with low-complexity decoding remains a primary objective. While Turbo codes and Low-Density Parity-Check (LDPC) codes have long been the standard, the introduction of spatial coupling has provided a significant leap forward. Spatial coupling links multiple code blocks into a chain, enabling a phenomenon known as "threshold saturation," where the performance of a low-complexity Belief Propagation (BP) decoder approaches that of an optimal Maximum-A-Posteriori (MAP) decoder.

However, existing Spatially Coupled Parallel Concatenated Codes (SC-PCCs) face limitations. Specifically, when these codes are punctured to achieve higher data rates, their performance is strictly bounded away from the theoretical capacity. While variants like Partially Information Coupled Turbo Codes (PIC-TCs) showed empirical promise, they lacked a formal proof of threshold saturation. This research introduces Generalized Spatially Coupled Parallel Concatenated Codes (GSC-PCCs), a new class of codes designed to bridge this gap while maintaining compatibility with existing wireless standards.

Proposed Architecture

The GSC-PCC framework introduces two fundamental modifications to the standard spatially coupled architecture: partial information repetition and generalized spatial coupling.

As illustrated in the figure above, the encoding process begins by repeating a fraction ($\lambda$) of the information bits $q$ times. These repeated bits ($u_{t,r}$) and the original bits ($u_{t,o}$) are then distributed across different time slots and processed by upper and lower convolutional encoders. This structure creates a "memory" effect across the chain of code blocks, effectively coupling them in a way that enhances the overall error-correction capability.

Analytical Framework and Key Insights

To evaluate the performance of GSC-PCCs, the authors employed Density Evolution (DE), a mathematical framework that tracks the evolution of erasure probabilities during iterative decoding on a Binary Erasure Channel (BEC). A critical contribution of this work is the use of potential functions to formally prove threshold saturation. This proof provides the theoretical foundation for the high performance observed in simulations, confirming that GSC-PCCs can indeed achieve capacity-approaching performance with practical decoding algorithms.

Key insights from the analysis include:

  • The Criticality of $q$: The repetition factor $q$ is the primary driver of performance. As $q$ increases, the decoding threshold consistently improves.
  • Capacity-Approaching Universality: The analysis suggests that GSC-PCCs can approach Shannon capacity for any constituent convolutional code, regardless of its rate or trellis complexity.
  • Design Flexibility: By adjusting the repetition ratio ($\lambda$) and factor ($q$), designers can achieve target code rates with greater flexibility than previous SC-PCC implementations.

Performance Evaluation

Numerical results and simulations on the BEC demonstrate the superiority of GSC-PCCs over existing benchmarks. The codes not only outperform original SC-PCCs but also show significant gains over PIC-TCs, even with a small repetition factor such as $q=2$.

As shown in the performance curves, GSC-PCCs exhibit a sharp "waterfall" region that closely matches theoretical DE thresholds. For a rate-1/2 code, the MAP threshold can reach as high as 0.4999 when $q=50$ (using an 8-state component code). Given that the theoretical capacity for a rate-1/2 code is 0.5, the gap is reduced to a mere 0.0001.

Conclusion and Future Work

GSC-PCCs represent a significant advancement in the design of capacity-approaching turbo-like codes. By combining partial repetition with spatial coupling, the authors have created a flexible and theoretically sound framework that outperforms existing methods on the BEC. While this study focuses on the erasure channel, future research will investigate the performance of these codes in Additive White Gaussian Noise (AWGN) environments and address the hardware implementation challenges associated with increased computational complexity and latency.

Summary updated

Abstract

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 <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula> times. GSC-PCCs can be seen as a generalization of the original spatially-coupled parallel concatenated codes proposed by Moloudi <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> , 2017. 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- <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$R$ </tex-math></inline-formula> GSC-PCC ensemble with 2-state convolutional component codes achieves at least a fraction <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$1-\frac {R}{R+q}$ </tex-math></inline-formula> of the capacity of the binary erasure channel (BEC) for repetition factor <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$q\geq 2$ </tex-math></inline-formula> and this multiplicative gap vanishes as <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula> 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.
BibTeX
@article{qiu2022generalized,
  author = {Min Qiu and Xiaowei Wu and Jinhong Yuan and Alexandre Graell i Amat},
  title = {{Generalized Spatially-Coupled Parallel Concatenated Codes With Partial Repetition}},
  journal = {IEEE Trans. Communications},
  year = {2022},
  url = {https://openreview.net/forum?id=BD2Tlgp43Jw},
}
Figure