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

arXiv:1701.07629 · IEEE International Symposium on Information Theory (ISIT)

Non-uniformly coupled LDPC codes: Better thresholds, smaller rate-loss, and less complexity

Laurent Schmalen, Vahid Aref, Fanny Jardel

Published Jun 1, 2017• 12 citations
arXivHTMLPDF

Abstract

We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing the amount of coupling between spatial positions, we show that we can construct codes with excellent thresholds and small rate loss, even with the lowest possible smoothing parameter and large variable node degrees, which are required for low error floors. We also establish that the decoding convergence speed is faster with non-uniformly coupled codes, which we verify by density evolution of windowed decoding with a finite number of iterations. We also show that by only slightly increasing the smoothing parameter, practical codes with potentially low error floors and thresholds close to capacity can be constructed. Finally, we give some indications on protograph designs.

DOI
10.1109/isit.2017.8006553

Related papers

Spatially Coupled LDPC Codes with Non-uniform Coupling for Improved Decoding Speed

Laurent Schmalen, Vahid Aref

We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing the amount of coupling between spatial positions, we show that we can construct codes with improved decoding speed compared with conventional, uniform smoothing constructions. This leads to a significantly better performance under decoder complexity constraints while keeping the degree distribution regular. We optimize smoothing configurations using differential evolution and illustrate the performance gains by means of a simulation.

arXiv:1904.07026•IEEE Information Theory Workshop (ITW)•Aug 1, 2019•2 citations

Spatially Coupled LDPC Codes Constructed From Protographs

David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello

In this paper, we construct protograph-based spatially coupled low-density parity-check (LDPC) codes by coupling together a series of L disjoint, or uncoupled, LDPC code Tanner graphs into a single coupled chain. By varying L , we obtain a flexible family of code ensembles with varying rates and frame lengths that can share the same encoding and decoding architecture for arbitrary L . We demonstrate that the resulting codes combine the best features of optimized irregular and regular codes in one design: capacity approaching iterative belief propagation (BP) decoding thresholds and linear growth of minimum distance with block length. In particular, we show that, for sufficiently large L , the BP thresholds on both the binary erasure channel and the binary-input additive white Gaussian noise channel saturate to a particular value significantly better than the BP decoding threshold and numerically indistinguishable from the optimal maximum a posteriori decoding threshold of the uncoupled LDPC code. When all variable nodes in the coupled chain have degree greater than two, asymptotically the error probability converges at least doubly exponentially with decoding iterations and we obtain sequences of asymptotically good LDPC codes with fast convergence rates and BP thresholds close to the Shannon limit. Further, the gap to capacity decreases as the density of the graph increases, opening up a new way to construct capacity achieving codes on memoryless binary-input symmetric-output channels with low-complexity BP decoding.

arXiv:1407.5366•IEEE Transactions on Information Theory•Jul 8, 2015•298 citations

An Efficient Encoding Method for Spatially Coupled Low-Density Parity-Check Codes

Zhanji Wu, Min Zhao, Shuoshuo Wang

In this paper, an efficient encoding scheme for spatially coupled low-density parity-check (SC-LDPC) codes is proposed. In order to lower the error floor, we optimize the degree distribution of SC-LDPC codes and propose a split variable nodes algorithm constructing sub-matrices with large girth of SC-LDPC codes. The corresponding sliding window decoding is studied as well to fasten the decoding convergence. Simulation results show that on the AWGN channel, SC-LDPC codes can obtain better error performance, lower decoding complexity and faster decoding convergence as compared with the LDPC block codes (LDPC-BC).

IEEE International Conference on Computer and Communications (ICCC)•Dec 1, 2019•0 citations

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

Non-Uniform Window Decoding Schedules for Spatially Coupled LDPC Codes

Najeeb ul Hassan, Alí Emre Pusane, Michael Lentmaier +2 more

Spatially coupled low-density parity-check codes can be decoded using a graph-based message passing algorithm applied across the total length of the coupled graph. However, considering practical constraints on decoding latency and complexity, a sliding window decoding approach is normally preferred. In order to reduce decoding complexity compared with standard parallel decoding schedules, serial schedules can be applied within a decoding window. However, uniform serial schedules within a window do not provide the expected reduction in complexity. Hence, we propose non-uniform schedules (parallel and serial) based on measured improvements in the estimated bit error rate (BER). We show that these non-uniform schedules result in a significant reduction in complexity without any loss in performance. Furthermore, based on observations made using density evolution, we propose a non-uniform pragmatic decoding schedule (parallel and serial) that does not require any additional calculations (e.g., BER estimates) within the decoding process.

IEEE Transactions on Communications•Nov 29, 2016•30 citations

