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

ELIMINATING UNDETECTED ERRORS IN LDPC–CPM DECODERS

Erik S. Perrins

Published Oct 1, 2025• 0 citations
OpenAlex

Abstract

In error control coding, an undetected error occurs when the received code word passes the parity check even though errors are present. Such errors are a critical concern in many applications because a passed parity check at the receiver is taken to mean that the received code word is error free. In this paper, we outline the key operating principles and differences between the two constituent decoders in the system. Our high-level discussion reveals insights on two strategies that can be used in an LDPC–CPM decoder to eliminate undetected errors. The first is a brute-force approach of performing an additional decoding iteration to confirm (or rebut) a passed parity check. The second is a simple and elegant check-node-splitting approach that can be incorporated into the LDPC code itself. We provide numerical results and operating scenarios where these techniques are recommended for use.

Related papers

Breaking the Trapping Sets in LDPC Codes: Check Node Removal and Collaborative Decoding

Soonyoung Kang, Jaekyun J. Moon, Jeongseok Ha +1 more

Trapping sets strongly degrade performance of low-density parity check (LDPC) codes in the low-error-rate region. This creates significant difficulties for the deployment of LDPC codes to low-error-rate applications such as storage and wireless systems with no or limited retransmission options. We propose a novel technique for breaking trapping sets based on collaborative decoding that utilizes two different decoding modes. While the main decoding mode executes message passing based on the original parity check matrix of the corresponding LDPC code, the sub-decoding mode operates on a modified parity check matrix formed by removing a portion of check nodes in the factor graph representation of the given code. The modified parity check matrix is designed to promote a passing of correct information into erroneous variable nodes in the trapping set. Theoretical properties of the proposed trapping-set-breaking technique have been established based on the notion of the improved separation for the trapped variable nodes. Simulation results show that the proposed collaborative LDPC decoding scheme switching between the two decoding modes back and forth effectively breaks dominant trapping sets of various known types of regular and irregular LDPC codes.

IEEE Transactions on Communications•Nov 5, 2015•17 citations

An Efficient Majority Error Detection in Logic Decoding with Euclidean Geometry Low Density Parity Check (Eg-Ldpc) Codes

M .Vengadapathiraj Mr, U. Maheswaran, A.Karunakaran Mr

In a recent article, a technique was proposed to step up the majority logic decoding of variation set low density parity check codes. This is helpful as majority logic decoding can be implemented serially with trouble-free hardware but requires a huge decoding time. The method detect whether a word has errors in the initial iterations of majority logic decoding, and at what time there are no errors the decoding split ends without completing the rest of the iterations. While the majority words in a memory will be error-free, the average decoding time is significantly reduced. The outcome obtained proves that the technique is also effective for EG-LDPC codes. General simulation results are given to precisely estimate the prospect of error detection for different code sizes and numbers of errors.

International Journal of Business Intelligents•Jun 11, 2019•0 citations

A decoding algorithm for LDPC codes over erasure channels with sporadic errors

Gianluigi Liva, Enrico Paolini, Balázs Matuz +1 more

An efficient decoding algorithm for low-density parity-check (LDPC) codes on erasure channels with sporadic errors (i.e., binary error-and-erasure channels with error probability much smaller than the erasure probability) is proposed and its performance analyzed. A general single-error multiple-erasure (SEME) decoding algorithm is first described, which may be in principle used with any binary linear block code. The algorithm is optimum whenever the non-erased part of the received word is affected by at most one error, and is capable of performing error detection of multiple errors. An upper bound on the average block error probability under SEME decoding is derived for the linear random code ensemble. The bound is tight and easy to implement. The algorithm is then adapted to LDPC codes, resulting in a simple modification to a previously proposed efficient maximum likelihood LDPC erasure decoder which exploits the parity-check matrix sparseness. Numerical results reveal that LDPC codes under efficient SEME decoding can closely approach the average performance of random codes.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2010•10 citations

Techniques for improving ldpc codes performance

Esa Alghonaim

