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 Access

Improving Windowed Decoding of SC LDPC Codes by Effective Decoding Termination, Message Reuse, and Amplification

Inayat Ali, Jong-Hwan Kim, Sang‐Hyo Kim, Heeyoul Kwak, Jong‐Seon No

Published Nov 8, 2017• 23 citations
Publisher

Abstract

In this paper, we address a number of weaknesses of the windowed decoding of spatially coupled low-density parity-check (SC LDPC) codes and propose three modifications that simultaneously improve its performance, complexity, and latency. An effective termination method of the windowed decoding and the reuse of edge messages of previous target symbols provide a good performance-latency tradeoff when compared with the conventional windowed decoder. Also, we propose a scheme that lowers the error floor, in which the amplified edge messages of the previous window are used in the present window. The proposed windowed decoding, consisting of the three schemes, provides a significant performance gain with smaller latency. The validity of the new windowed decoding is verified by the evaluation with codes from different SC LDPC ensembles.

DOI
10.1109/access.2017.2771375

Related papers

Effective bi-directional overlapped sliding window decoding of SC-LDPC codes

Jiho Kim, Hyeong‐Gun Joo, Dong‐Joon Shin

In this paper, a bi-directional sliding window decoder is proposed for spatially coupled low-density parity-check (SC-LDPC) codes, which improves the decoding complexity and performance compared to the conventional sliding window decoding (SWD) by sharing messages at the overlapped part of forward and backward decoding windows. Moreover, by using proper scaling factors that determine the weight of each message at the overlapped part of two sliding windows, good local decoding effects can be efficiently spread out to both ends of SC-LDPC code during decoding process. Such effective message updates of the proposed bi-directional overlapped sliding window decoding (BO-SWD) improve error floor performance compared to the conventional SWD. The validity of BO-SWD is verified by simulation with various SC-LDPC ensembles.

ICT Express•Nov 16, 2023•2 citations

Reliability-Based Windowed Decoding for Spatially Coupled LDPC Codes

Peng Kang, Yixuan Xie, Lei Yang +1 more

In this letter, we propose a reliability-based windowed decoding scheme for spatially coupled (SC) low-density parity-check (LDPC) codes. To mitigate the error propagation along the sliding windowed decoder of the SC LDPC codes, a partial message reservation method is proposed where only the reliable messages generated in the previous decoding window are reserved for the next decoding window. We also propose a partial syndrome check stopping rule for each decoding window, in which only the complete variable nodes are checked. Simulation results show that our proposed scheme significantly improves the error-floor performance compared to the sliding windowed decoder with the conventional weighted bit-flipping algorithm.

arXiv:1805.02902•IEEE Communications Letters•May 11, 2018•22 citations

Improved sliding window decoding of spatially coupled low-density parity-check codes

Shiyuan Mo, Li Chen

Spatially coupled low-density parity-check (SC-LDPC) codes can achieve capacity approaching performance with a small message recovery latency due to the sliding window decoding (SWD). Using a partial Tanner graph, the SWD performs iterative message passing until the average error probability Peof the target symbols falls below a threshold or the maximum iteration number is reached. However, Pedoes not decrease monotonically as iteration progresses. This implies the symbol likelihoods that were yielded when the decoding terminates may not be optimal for making decisions. Therefore, this paper proposes an improved SWD (ISWD) for SC-LDPC codes. The proposal monitors the achievable minimum of Peand stores its associated likelihoods, so that when the decoding terminates the target symbols will be estimated based on the stored likelihoods. Our research shows the ISWD is able to enhance the decoding performance, especially in the waterfall region. It exhibits an asymptotic convergence to the SWD performance. A complexity reducing variant of the ISWD is also proposed to facilitate the decoding but at the cost of error-correction performance.

IEEE Information Theory Workshop (ITW)•Nov 1, 2017•11 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

Avoiding trapping sets in SC-LDPC codes under windowed decoding

Allison Beemer, Christine A. Kelley

Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. Moreover, protograph SC-LDPC codes have been shown to be asymptotically good under certain conditions. SC-LDPC codes are amenable to a windowed decoder that allows decoding of blocks of bits to be done serially, making them good candidates for applications such as streaming. Depending on how they are constructed, however, the codes may still be prone to error floors. One key element in protograph SC-LDPC code design is the edge-spreading method used to couple copies of the base protograph in the construction of the SC-protograph. In this paper, we present an edge-spreading algorithm that is designed to remove trapping sets from the resulting SC-protograph that are harmful with respect to the windowed decoder, and we examine how to determine which trapping sets should be removed in the construction.

International Symposium on Information Theory and its Applications•Oct 1, 2016•11 citations

Performance Bounds for Quantized Spatially Coupled LDPC Decoders Based on Absorbing Sets

Homayoon Hatami, David G. M. Mitchell, Daniel J. Costello +1 more

