Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Black Sea Conference on Communications and Networking

Asymptotic and finite-length performance of irregular spatially-coupled codes

Reza A. Ashrafi, Abdullah Sarıduman, Alí Emre Pusane

Published May 1, 2014• 1 citation
Publisher

Abstract

The newest family of low-density parity-check (LDPC) codes, spatially-coupled (SC) codes, is shown to have several desirable characteristics including low implementation complexity and close-to-optimal performance over a range of channels. Furthermore, because of their ribbon-shaped parity-check matrices, window decoding can be used to decode these codes, which leads to low-delay implementations. Researchers have focused on asymptotically regular SC code ensembles and have examined several aspects of the code construction processes. In this paper, we concentrate on irregular SC code ensembles. We evaluate their decoding thresholds over the binary erasure channel and show that their performance is better than their regular SC counterparts. It is also shown that the gap between asymptotic coding thresholds of irregular SC ensembles and the fundamental Shannon limit gets negligibly small. For the sake of a better comparison, we have also evaluated the finite-length error performance of selected regular and irregular SC codes over the additive white Gaussian channel and it is also observed that finite-length error performance of these irregular SC codes outperforms regular SC codes. To further improve the error performance of these codes and to lower the possible error floors, progressive edge growth algorithm has also been considered in the finite-length performance analysis.

DOI
10.1109/blackseacom.2014.6849017

Related papers

Threshold analysis of non-binary spatially-coupled LDPC codes with windowed decoding

Lai Wei, Toshiaki Koike–Akino, David G. M. Mitchell +2 more

We study the iterative decoding threshold performance of non-binary spatially-coupled low-density parity-check (NB-SC-LDPC) code ensembles for both the binary erasure channel (BEC) and the binary-input additive white Gaussian noise channel (BIAWGNC), with particular emphasis on windowed decoding (WD). We consider both (2, 4)-regular and (3, 6)-regular NB-SC-LDPC code ensembles constructed using protographs and compute their thresholds using protograph versions of NB density evolution and NB extrinsic information transfer analysis. For these code ensembles, we show that WD of NB-SC-LDPC codes, which provides a significant decrease in latency and complexity compared to decoding across the entire parity-check matrix, results in a negligible decrease in the near-capacity performance for a sufficiently large window size W on both the BEC and the BIAWGNC. Also, we show that NBSC-LDPC code ensembles exhibit gains in the WD threshold compared to the corresponding block code ensembles decoded across the entire parity-check matrix, and that the gains increase as the finite field size q increases. Moreover, from the viewpoint of decoding complexity, we see that (3, 6)-regular NB-SC-LDPC codes are particularly attractive due to the fact that they achieve near-capacity thresholds even for small q and W.

arXiv:1403.3583•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•21 citations

Some results on spatially coupled protograph LDPC codes

Sudarsan V. S. Ranganathan, Kasra Vakilinia, Lara Dolecek +2 more

Spatially coupled low-density parity-check block codes (SC-LDPC-BCs) are a class of LDPC codes in which certain ensembles achieve capacity under iterative belief propagation decoding. Prior work has considered these codes mostly from a protograph perspective. Following this viewpoint, our work presents new protographs for the design of protograph-based SC-LDPC-BCs. A reciprocal channel approximation (RCA) analysis of the terminated protographs yields the asymptotic performance limits of the ensembles in terms of their iterative decoding thresholds. Our protographs possess the properties of linear minimum distance growth rate and excellent thresholds. We consider the following channels in our work: binary-input additive white Gaussian noise channel (BI-AWGNC), binary erasure channel (BEC), and binary symmetric channel (BSC). Our work focuses on obtaining good designs, with two classes of ensembles being asymptotically regular, for all the three channels while minimizing rate loss.

Information Theory and Applications Workshop (ITA)•Jan 1, 2016•3 citations

Finite-length performance of multi-edge protograph-based spatially coupled LDPC codes

Markus Stinner, Pablo M. Olmos

The finite-length performance of multi-edge spatially coupled low-density parity-check (SC-LDPC) codes over the binary erasure channel (BEC) is analyzed. Existing scaling laws are extended to arbitrary protograph base matrices that include puncturing patterns and multiple edges between nodes. A regular protograph-based SC-LDPC construction based on the (4; 8)-regular LDPC block code works well in the waterfall region compared to more involved rate-1/2 structures proposed to improve the threshold to minimum distance trade-off. Scaling laws are also used for code design and to estimate the block length of a given SC-LDPC code ensemble to match the performance of some other code. Estimates on the performance degradation are developed if the chain length varies.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2015•1 citation