Low Density Parity Check (LDPC) codes are considered to be one of the best classes of error-correcting codes. This thesis deals with two major issues in LDPC codes: decoder design to enhance error correction performance and efficient decoder implementation. Five techniques have been introduced in this thesis. First, an efficient platform for LDPC code design and performance evaluation is developed. This platform implements parallel simulation algorithms to efficiently evaluate the performance of the proposed algorithms for LDPC decoders and code design. Second, an innovative technique is introduced to improve the performance of LDPC decoding in the error-floor region. Special structures in the code graph, called trapping sets, are considered to be the major source of decoding errors in the error-floor region. The proposed technique is based on eliminating the negative effect of trapping sets during LDPC decoding. As a third contribution, a novel approach to improve the decoder performance and/or throughput is introduced. This approach is based on utilizing LDPC decoder idle times by introducing two queues: one at the decoder input and the other at the decoder output. This architecture enables the decoder to run extra iterations beyond the conventional maximum allowable iterations. The fourth proposed technique reduces the bit error rate of LDPC decoders. This technique is based on tracking the number of failed parity check equations in the intermediate decoding iterations, rather than only relying on the final decoder output (after reaching the maximum number of iterations). The last proposed technique deals with the construction of interconnect efficient fully-parallel LDPC codes with high error correction performance. Fully-parallel implementation is very hard due to the complexity of processing elements interconnections. The proposed technique is based on constructing LDPC codes with less complex interconnections and with low impact on the error correction performance. This goal is achieved by putting a constraint on the maximum connection length between any two processing elements.

•Jan 1, 2008•0 citations

A Two-Stage Decoding Algorithm to Lower the Error-Floors for LDPC Codes

Xueting Zhang, Shaoping Chen

A two-stage decoding algorithm to lower the error-floor for low-density parity-check (LDPC) codes is presented. An efficient stopping criterion is proposed to avoid unnecessary iterations in the first stage. If the stopping criterion is reached, the first stage decoding will be terminated and the second stage decoding will be started, where the unsuccessfully decoded words are re-decoded by manipulating the log-likelihood ratio (LLR) of two types of specifically selected variable nodes. Simulation results show that the proposed algorithm can effectively lower the error floor of LDPC codes while maintaining a low decoding complexity.

IEEE Communications Letters•Feb 9, 2015•12 citations

Short LDPC Codes with Low Undetected Frame Error Rate: Post-Decoding Error Detection Criteria

Yilmaz, Fatmanur

Low-density parity-check (LDPC) codes have become a standard in modern communication systems thanks to their near-optimal error correction performance, which approaches Shannon's channel capacity as block length increases. However, in scenarios requiring short block lengths with low undetected frame error rate (UFER)-such as command and control data transmission in satellite communications-using only iterative decoders fails to achieve a balance between undetected and total frame error rates (FERs). This thesis addresses these challenges by investigating post-decoding error detection methods that enhance iterative LDPC decoding to achieve target FERs for both total and undetected errors. Specifically, we work with (128, 64) LDPC codes and explore two novel post-decoding techniques: bounded angle iterative decoding and single bit flip (SBF) list decoding, a variation of SBF decoding. These methods are applied to the iterative LDPC decoder output to manage the trade-off between total and undetected FERs effectively. Our results demonstrate that bounded angle iterative decoding effectively reduces UFER in codes with a large minimum distance with maintaining an acceptable increase in total frame error rate (TFER). Meanwhile, SBF list decoding mitigates the UFER increase introduced by standard SBF decoding, while retaining the significant TFER improvement that SBF decoding offers.

