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

Improved Sum-Min Decoding of Irregular LDPC Codes using Nonlinear Post-Processing

Jossy Sayir, G. Lechner

Published May 13, 2026• 0 citations
Publisher
DOI
10.17863/cam.127869

Related papers

Improved Min-Sum Decoding of Irregular LDPC Codes

Juntan Zhang, M.P.C. Fossorier, Daqing Gu +1 more

IEICE Technical Report; IEICE Tech. Rep.•May 19, 2005•0 citations

Comparison of Parallelization Strategies for Min-Sum Decoding of Irregular LDPC Codes

Xu, Hua Hua, Wan  +7 more

Tsinghua Science & Technology•Jan 1, 2013•0 citations

Improved Sum-Min Decoding for Irregular LDPC Codes

Gottfried Lechner, Jossy Sayir

An analytical approach to determining the optimal post-processing function for the minimum operation in the SumMin algorithm, previously derived for regular Low-Density Parity-Check (LOPe) codes, is extended to irregular LDPC codes. The optimal post-processing expression for the irregular case varies from one check node to another as well as from one iteration to the next. For practical use, it is necessary to approximate this optimal function. Unlike for the regular case, where one could use a unique post-processing function throughout the decoding process without a loss of bit error performance, for irregular codes it is crucial to vary the post-processing from one iteration to the next in order to achieve good performance. Using this approach, a bit error performance of 0.15dS from the Sum-Product decoder was demonstrated, corresponding to a IdS improvement compared to the Sum-Min algorithm without post-processing.

•Apr 3, 2006•28 citations

Reduced-complexity decoding of LDPC codes based on the sum-product algorithm

양경철

•Nov 1, 2006•0 citations

Improved min-sum decoding algorithms for irregular LDPC codes

Jinghu Chen, R. Michael Tanner, C. Jones +1 more

In this paper, we apply two improved min-sum algorithms, the normalized and offset min-sum algorithms, to the decoding of irregular LDPC codes. We show that the behavior of the two algorithms in decoding irregular LDPC codes is different from that in decoding regular LDPC codes, due to the existence of bit nodes of degree two. We analyze and give explanations to the difference, and propose approaches to improve the performance of the two algorithms.

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2005•86 citations

Comparison of parallelization strategies for min-sum decoding of irregular LDPC codes

Hua Xu, Wei Wan, Wei Wang +3 more

Low-Density Parity-Check (LDPC) codes are powerful error correcting codes. LDPC decoders have been implemented as efficient error correction codes on dedicated VLSI hardware architectures in recent years. This paper describes two strategies to parallelize min-sum decoding of irregular LDPC codes. The first implements min-sum LDPC decoders on multicore platforms using OpenMP, while the other uses the Compute Unified Device Architecture (CUDA) to parallelize LDPC decoding on Graphics Processing Units (GPUs). Empirical studies on data with various scales show that the performance of these decoding processes is improved by these parallel strategies and the GPUs provide more efficient, fast implementation decoder.

Tsinghua Science & Technology•Dec 1, 2013•1 citation
An analytical approach to determining the optimal post-processing function for the minimum operation in the SumMin algorithm, previously derived for regular Low-Density Parity-Check (LOPe) codes, is extended to irregular LDPC codes. The optimal post-processing expression for the irregular case varies from one check node to another as well as from one iteration to the next. For practical use, it is necessary to approximate this optimal function. Unlike for the regular case, where one could use a unique post-processing function throughout the decoding process without a loss of bit error performance, for irregular codes it is crucial to vary the post-processing from one iteration to the next in order to achieve good performance. Using this approach, a bit error performance of 0.15dS from the Sum-Product decoder was demonstrated, corresponding to a IdS improvement compared to the Sum-Min algorithm without post-processing.
Low-Density Parity-Check (LDPC) codes are powerful error correcting codes. LDPC decoders have been implemented as efficient error correction codes on dedicated VLSI hardware architectures in recent years. This paper describes two strategies to parallelize min-sum decoding of irregular LDPC codes. The first implements min-sum LDPC decoders on multicore platforms using OpenMP, while the other uses the Compute Unified Device Architecture (CUDA) to parallelize LDPC decoding on Graphics Processing Units (GPUs). Empirical studies on data with various scales show that the performance of these decoding processes is improved by these parallel strategies and the GPUs provide more efficient, fast implementation decoder.