Finite-length performance of spatially-coupled LDPC codes under TEP decoding

Pablo M. Olmos, Fernando Pérez‐Cruz, Luis Salamanca +1 more

Spatially-coupled (SC) LDPC codes are constructed from a set of L regular sparse codes of length M. In the asymptotic limit of these parameters, SC codes present an excellent decoding threshold under belief propagation (BP) decoding, close to the maximum a posteriori (MAP) threshold of the underlying regular code. In the finite-length regime, we need both dimensions, L and M, to be sufficiently large, yielding a very large code length and decoding latency. In this paper, and for the erasure channel, we show that the finite-length performance of SC codes is improved if we consider the tree-structured expectation propagation (TEP) algorithm in the decoding stage. When applied to the decoding of SC LDPC codes, it allows using shorter codes to achieve similar error rates. We also propose a window-sliding scheme for the TEP decoder to reduce the decoding latency.

IEEE Information Theory Workshop (ITW)•Sep 1, 2012•1 citation

A finite length performance analysis of LDPC codes constructed by connecting spatially coupled chains

Pablo M. Olmos, David G. M. Mitchell, Dmitri V. Truhachev +1 more

The finite length performance of codes on graphs constructed by connecting spatially coupled low-density parity-check (SC-LDPC) code chains is analyzed. Successive (peeling) decoding is considered for the binary erasure channel (BEC). The evolution of the undecoded portion of the bipartite graph remaining after each iteration is analyzed as a dynamical system. It is shown that, in addition to superior iterative decoding thresholds, connected chain ensembles have better performance than single chain ensembles of the same rate and length.

IEEE Information Theory Workshop (ITW)•Sep 1, 2013•9 citations

Asymptotic Analysis of Spatially Coupled MacKay-Neal and Hsu-Anastasopoulos LDPC Codes

Daniel J. Costello, Michael Lentmaier, Kenta Kasai +1 more

MacKay-Neal (MN) and Hsu-Anastasopoulos (HA) low-density parity-check (LDPC) codes are known to achieve the capacity of memoryless binary-input symmetric-output channels under maximum likelihood (ML) decoding with bounded col- umn and row weight in their associated parity-check matrices. Recently, Kasai and Sakaniwa showed that spatially coupled (SC) versions of the MN and HA LDPC codes have belief propagation (BP) iterative decoding thresholds that approach capacity on the binary erasure channel (BEC) as the coupling length increases. In this paper, we extend the results of Kasai and Sakaniwa to the additive white Gaussian noise (AWGN) channel and show that the thresholds of the SC-MN and SC-HA ensembles approach capacity with bounded density as the coupling length increases, i.e., the number of edges per information bit approaches a finite value as the estimated BP threshold approaches the Shannon limit. We also perform an asymptotic weight enumerator analysis and show that, provided the density parameters are chosen to be sufficiently large, the SC-MN and SC-HA ensembles are asymptotically good. Further, for certain selections of parameters, some of these ensembles are shown to have both excellent thresholds and good distance properties. (Less)

