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:2306.00443 · International Conference on Communications

Efficient Near Maximum-Likelihood Reliability-Based Decoding for Short LDPC Codes

Weiyang Zhang, Chentao Yue, Yonghui Li, Branka S. Vucetic

Published Jun 9, 2024• 12 citations
arXivHTMLPDF

Abstract

In this paper, we propose an efficient decoding algorithm for short low-density parity check (LDPC) codes by carefully combining the belief propagation (BP) decoding and ordered statistics decoding (OSD) algorithms. Specifically, a modified BP (mBP) algorithm is applied for a certain number of iterations prior to OSD to enhance the reliability of the received message, where an offset parameter is utilized in mBP to control the weight of the extrinsic information in message passing. By carefully selecting the offset parameter and the number of mBP iterations, the number of errors in the most reliable positions (MRPs) in OSD can be reduced by mBP, thereby significantly improving the overall decoding performance of error rate and complexity. Simulation results show that the proposed algorithm can approach the maximum-likelihood decoding (MLD) for short LDPC codes with only a slight increase in complexity compared to BP and a significant decrease compared to OSD. Specifically, the order- (m -1) decoding of the proposed algorithm can achieve the performance of the order-m OSD.

DOI
10.1109/icc51166.2024.10622261

Related papers

An Efficient Ordered Likelihood Decoder for Rate-Compatible Short LDPC codes

Chunjie Li, Ke Zhang, Ye Wang +3 more

This paper proposes a concatenated multi-belief ordered likelihood decoding (MB-OLD) algorithm for rate-compatible (RC) short low-density parity check (LDPC) codes, where the output log-likelihood ratios (LLRs) of belief propagation (BP) are sent to a well-designed bit-flipping decoder, which we called ordered likelihood decoder (OLD). In contrast to conventional ordered statistic decoder (OSD), the test error patterns (TEPs) sequence of OLD is generated from most likely to least likely, where the ordered reliability sequence associated with the most reliable basis (MRB) is approximated as multiple lines, and a stopping criterion (SC) is taken to reduce the decoding complexity. Furthermore, we analyze the LLR behavior of BP decoder in short block-length regimes, and propose an optimal iteration number. Based on these analyses, the output LLRs of BP within the optimal number of iterations are well combined and sent to OLD. Simulation results show that the proposed MB-OLD has the superior decoding performances in terms of error-rate and decoding complexity than its counterparts.

Globecom•Dec 8, 2024•4 citations

Reliability-based syndrome decoding of LDPC codes

Guangwen Li, Guangzeng Feng

Aiming at bridge gap between maximum likelihood decoding (MLD) and belief propagation (BP) decoding for short or medium LDPC codes, we present one modified ordered statistics decoding (OSD) reprocessing method, which is serially concatenated with standard BP. Meanwhile, two novel points in implementation are addressed. For one thing, the new definition of bit reliability proposed enhances error-correcting performance via centralizing more decoding errors of standard BP within the scope of order-p OSD where p ≤ 2. For another, one way of reducing computational complexity is put forward in selecting optimal error pattern among all candidates. Simulation results demonstrate our approach could achieve good tradeoff between reprocessing performance and computational complexity. Techniques on further improvement are also discussed briefly. Reliability-based syndrome decoding of LDPC codes 1 I.

•Jan 1, 2007•0 citations

Iterative reliability based decoding of LDPC codes

M.P.C. Fossorier

In this work, reliability based decoding is combined with belief propagation (BP) decoding for low-density parity check (LDPC) codes. At each iteration, the soft output values delivered by the BP algorithm are used as reliability values to perform reduced complexity soft decision decoding of the code considered. This approach allows to bridge the error performance gap between BP decoding which remains suboptimum, and maximum likelihood decoding (MLD) which is too complex to be implemented for the codes considered. A stopping criterion which reduces the average number of iterations at the expense of very little performance degradation is also proposed for this combined decoding approach. Simulations results for several Gallager LDPC codes and different set cyclic (DSC) codes of hundreds of information bits are given and elaborated.

IEEE International Symposium on Information Theory (ISIT)•Nov 13, 2002•3 citations