Absorbing sets are known to be the primary factor in the error-floor performance of low-density parity-check (LDPC) codes with message passing decoders over the additive white Gaussian noise (AWGN) channel. Besides showing excellent waterfall performance, spatially coupled LDPC (SC-LDPC) codes that are constructed by an edge spreading technique are known to have fewer cycles and absorbing sets than their block code counterparts, and therefore to exhibit better error-floor performance. Based on our previously obtained results for quantized LDPC block decoders, we derive lower bounds on the performance of quantized SC-LDPC decoders, including both a flooding schedule decoder and a sliding window decoder. Numerical simulation results confirm the accuracy of the obtained bounds and show that, for quantized decoders, properly designed SC-LDPC codes have better error-floor performance than their underlying LDPC block codes.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•7 citations
In this paper, we address a number of weaknesses of the windowed decoding of spatially coupled low-density parity-check (SC LDPC) codes and propose three modifications that simultaneously improve its performance, complexity, and latency. An effective termination method of the windowed decoding and the reuse of edge messages of previous target symbols provide a good performance-latency tradeoff when compared with the conventional windowed decoder. Also, we propose a scheme that lowers the error floor, in which the amplified edge messages of the previous window are used in the present window. The proposed windowed decoding, consisting of the three schemes, provides a significant performance gain with smaller latency. The validity of the new windowed decoding is verified by the evaluation with codes from different SC LDPC ensembles.
In this paper, a bi-directional sliding window decoder is proposed for spatially coupled low-density parity-check (SC-LDPC) codes, which improves the decoding complexity and performance compared to the conventional sliding window decoding (SWD) by sharing messages at the overlapped part of forward and backward decoding windows. Moreover, by using proper scaling factors that determine the weight of each message at the overlapped part of two sliding windows, good local decoding effects can be efficiently spread out to both ends of SC-LDPC code during decoding process. Such effective message updates of the proposed bi-directional overlapped sliding window decoding (BO-SWD) improve error floor performance compared to the conventional SWD. The validity of BO-SWD is verified by simulation with various SC-LDPC ensembles.
In this letter, we propose a reliability-based windowed decoding scheme for spatially coupled (SC) low-density parity-check (LDPC) codes. To mitigate the error propagation along the sliding windowed decoder of the SC LDPC codes, a partial message reservation method is proposed where only the reliable messages generated in the previous decoding window are reserved for the next decoding window. We also propose a partial syndrome check stopping rule for each decoding window, in which only the complete variable nodes are checked. Simulation results show that our proposed scheme significantly improves the error-floor performance compared to the sliding windowed decoder with the conventional weighted bit-flipping algorithm.
Spatially coupled low-density parity-check (SC-LDPC) codes can achieve capacity approaching performance with a small message recovery latency due to the sliding window decoding (SWD). Using a partial Tanner graph, the SWD performs iterative message passing until the average error probability Peof the target symbols falls below a threshold or the maximum iteration number is reached. However, Pedoes not decrease monotonically as iteration progresses. This implies the symbol likelihoods that were yielded when the decoding terminates may not be optimal for making decisions. Therefore, this paper proposes an improved SWD (ISWD) for SC-LDPC codes. The proposal monitors the achievable minimum of Peand stores its associated likelihoods, so that when the decoding terminates the target symbols will be estimated based on the stored likelihoods. Our research shows the ISWD is able to enhance the decoding performance, especially in the waterfall region. It exhibits an asymptotic convergence to the SWD performance. A complexity reducing variant of the ISWD is also proposed to facilitate the decoding but at the cost of error-correction performance.
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).
Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. Moreover, protograph SC-LDPC codes have been shown to be asymptotically good under certain conditions. SC-LDPC codes are amenable to a windowed decoder that allows decoding of blocks of bits to be done serially, making them good candidates for applications such as streaming. Depending on how they are constructed, however, the codes may still be prone to error floors. One key element in protograph SC-LDPC code design is the edge-spreading method used to couple copies of the base protograph in the construction of the SC-protograph. In this paper, we present an edge-spreading algorithm that is designed to remove trapping sets from the resulting SC-protograph that are harmful with respect to the windowed decoder, and we examine how to determine which trapping sets should be removed in the construction.
Absorbing sets are known to be the primary factor in the error-floor performance of low-density parity-check (LDPC) codes with message passing decoders over the additive white Gaussian noise (AWGN) channel. Besides showing excellent waterfall performance, spatially coupled LDPC (SC-LDPC) codes that are constructed by an edge spreading technique are known to have fewer cycles and absorbing sets than their block code counterparts, and therefore to exhibit better error-floor performance. Based on our previously obtained results for quantized LDPC block decoders, we derive lower bounds on the performance of quantized SC-LDPC decoders, including both a flooding schedule decoder and a sliding window decoder. Numerical simulation results confirm the accuracy of the obtained bounds and show that, for quantized decoders, properly designed SC-LDPC codes have better error-floor performance than their underlying LDPC block codes.