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:2607.04045 · IEEE Communications Letters

SOGRAND decoding of LDPC codes

Ken R. Duffy, Jiewei Feng, Lukas Rapp, Muriel Médard

Published Jan 1, 2026• 1 citation
arXivHTMLPDF

Abstract

Long forward error correction codes are typically constructed by concatenating shorter component codes that are then decoded through iterative Soft-Input Soft-Output (SISO) decoding of their component codes. The recently introduced Soft Output Guessing Random Additive Noise Decoding (SOGRAND) has been shown to enable accurate SISO component decoding for a broad range of component codes. Here we establish that by specializing its SISO computation to Single Parity Check codes, SOGRAND offers an alternative to existing Check Node (CN) updates for decoding Low Density Parity Check codes. Simulation results demonstrate similar or better decoding performance than Gallager’s sum-product algorithm and norm-min-sum, while offering two distinct hardware friendly CN update algorithms.

DOI
10.1109/lcomm.2026.3750295

Related papers

Soft-Output (SO) GRAND and Iterative Decoding to Outperform LDPC Codes

Peihong Yuan, Muriel Médard, Kevin Galligan +1 more

We establish that a large, flexible class of long, high redundancy error correcting codes can be efficiently and accurately decoded with guessing random additive noise decoding (GRAND). Performance evaluation demonstrates that it is possible to construct simple product codes with lengths of approximately 200 to 4000 bits and rates between 0.2 and 0.8 that outperform low-density parity-check (LDPC) codes from the 5G New Radio standard in both AWGN and fading channels. The concatenated structure enables many desirable features, including: low-complexity hardware-friendly encoding and decoding; significant flexibility in length and rate through modularity; and high levels of parallelism in encoding and decoding that enable low latency. Central is the development of a method through which any soft-input (SI) GRAND algorithm can provide soft-output (SO) in the form of an accurate a-posteriori estimate of the likelihood that a decoding is correct or, in the case of list decoding, the likelihood that each element of the list is correct. The distinguishing feature of soft-output GRAND (SOGRAND) is the provision of an estimate that the correct decoding has not been found, even when providing a single decoding. Per-block SO can be converted into accurate per-bit SO by a weighted sum that includes a term for the SI. Implementing SOGRAND adds negligible computation and memory to the existing decoding process, and using it results in a practical, low-latency alternative to LDPC codes.

arXiv:2310.10737•IEEE Transactions on Wireless Communications•Jan 24, 2025•37 citations

Efficient Soft-Output Guessing for Enhanced Quantum Tanner Code Decoding

Lukas Rapp, Muriel Médard, Eugene Tang +1 more

We introduce a generalized low-density parity-check decoding framework for quantum Tanner codes utilizing soft-output guessing random additive noise decoding (SOGRAND). By soft-output decoding entire component codes rather than individual parity checks, we mitigate the effects of trapping sets and cycles, resulting in improved convergence. Because our decoder preserves the message passing structure of standard belief propagation (BP), it is compatible with many BP enhancements. We demonstrate this with OSD postprocessing, quaternary BP, and RelayBP, each yielding further gains. Standalone SOGRAND outperforms the standard BP+OSD baseline by over two orders of magnitude in logical error rate. In combination with the Relay principle, SOGRAND outperforms RelayBP by over one order of magnitude, providing a way forward for scalable decoding of the emerging class of Tanner-code-based quantum codes.

quant-pharXiv:2603.18318•Physical Review A•Mar 20, 2026•1 citation

Efficient decoding of generalized low-density parity-check codes based on long component codes

Telex M. N. Ngatched, Fambirai Takawira

A class of pseudo-random compound error-correcting codes, called generalized low density (GLD) parity-check codes, has been proposed recently. As a generalization of Gallager's low-density parity check (LPDC) codes, GLD codes are also asymptotically good in the sense of minimum distance criterion and can be effectively decoded based on iterative soft-input soft-output (SISO) decoding of individual constituent codes. The code performance and decoding complexity of GLD codes are heavily dependent on the employed SISO decoding algorithm. In this paper, we present an efficient SISO decoding algorithm for GLD codes. The proposed algorithm utilizes Kaneko's decoding algorithm for soft-input hard-output decoding. These hard outputs are converted to soft-decision using reliability calculations. The algorithm proposed here presents a major advantage over existing decoding algorithms for GLD codes by being applicable even when long and powerful component codes are used. The complexity of the proposed algorithm is less than that of trellis-based decoding algorithms with a performance degradation of only 0.3 dB.