Non-Uniform Windowed Decoding Schedules for Spatially Coupled Codes

Najeeb ul Hassan, Alí Emre Pusane, Michael Lentmaier +2 more

Low-density parity-check convolutional (LDPCC) codes, also known as spatially coupled LDPC codes, can be decoded using a message passing algorithm. In order to limit decoding latency and complexity, windowed decoding can be applied. Updates within the window can be performed either in parallel or serially. However, simulation results show that uniform updating schedules do not provide the expected reduction in complexity when applied within the window. Hence we propose non-uniform schedules for updating the nodes based on measured improvements in the bit error rate. Nodes within the window that stop showing any improvement are excluded from the update list for the next iteration. This results in a reduction of up to 50% in complexity compared to uniform window schedules. (Less)

•Jan 1, 2013•1 citation
We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing the amount of coupling between spatial positions, we show that we can construct codes with excellent thresholds and small rate loss, even with the lowest possible smoothing parameter and large variable node degrees, which are required for low error floors. We also establish that the decoding convergence speed is faster with non-uniformly coupled codes, which we verify by density evolution of windowed decoding with a finite number of iterations. We also show that by only slightly increasing the smoothing parameter, practical codes with potentially low error floors and thresholds close to capacity can be constructed. Finally, we give some indications on protograph designs.
We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing the amount of coupling between spatial positions, we show that we can construct codes with improved decoding speed compared with conventional, uniform smoothing constructions. This leads to a significantly better performance under decoder complexity constraints while keeping the degree distribution regular. We optimize smoothing configurations using differential evolution and illustrate the performance gains by means of a simulation.
In this paper, we construct protograph-based spatially coupled low-density parity-check (LDPC) codes by coupling together a series of L disjoint, or uncoupled, LDPC code Tanner graphs into a single coupled chain. By varying L , we obtain a flexible family of code ensembles with varying rates and frame lengths that can share the same encoding and decoding architecture for arbitrary L . We demonstrate that the resulting codes combine the best features of optimized irregular and regular codes in one design: capacity approaching iterative belief propagation (BP) decoding thresholds and linear growth of minimum distance with block length. In particular, we show that, for sufficiently large L , the BP thresholds on both the binary erasure channel and the binary-input additive white Gaussian noise channel saturate to a particular value significantly better than the BP decoding threshold and numerically indistinguishable from the optimal maximum a posteriori decoding threshold of the uncoupled LDPC code. When all variable nodes in the coupled chain have degree greater than two, asymptotically the error probability converges at least doubly exponentially with decoding iterations and we obtain sequences of asymptotically good LDPC codes with fast convergence rates and BP thresholds close to the Shannon limit. Further, the gap to capacity decreases as the density of the graph increases, opening up a new way to construct capacity achieving codes on memoryless binary-input symmetric-output channels with low-complexity BP decoding.
In this paper, an efficient encoding scheme for spatially coupled low-density parity-check (SC-LDPC) codes is proposed. In order to lower the error floor, we optimize the degree distribution of SC-LDPC codes and propose a split variable nodes algorithm constructing sub-matrices with large girth of SC-LDPC codes. The corresponding sliding window decoding is studied as well to fasten the decoding convergence. Simulation results show that on the AWGN channel, SC-LDPC codes can obtain better error performance, lower decoding complexity and faster decoding convergence as compared with the LDPC block codes (LDPC-BC).
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 codes can be decoded using a graph-based message passing algorithm applied across the total length of the coupled graph. However, considering practical constraints on decoding latency and complexity, a sliding window decoding approach is normally preferred. In order to reduce decoding complexity compared with standard parallel decoding schedules, serial schedules can be applied within a decoding window. However, uniform serial schedules within a window do not provide the expected reduction in complexity. Hence, we propose non-uniform schedules (parallel and serial) based on measured improvements in the estimated bit error rate (BER). We show that these non-uniform schedules result in a significant reduction in complexity without any loss in performance. Furthermore, based on observations made using density evolution, we propose a non-uniform pragmatic decoding schedule (parallel and serial) that does not require any additional calculations (e.g., BER estimates) within the decoding process.
Low-density parity-check convolutional (LDPCC) codes, also known as spatially coupled LDPC codes, can be decoded using a message passing algorithm. In order to limit decoding latency and complexity, windowed decoding can be applied. Updates within the window can be performed either in parallel or serially. However, simulation results show that uniform updating schedules do not provide the expected reduction in complexity when applied within the window. Hence we propose non-uniform schedules for updating the nodes based on measured improvements in the bit error rate. Nodes within the window that stop showing any improvement are excluded from the update list for the next iteration. This results in a reduction of up to 50% in complexity compared to uniform window schedules. (Less)