•Nov 1, 2024•0 citations
In error control coding, an undetected error occurs when the received code word passes the parity check even though errors are present. Such errors are a critical concern in many applications because a passed parity check at the receiver is taken to mean that the received code word is error free. In this paper, we outline the key operating principles and differences between the two constituent decoders in the system. Our high-level discussion reveals insights on two strategies that can be used in an LDPC–CPM decoder to eliminate undetected errors. The first is a brute-force approach of performing an additional decoding iteration to confirm (or rebut) a passed parity check. The second is a simple and elegant check-node-splitting approach that can be incorporated into the LDPC code itself. We provide numerical results and operating scenarios where these techniques are recommended for use.
Trapping sets strongly degrade performance of low-density parity check (LDPC) codes in the low-error-rate region. This creates significant difficulties for the deployment of LDPC codes to low-error-rate applications such as storage and wireless systems with no or limited retransmission options. We propose a novel technique for breaking trapping sets based on collaborative decoding that utilizes two different decoding modes. While the main decoding mode executes message passing based on the original parity check matrix of the corresponding LDPC code, the sub-decoding mode operates on a modified parity check matrix formed by removing a portion of check nodes in the factor graph representation of the given code. The modified parity check matrix is designed to promote a passing of correct information into erroneous variable nodes in the trapping set. Theoretical properties of the proposed trapping-set-breaking technique have been established based on the notion of the improved separation for the trapped variable nodes. Simulation results show that the proposed collaborative LDPC decoding scheme switching between the two decoding modes back and forth effectively breaks dominant trapping sets of various known types of regular and irregular LDPC codes.
In a recent article, a technique was proposed to step up the majority logic decoding of variation set low density parity check codes. This is helpful as majority logic decoding can be implemented serially with trouble-free hardware but requires a huge decoding time. The method detect whether a word has errors in the initial iterations of majority logic decoding, and at what time there are no errors the decoding split ends without completing the rest of the iterations. While the majority words in a memory will be error-free, the average decoding time is significantly reduced. The outcome obtained proves that the technique is also effective for EG-LDPC codes. General simulation results are given to precisely estimate the prospect of error detection for different code sizes and numbers of errors.
An efficient decoding algorithm for low-density parity-check (LDPC) codes on erasure channels with sporadic errors (i.e., binary error-and-erasure channels with error probability much smaller than the erasure probability) is proposed and its performance analyzed. A general single-error multiple-erasure (SEME) decoding algorithm is first described, which may be in principle used with any binary linear block code. The algorithm is optimum whenever the non-erased part of the received word is affected by at most one error, and is capable of performing error detection of multiple errors. An upper bound on the average block error probability under SEME decoding is derived for the linear random code ensemble. The bound is tight and easy to implement. The algorithm is then adapted to LDPC codes, resulting in a simple modification to a previously proposed efficient maximum likelihood LDPC erasure decoder which exploits the parity-check matrix sparseness. Numerical results reveal that LDPC codes under efficient SEME decoding can closely approach the average performance of random codes.
Low Density Parity Check (LDPC) codes are considered to be one of the best classes of error-correcting codes. This thesis deals with two major issues in LDPC codes: decoder design to enhance error correction performance and efficient decoder implementation. Five techniques have been introduced in this thesis. First, an efficient platform for LDPC code design and performance evaluation is developed. This platform implements parallel simulation algorithms to efficiently evaluate the performance of the proposed algorithms for LDPC decoders and code design. Second, an innovative technique is introduced to improve the performance of LDPC decoding in the error-floor region. Special structures in the code graph, called trapping sets, are considered to be the major source of decoding errors in the error-floor region. The proposed technique is based on eliminating the negative effect of trapping sets during LDPC decoding. As a third contribution, a novel approach to improve the decoder performance and/or throughput is introduced. This approach is based on utilizing LDPC decoder idle times by introducing two queues: one at the decoder input and the other at the decoder output. This architecture enables the decoder to run extra iterations beyond the conventional maximum allowable iterations. The fourth proposed technique reduces the bit error rate of LDPC decoders. This technique is based on tracking the number of failed parity check equations in the intermediate decoding iterations, rather than only relying on the final decoder output (after reaching the maximum number of iterations). The last proposed technique deals with the construction of interconnect efficient fully-parallel LDPC codes with high error correction performance. Fully-parallel implementation is very hard due to the complexity of processing elements interconnections. The proposed technique is based on constructing LDPC codes with less complex interconnections and with low impact on the error correction performance. This goal is achieved by putting a constraint on the maximum connection length between any two processing elements.
A two-stage decoding algorithm to lower the error-floor for low-density parity-check (LDPC) codes is presented. An efficient stopping criterion is proposed to avoid unnecessary iterations in the first stage. If the stopping criterion is reached, the first stage decoding will be terminated and the second stage decoding will be started, where the unsuccessfully decoded words are re-decoded by manipulating the log-likelihood ratio (LLR) of two types of specifically selected variable nodes. Simulation results show that the proposed algorithm can effectively lower the error floor of LDPC codes while maintaining a low decoding complexity.
Low-density parity-check (LDPC) codes have become a standard in modern communication systems thanks to their near-optimal error correction performance, which approaches Shannon's channel capacity as block length increases. However, in scenarios requiring short block lengths with low undetected frame error rate (UFER)-such as command and control data transmission in satellite communications-using only iterative decoders fails to achieve a balance between undetected and total frame error rates (FERs). This thesis addresses these challenges by investigating post-decoding error detection methods that enhance iterative LDPC decoding to achieve target FERs for both total and undetected errors. Specifically, we work with (128, 64) LDPC codes and explore two novel post-decoding techniques: bounded angle iterative decoding and single bit flip (SBF) list decoding, a variation of SBF decoding. These methods are applied to the iterative LDPC decoder output to manage the trade-off between total and undetected FERs effectively. Our results demonstrate that bounded angle iterative decoding effectively reduces UFER in codes with a large minimum distance with maintaining an acceptable increase in total frame error rate (TFER). Meanwhile, SBF list decoding mitigates the UFER increase introduced by standard SBF decoding, while retaining the significant TFER improvement that SBF decoding offers.