Effective BP-ORBGRAND Scheme for Short LDPC Codes

Qing Yuan, Lingjun Kong, Tengda Yang +2 more

Low-density parity-check (LDPC) codes have been widely used in practice due to their excellent error correction capabilities. However, the error correction performance of traditional decoding algorithms for LDPC codes is limited under short block lengths. To address this problem, this paper proposes an effective scheme that contains two stages for decoding short LDPC codes. In the first stage, the traditional belief propagation (BP) iterative algorithm is used to decode an LDPC code. The decoding process terminates if a codeword is obtained in this stage. Otherwise, the second stage decoding is invoked, in which the ordered reliability bits guessing random additive noise decoding (ORBGRAND) algorithm is applied. The accumulated log-likelihood ratios in the first stage are used to order the test error patterns in the ORBGRAND algorithm. Simulation results indicate that the proposed BP-ORBGRAND scheme can outperform the traditional BP iterative algorithm with relatively low additional complexity. Compared with the decoding scheme that concatenates the BP algorithm and the order statistics decoding (OSD) algorithm, the proposed decoding scheme has similar performance and the operations involved can be efficiently implemented in the hardware platform. All these indicate that the proposed scheme is desirable for practical purposes.

IEEE Access•Jan 1, 2026•0 citations

Iterative reliability-based decoding of low-density parity check codes

M.P.C. Fossorier

In this paper, reliability based decoding is combined with belief propagation (BP) decoding for low-density parity check (LDPC) codes. At each iteration, the soft output values delivered by the BP algorithm are used as reliability values to perform reduced complexity soft decision decoding of the code considered. This approach allows to bridge the error performance gap between belief propagation decoding which remains suboptimum, and maximum likelihood decoding which is too complex to be implemented for the codes considered. Trade-offs between decoding complexity and error performance are also investigated. In particular, a stopping criterion which reduces the average number of iterations at the expense of very little performance degradation is proposed for this combined decoding approach. Simulation results for several Gallager (1963, 1968) LDPC codes and different set cyclic codes of hundreds of information bits are given and elaborated.

IEEE Journal on Selected Areas in Communications•May 1, 2001•169 citations

Improved BP-OSD cascade decoding algorithm using limited likelihood information

Qiao Guo-lei, Zijian Dong

In this work, we use restricted likelihood information of belief propagation (BP) algorithm to improve the accuracy of sorting in order statistic decoding (OSD) for low-density parity-check (LDPC) codes. The reliability information delivered from the last BP iteration to OSD algorithm is inaccurate because that the propagation information may be enlarged for the existence of girths, thence limitation on iterative information can been applied to improve the OSD decoding performance. Simulation results show that the proposed method is effective.

