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 Communications Letters

Soft-Output ORDEPT Iterative Decoding of Generalized LDPC and Product Codes

Reza Hadavian, Dmitri V. Truhachev, Michael Lentmaier

Published Jan 1, 2026• 0 citations
Publisher

Abstract

We present a soft-input soft-output (SISO) decoding algorithm for binary block codes, based on ordered reliability direct error-pattern testing (ORDEPT) and extended covered space approximation. The method can be used for iterative decoding of product-like and generalized low-density parity-check (GLDPC) codes. Our results obtained for product and GLDPC codes with extended Bose-Chaudhuri-Hocquenghem (BCH) component codes show that the proposed decoder demonstrates improved performance, often achieved with much smaller complexity compared to the state-of-the-art SISO decoders.

DOI
10.1109/lcomm.2026.3725923

Related papers

Ordered Reliability Direct Error Pattern Testing Decoding Algorithm

Reza Hadavian, Xiaoting Huang, Dmitri V. Truhachev +3 more

We introduce a novel universal soft-decision decoding algorithm for binary block codes called ordered reliability direct error pattern testing (ORDEPT). Our results, obtained for a variety of popular short high-rate codes, demonstrate that ORDEPT outperforms state-of-the-art decoding algorithms of comparable complexity such as ordered reliability bits guessing random additive noise decoding (ORBGRAND) in terms of the decoding error probability and latency. The improvements carry on to the iterative decoding of product codes and convolutional product-like codes, where we present a new adaptive decoding algorithm and demonstrate the ability of ORDEPT to efficiently find multiple candidate codewords to produce soft output.

arXiv:2310.12039•Oct 18, 2023•1 citation

Ordered Reliability Direct Error Pattern Testing Decoding Algorithm

Reza Hadavian, Xiaoting Huang, Dmitri V. Truhachev +5 more

We introduce a novel soft-decision decoding algorithm for binary block codes named ordered reliability direct error pattern testing (ORDEPT). The proposed technique tests a list of partial error patterns (PEP)s that are arranged according to their logistic weight and completed on-the-fly based on the instantaneous received sequence and the code’s parity-check matrix. Our results, obtained for a variety of popular short high-rate codes, demonstrate that ORDEPT outperforms state-of-the-art decoding algorithms such as ordered reliability bits guessing random additive noise decoding (ORBGRAND) in terms of decoding complexity, and is hardware-favorable in terms of latency and energy consumption. The improvements carry on to the iterative decoding of product codes and convolutional product-like codes, where ORDEPT demonstrates the ability to efficiently find multiple candidate codewords and outperform state-of-the art competitors.

IEEE Transactions on Communications•May 26, 2025•9 citations

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

Lowered-complexity soft decoding of generalized LDPC codes over AWGN channels

Sherif Elsanadily, Ashraf M. Mahran, Osama M. Elghandour

This paper presents a lowered complexity version of a reliability-based iterative decoding algorithm for Generalized Low Density Parity Check (GLDPC) codes with BCH constituent codes using Soft-Input Soft-Output (SISO) Chase-II algorithm. Applied to Gallager-based global LDPC code, it shows that the proposed algorithm, when employed on GLDPC with the multi-error correction BCH subcodes, reduces the complexity of the conventional Soft-Decision Decoding (SDD) with Chase algorithm at a cost of slight degradation in the error performance. The approach is built on eliminating the employment of the Chase SISO decoder at the Generalized Check Nodes (GCNs) where the expected number of errors is within the correction capability of the Hard-Decision Decoder (HDD). As a case study, the decoder is considered under AWGN channel and Simulation results are presented showing the complexity and performance of the conventional and proposed algorithms.

International Conference on Computer Engineering & Systems (ICCES)•Dec 1, 2017•1 citation

Binary Message Passing Decoding of Product-Like Codes

Alireza Sheikh, Alexandre Graell i Amat, Gianluigi Liva

We propose a novel binary message passing decoding algorithm for product-like codes based on bounded distance decoding (BDD) of the component codes. The algorithm, dubbed iterative BDD with scaled reliability (iBDD-SR), exploits the channel reliabilities and is therefore soft in nature. However, the messages exchanged by the component decoders are binary (hard) messages, which significantly reduces the decoder data flow. The exchanged binary messages are obtained by combining the channel reliability with the BDD decoder output reliabilities, properly conveyed by a scaling factor applied to the BDD decisions. We perform a density evolution analysis for generalized low-density parity-check (GLDPC) code ensembles and spatially coupled GLDPC code ensembles, from which the scaling factors of the iBDD-SR for product and staircase codes, respectively, can be obtained. For the white additive Gaussian noise channel, we show performance gains up to 0.29 dB and 0.31 dB for product and staircase codes compared to conventional iterative BDD (iBDD) with the same decoder data flow. Furthermore, we show that iBDD-SR approaches the performance of ideal iBDD that prevents miscorrections.