IEEE Wireless Communications and Networking Conference•Jan 24, 2004•6 citations

Turbo product decoding of cubic tensor codes

Sarah Khalifeh, Ken R. Duffy, Muriel Médard

Long, powerful soft detection forward error correction codes are typically constructed by concatenation of shorter component codes that are decoded through iterative Soft-Input Soft-Output (SISO) procedures. The current gold-standard is Low Density Parity Check (LDPC) codes, which are built from weak single parity check component codes that are capable of producing accurate SO. Due to the recent development of SISO decoders that produce highly accurate SO with codes that have multiple redundant bits, square product code constructions that can avail of more powerful component codes have been shown to be competitive with the LDPC codes in the 5G New Radio standard in terms of decoding performance while requiring fewer iterations to converge. Motivated by applications that require more powerful low-rate codes, in the present paper we explore the possibility of extending this design space by considering the construction and decoding of cubic tensor codes.

arXiv:2412.14017•Conference on Information Sciences and Systems•Mar 19, 2025•3 citations

Stochastic Decoding of Linear Block Codes With High-Density Parity-Check Matrices

Saeed Sharifi Tehrani, Christophe Jégo, Bo Zhu +1 more

This correspondence extends the application of the recently proposed stochastic decoding approach to decode linear block codes with high-density parity-check matrices and discusses its hardware complexity. Results demonstrate decoding performance close to floating-point iterative soft-input soft-output (SISO) decoding while offering nodes with considerably lower complexity compared to fixed-point SISO decoding.

IEEE Transactions on Signal Processing•Aug 18, 2008•22 citations

A Fast Decoding Convergence of SISO Repetition - QC-LDPC Codes Concatenated at the Receiver

Amr Tarek, Amr Mohamed Abdelaziz, Hisham Al-Dahshan

Low-Density Parity Check (LDPC) is one of the contemporary error-correcting codes that has shown near Shannon capacity performance; it has been implemented into various stan-dards such as the second-generation Digital Video Broadcasting for Satellite (DVB-S2) and eventually made its way toward the 5G New Radio (NR) for the data channel. In an effort to enhance the LDPC decoding performance without a significant increase in the decoding complexity, in this paper, a receiver-based concatenated decoding approach is proposed, which is composed of the soft-input soft-output (SISO) repetition and offset min-sum (OMS) algorithm representing outer and inner decoders, respectively. At the receiver, the received signal is oversampled with an oversampling rate (OSR) faster than multiple integers of the Nyquist rate to produce repeated symbols. Moreover, the repetition employed at the receiver to handle the repeated symbols will not impact the coding rate. Finally, the simulation results revealed that the proposed scheme could accomplish faster-decoding convergence compared to the conventional LDPC decoders and achieve coding gain up to 2.3 dB with OSR = 2. Additionally, the computational complexity does not increase significantly; on the contrary, the achieved gain can be exploited to reduce the number of iterations.