International Conference on Signal Processing Systems (ICSPS)•Jul 1, 2010•1 citation
In this paper, we propose an efficient decoding algorithm for short low-density parity check (LDPC) codes by carefully combining the belief propagation (BP) decoding and ordered statistics decoding (OSD) algorithms. Specifically, a modified BP (mBP) algorithm is applied for a certain number of iterations prior to OSD to enhance the reliability of the received message, where an offset parameter is utilized in mBP to control the weight of the extrinsic information in message passing. By carefully selecting the offset parameter and the number of mBP iterations, the number of errors in the most reliable positions (MRPs) in OSD can be reduced by mBP, thereby significantly improving the overall decoding performance of error rate and complexity. Simulation results show that the proposed algorithm can approach the maximum-likelihood decoding (MLD) for short LDPC codes with only a slight increase in complexity compared to BP and a significant decrease compared to OSD. Specifically, the order- (m -1) decoding of the proposed algorithm can achieve the performance of the order-m OSD.
This paper proposes a concatenated multi-belief ordered likelihood decoding (MB-OLD) algorithm for rate-compatible (RC) short low-density parity check (LDPC) codes, where the output log-likelihood ratios (LLRs) of belief propagation (BP) are sent to a well-designed bit-flipping decoder, which we called ordered likelihood decoder (OLD). In contrast to conventional ordered statistic decoder (OSD), the test error patterns (TEPs) sequence of OLD is generated from most likely to least likely, where the ordered reliability sequence associated with the most reliable basis (MRB) is approximated as multiple lines, and a stopping criterion (SC) is taken to reduce the decoding complexity. Furthermore, we analyze the LLR behavior of BP decoder in short block-length regimes, and propose an optimal iteration number. Based on these analyses, the output LLRs of BP within the optimal number of iterations are well combined and sent to OLD. Simulation results show that the proposed MB-OLD has the superior decoding performances in terms of error-rate and decoding complexity than its counterparts.
Aiming at bridge gap between maximum likelihood decoding (MLD) and belief propagation (BP) decoding for short or medium LDPC codes, we present one modified ordered statistics decoding (OSD) reprocessing method, which is serially concatenated with standard BP. Meanwhile, two novel points in implementation are addressed. For one thing, the new definition of bit reliability proposed enhances error-correcting performance via centralizing more decoding errors of standard BP within the scope of order-p OSD where p ≤ 2. For another, one way of reducing computational complexity is put forward in selecting optimal error pattern among all candidates. Simulation results demonstrate our approach could achieve good tradeoff between reprocessing performance and computational complexity. Techniques on further improvement are also discussed briefly. Reliability-based syndrome decoding of LDPC codes 1 I.
In this work, reliability based decoding is combined with belief propagation (BP) decoding for low-density parity check (LDPC) codes. At each iteration, the soft output values delivered by the BP algorithm are used as reliability values to perform reduced complexity soft decision decoding of the code considered. This approach allows to bridge the error performance gap between BP decoding which remains suboptimum, and maximum likelihood decoding (MLD) which is too complex to be implemented for the codes considered. A stopping criterion which reduces the average number of iterations at the expense of very little performance degradation is also proposed for this combined decoding approach. Simulations results for several Gallager LDPC codes and different set cyclic (DSC) codes of hundreds of information bits are given and elaborated.
Low-density parity-check (LDPC) codes have been widely used in practice due to their excellent error correction capabilities. However, the error correction performance of traditional decoding algorithms for LDPC codes is limited under short block lengths. To address this problem, this paper proposes an effective scheme that contains two stages for decoding short LDPC codes. In the first stage, the traditional belief propagation (BP) iterative algorithm is used to decode an LDPC code. The decoding process terminates if a codeword is obtained in this stage. Otherwise, the second stage decoding is invoked, in which the ordered reliability bits guessing random additive noise decoding (ORBGRAND) algorithm is applied. The accumulated log-likelihood ratios in the first stage are used to order the test error patterns in the ORBGRAND algorithm. Simulation results indicate that the proposed BP-ORBGRAND scheme can outperform the traditional BP iterative algorithm with relatively low additional complexity. Compared with the decoding scheme that concatenates the BP algorithm and the order statistics decoding (OSD) algorithm, the proposed decoding scheme has similar performance and the operations involved can be efficiently implemented in the hardware platform. All these indicate that the proposed scheme is desirable for practical purposes.
In this paper, reliability based decoding is combined with belief propagation (BP) decoding for low-density parity check (LDPC) codes. At each iteration, the soft output values delivered by the BP algorithm are used as reliability values to perform reduced complexity soft decision decoding of the code considered. This approach allows to bridge the error performance gap between belief propagation decoding which remains suboptimum, and maximum likelihood decoding which is too complex to be implemented for the codes considered. Trade-offs between decoding complexity and error performance are also investigated. In particular, a stopping criterion which reduces the average number of iterations at the expense of very little performance degradation is proposed for this combined decoding approach. Simulation results for several Gallager (1963, 1968) LDPC codes and different set cyclic codes of hundreds of information bits are given and elaborated.
In this work, we use restricted likelihood information of belief propagation (BP) algorithm to improve the accuracy of sorting in order statistic decoding (OSD) for low-density parity-check (LDPC) codes. The reliability information delivered from the last BP iteration to OSD algorithm is inaccurate because that the propagation information may be enlarged for the existence of girths, thence limitation on iterative information can been applied to improve the OSD decoding performance. Simulation results show that the proposed method is effective.