arXiv:1902.03575•IEEE Transactions on Communications•Sep 11, 2019•51 citations

SOGRAND decoding of LDPC codes

Ken R. Duffy, Jiewei Feng, Lukas Rapp +1 more

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.

arXiv:2607.04045•IEEE Communications Letters•Jan 1, 2026•1 citation
We present a soft-input soft-output (SISO) decoding algorithm for binary block codes, based on ordered reliability direct error-pattern testing (ORDEPT) and extended covered space approximation. The method can be used for iterative decoding of product-like and generalized low-density parity-check (GLDPC) codes. Our results obtained for product and GLDPC codes with extended Bose-Chaudhuri-Hocquenghem (BCH) component codes show that the proposed decoder demonstrates improved performance, often achieved with much smaller complexity compared to the state-of-the-art SISO decoders.
We introduce a novel universal soft-decision decoding algorithm for binary block codes called ordered reliability direct error pattern testing (ORDEPT). Our results, obtained for a variety of popular short high-rate codes, demonstrate that ORDEPT outperforms state-of-the-art decoding algorithms of comparable complexity such as ordered reliability bits guessing random additive noise decoding (ORBGRAND) in terms of the decoding error probability and latency. The improvements carry on to the iterative decoding of product codes and convolutional product-like codes, where we present a new adaptive decoding algorithm and demonstrate the ability of ORDEPT to efficiently find multiple candidate codewords to produce soft output.
We introduce a novel soft-decision decoding algorithm for binary block codes named ordered reliability direct error pattern testing (ORDEPT). The proposed technique tests a list of partial error patterns (PEP)s that are arranged according to their logistic weight and completed on-the-fly based on the instantaneous received sequence and the code’s parity-check matrix. Our results, obtained for a variety of popular short high-rate codes, demonstrate that ORDEPT outperforms state-of-the-art decoding algorithms such as ordered reliability bits guessing random additive noise decoding (ORBGRAND) in terms of decoding complexity, and is hardware-favorable in terms of latency and energy consumption. The improvements carry on to the iterative decoding of product codes and convolutional product-like codes, where ORDEPT demonstrates the ability to efficiently find multiple candidate codewords and outperform state-of-the art competitors.
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.
This paper presents a lowered complexity version of a reliability-based iterative decoding algorithm for Generalized Low Density Parity Check (GLDPC) codes with BCH constituent codes using Soft-Input Soft-Output (SISO) Chase-II algorithm. Applied to Gallager-based global LDPC code, it shows that the proposed algorithm, when employed on GLDPC with the multi-error correction BCH subcodes, reduces the complexity of the conventional Soft-Decision Decoding (SDD) with Chase algorithm at a cost of slight degradation in the error performance. The approach is built on eliminating the employment of the Chase SISO decoder at the Generalized Check Nodes (GCNs) where the expected number of errors is within the correction capability of the Hard-Decision Decoder (HDD). As a case study, the decoder is considered under AWGN channel and Simulation results are presented showing the complexity and performance of the conventional and proposed algorithms.
We propose a novel binary message passing decoding algorithm for product-like codes based on bounded distance decoding (BDD) of the component codes. The algorithm, dubbed iterative BDD with scaled reliability (iBDD-SR), exploits the channel reliabilities and is therefore soft in nature. However, the messages exchanged by the component decoders are binary (hard) messages, which significantly reduces the decoder data flow. The exchanged binary messages are obtained by combining the channel reliability with the BDD decoder output reliabilities, properly conveyed by a scaling factor applied to the BDD decisions. We perform a density evolution analysis for generalized low-density parity-check (GLDPC) code ensembles and spatially coupled GLDPC code ensembles, from which the scaling factors of the iBDD-SR for product and staircase codes, respectively, can be obtained. For the white additive Gaussian noise channel, we show performance gains up to 0.29 dB and 0.31 dB for product and staircase codes compared to conventional iterative BDD (iBDD) with the same decoder data flow. Furthermore, we show that iBDD-SR approaches the performance of ideal iBDD that prevents miscorrections.
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.