Novel Intelligent and Leading Emerging Sciences Conference (NILES)•Oct 22, 2022•0 citations
Long forward error correction codes are typically constructed by concatenating shorter component codes that are then decoded through iterative Soft-Input Soft-Output (SISO) decoding of their component codes. The recently introduced Soft Output Guessing Random Additive Noise Decoding (SOGRAND) has been shown to enable accurate SISO component decoding for a broad range of component codes. Here we establish that by specializing its SISO computation to Single Parity Check codes, SOGRAND offers an alternative to existing Check Node (CN) updates for decoding Low Density Parity Check codes. Simulation results demonstrate similar or better decoding performance than Gallager’s sum-product algorithm and norm-min-sum, while offering two distinct hardware friendly CN update algorithms.
We establish that a large, flexible class of long, high redundancy error correcting codes can be efficiently and accurately decoded with guessing random additive noise decoding (GRAND). Performance evaluation demonstrates that it is possible to construct simple product codes with lengths of approximately 200 to 4000 bits and rates between 0.2 and 0.8 that outperform low-density parity-check (LDPC) codes from the 5G New Radio standard in both AWGN and fading channels. The concatenated structure enables many desirable features, including: low-complexity hardware-friendly encoding and decoding; significant flexibility in length and rate through modularity; and high levels of parallelism in encoding and decoding that enable low latency. Central is the development of a method through which any soft-input (SI) GRAND algorithm can provide soft-output (SO) in the form of an accurate a-posteriori estimate of the likelihood that a decoding is correct or, in the case of list decoding, the likelihood that each element of the list is correct. The distinguishing feature of soft-output GRAND (SOGRAND) is the provision of an estimate that the correct decoding has not been found, even when providing a single decoding. Per-block SO can be converted into accurate per-bit SO by a weighted sum that includes a term for the SI. Implementing SOGRAND adds negligible computation and memory to the existing decoding process, and using it results in a practical, low-latency alternative to LDPC codes.
We introduce a generalized low-density parity-check decoding framework for quantum Tanner codes utilizing soft-output guessing random additive noise decoding (SOGRAND). By soft-output decoding entire component codes rather than individual parity checks, we mitigate the effects of trapping sets and cycles, resulting in improved convergence. Because our decoder preserves the message passing structure of standard belief propagation (BP), it is compatible with many BP enhancements. We demonstrate this with OSD postprocessing, quaternary BP, and RelayBP, each yielding further gains. Standalone SOGRAND outperforms the standard BP+OSD baseline by over two orders of magnitude in logical error rate. In combination with the Relay principle, SOGRAND outperforms RelayBP by over one order of magnitude, providing a way forward for scalable decoding of the emerging class of Tanner-code-based quantum codes.
A class of pseudo-random compound error-correcting codes, called generalized low density (GLD) parity-check codes, has been proposed recently. As a generalization of Gallager's low-density parity check (LPDC) codes, GLD codes are also asymptotically good in the sense of minimum distance criterion and can be effectively decoded based on iterative soft-input soft-output (SISO) decoding of individual constituent codes. The code performance and decoding complexity of GLD codes are heavily dependent on the employed SISO decoding algorithm. In this paper, we present an efficient SISO decoding algorithm for GLD codes. The proposed algorithm utilizes Kaneko's decoding algorithm for soft-input hard-output decoding. These hard outputs are converted to soft-decision using reliability calculations. The algorithm proposed here presents a major advantage over existing decoding algorithms for GLD codes by being applicable even when long and powerful component codes are used. The complexity of the proposed algorithm is less than that of trellis-based decoding algorithms with a performance degradation of only 0.3 dB.
Long, powerful soft detection forward error correction codes are typically constructed by concatenation of shorter component codes that are decoded through iterative Soft-Input Soft-Output (SISO) procedures. The current gold-standard is Low Density Parity Check (LDPC) codes, which are built from weak single parity check component codes that are capable of producing accurate SO. Due to the recent development of SISO decoders that produce highly accurate SO with codes that have multiple redundant bits, square product code constructions that can avail of more powerful component codes have been shown to be competitive with the LDPC codes in the 5G New Radio standard in terms of decoding performance while requiring fewer iterations to converge. Motivated by applications that require more powerful low-rate codes, in the present paper we explore the possibility of extending this design space by considering the construction and decoding of cubic tensor codes.
Low-Density Parity Check (LDPC) is one of the contemporary error-correcting codes that has shown near Shannon capacity performance; it has been implemented into various stan-dards such as the second-generation Digital Video Broadcasting for Satellite (DVB-S2) and eventually made its way toward the 5G New Radio (NR) for the data channel. In an effort to enhance the LDPC decoding performance without a significant increase in the decoding complexity, in this paper, a receiver-based concatenated decoding approach is proposed, which is composed of the soft-input soft-output (SISO) repetition and offset min-sum (OMS) algorithm representing outer and inner decoders, respectively. At the receiver, the received signal is oversampled with an oversampling rate (OSR) faster than multiple integers of the Nyquist rate to produce repeated symbols. Moreover, the repetition employed at the receiver to handle the repeated symbols will not impact the coding rate. Finally, the simulation results revealed that the proposed scheme could accomplish faster-decoding convergence compared to the conventional LDPC decoders and achieve coding gain up to 2.3 dB with OSR = 2. Additionally, the computational complexity does not increase significantly; on the contrary, the achieved gain can be exploited to reduce the number of iterations.