•Jan 1, 2012•5 citations
The newest family of low-density parity-check (LDPC) codes, spatially-coupled (SC) codes, is shown to have several desirable characteristics including low implementation complexity and close-to-optimal performance over a range of channels. Furthermore, because of their ribbon-shaped parity-check matrices, window decoding can be used to decode these codes, which leads to low-delay implementations. Researchers have focused on asymptotically regular SC code ensembles and have examined several aspects of the code construction processes. In this paper, we concentrate on irregular SC code ensembles. We evaluate their decoding thresholds over the binary erasure channel and show that their performance is better than their regular SC counterparts. It is also shown that the gap between asymptotic coding thresholds of irregular SC ensembles and the fundamental Shannon limit gets negligibly small. For the sake of a better comparison, we have also evaluated the finite-length error performance of selected regular and irregular SC codes over the additive white Gaussian channel and it is also observed that finite-length error performance of these irregular SC codes outperforms regular SC codes. To further improve the error performance of these codes and to lower the possible error floors, progressive edge growth algorithm has also been considered in the finite-length performance analysis.
We study the iterative decoding threshold performance of non-binary spatially-coupled low-density parity-check (NB-SC-LDPC) code ensembles for both the binary erasure channel (BEC) and the binary-input additive white Gaussian noise channel (BIAWGNC), with particular emphasis on windowed decoding (WD). We consider both (2, 4)-regular and (3, 6)-regular NB-SC-LDPC code ensembles constructed using protographs and compute their thresholds using protograph versions of NB density evolution and NB extrinsic information transfer analysis. For these code ensembles, we show that WD of NB-SC-LDPC codes, which provides a significant decrease in latency and complexity compared to decoding across the entire parity-check matrix, results in a negligible decrease in the near-capacity performance for a sufficiently large window size W on both the BEC and the BIAWGNC. Also, we show that NBSC-LDPC code ensembles exhibit gains in the WD threshold compared to the corresponding block code ensembles decoded across the entire parity-check matrix, and that the gains increase as the finite field size q increases. Moreover, from the viewpoint of decoding complexity, we see that (3, 6)-regular NB-SC-LDPC codes are particularly attractive due to the fact that they achieve near-capacity thresholds even for small q and W.
Spatially coupled low-density parity-check block codes (SC-LDPC-BCs) are a class of LDPC codes in which certain ensembles achieve capacity under iterative belief propagation decoding. Prior work has considered these codes mostly from a protograph perspective. Following this viewpoint, our work presents new protographs for the design of protograph-based SC-LDPC-BCs. A reciprocal channel approximation (RCA) analysis of the terminated protographs yields the asymptotic performance limits of the ensembles in terms of their iterative decoding thresholds. Our protographs possess the properties of linear minimum distance growth rate and excellent thresholds. We consider the following channels in our work: binary-input additive white Gaussian noise channel (BI-AWGNC), binary erasure channel (BEC), and binary symmetric channel (BSC). Our work focuses on obtaining good designs, with two classes of ensembles being asymptotically regular, for all the three channels while minimizing rate loss.
The finite-length performance of multi-edge spatially coupled low-density parity-check (SC-LDPC) codes over the binary erasure channel (BEC) is analyzed. Existing scaling laws are extended to arbitrary protograph base matrices that include puncturing patterns and multiple edges between nodes. A regular protograph-based SC-LDPC construction based on the (4; 8)-regular LDPC block code works well in the waterfall region compared to more involved rate-1/2 structures proposed to improve the threshold to minimum distance trade-off. Scaling laws are also used for code design and to estimate the block length of a given SC-LDPC code ensemble to match the performance of some other code. Estimates on the performance degradation are developed if the chain length varies.
Spatially-coupled (SC) LDPC codes are constructed from a set of L regular sparse codes of length M. In the asymptotic limit of these parameters, SC codes present an excellent decoding threshold under belief propagation (BP) decoding, close to the maximum a posteriori (MAP) threshold of the underlying regular code. In the finite-length regime, we need both dimensions, L and M, to be sufficiently large, yielding a very large code length and decoding latency. In this paper, and for the erasure channel, we show that the finite-length performance of SC codes is improved if we consider the tree-structured expectation propagation (TEP) algorithm in the decoding stage. When applied to the decoding of SC LDPC codes, it allows using shorter codes to achieve similar error rates. We also propose a window-sliding scheme for the TEP decoder to reduce the decoding latency.
The finite length performance of codes on graphs constructed by connecting spatially coupled low-density parity-check (SC-LDPC) code chains is analyzed. Successive (peeling) decoding is considered for the binary erasure channel (BEC). The evolution of the undecoded portion of the bipartite graph remaining after each iteration is analyzed as a dynamical system. It is shown that, in addition to superior iterative decoding thresholds, connected chain ensembles have better performance than single chain ensembles of the same rate and length.
MacKay-Neal (MN) and Hsu-Anastasopoulos (HA) low-density parity-check (LDPC) codes are known to achieve the capacity of memoryless binary-input symmetric-output channels under maximum likelihood (ML) decoding with bounded col- umn and row weight in their associated parity-check matrices. Recently, Kasai and Sakaniwa showed that spatially coupled (SC) versions of the MN and HA LDPC codes have belief propagation (BP) iterative decoding thresholds that approach capacity on the binary erasure channel (BEC) as the coupling length increases. In this paper, we extend the results of Kasai and Sakaniwa to the additive white Gaussian noise (AWGN) channel and show that the thresholds of the SC-MN and SC-HA ensembles approach capacity with bounded density as the coupling length increases, i.e., the number of edges per information bit approaches a finite value as the estimated BP threshold approaches the Shannon limit. We also perform an asymptotic weight enumerator analysis and show that, provided the density parameters are chosen to be sufficiently large, the SC-MN and SC-HA ensembles are asymptotically good. Further, for certain selections of parameters, some of these ensembles are shown to have both excellent thresholds and good distance properties. (Less)