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

LETTER A Stopping Criterion for Low-Density Parity-Check Codes ∗

Donghyuk Shin, Kyoungwoo Heo, Hyuckjae Lee

Published Jan 1, 2008• 0 citations
OpenAlex

Abstract

SUMMARY We propose a new stopping criterion for decoding LDPC codes which consists of a measure of decoder behaviors and a decision rule to predict decoding failure. We will show that the proposed measure, the number of satisfied check nodes, does not need (or minimizes) additional complexity, and the decision rule is efficient and more importantly channel independent, which was not possible in the previous work.

Related papers

A Stopping Criterion for Low-Density Parity-Check Codes

D. SHIN, J. HA, Kyoungwoo Heo +1 more

We propose a new stopping criterion for decoding LDPC codes which consists of a measure of decoder behaviors and a decision rule to predict decoding failure. We will show that the proposed measure, the number of satisfied check nodes, does not need (or minimizes) additional complexity, and the decision rule is efficient and more importantly channel independent, which was not possible in the previous work.

IEICE Transactions on Communications•Apr 1, 2008•10 citations

A Stopping Criterion for Low-Density Parity-Check Codes

Donghyuk Shin, Kyoungwoo Heo, Sang-Bong Oh +1 more

Low-density parity-check (LDPC) codes have an inherent stopping criterion, parity-check constraints (equations). By testing the parity-check constraints, an LDPC decoder can detect successful decoding and stop their decoding, which is, however, not possible with turbo codes. In this paper, we propose a stopping criterion to predict decoding failure of LDPC codes, instead of detecting successful decoding. If the decoder predicts the decoding failure in advance, the receiver can more rapidly response to the transmitter and request for additional parity bits with an automatic repeat request (ARQ) protocol, which reduces overall system latency. The receiver can also save power consumption by avoiding unnecessary decoder iterations. The proposed stopping criterion makes use of the variations of the number of satisfied parity-check constraints in the belief-propagation (BP) decoding which is always tested in the conventional BP decoding to detect successful decoding. Thus, the proposed stopping criterion does not require any additional complexity. The counting of satisfied parity-check constraints shows behaviors of the BP decoding, which comes, otherwise, from the observations of changes of log-likelihood ratio (LLR) values in multi-bit resolution with additional complexity.

IEEE Vehicular Technology Conference•Apr 1, 2007•33 citations

A stopping criterion for nonbinary LDPC codes over GF(q)

Xin Chen, Aidong Men, Wei Zhou

Nonbinary low-density parity-check (LDPC) codes over finite fields GF(q) have a better performance than those of the binary low-density parity-check codes, at short and medium block lengths, but the decoder of GF(q)-LDPC has more complexity. In this paper, a new stopping criterion is proposed. Based on the changes of the variance of variable node¿s extrinsic information, the criterion can predict a decoding failure and decide whether the iteration of the decoder should be stopped. The simulation results show that the stopping criterion can greatly reduces the average number of required iterations of GF(q)-LDPC decoder with negligible performance loss.

IEEE International Conference on Communication Systems (ICCS)•Nov 1, 2008•4 citations

A new stopping criterion for fast low-density parity-check decoders

Tian Xia, Hsiao‐Chun Wu, Scott C-H Huang

Nonbiliary low-density parity-check (LDPC) codes can lead to excellent error performance while the codewords are of short or moderate length. However, the high decoding complexity of nonbiliary LDPC codes inevitably depreciates their practical values. The computational bottleneck arises from the check node processing in the iterative message passing (MP) algorithms which terminate when either all parity checks are satisfied or the maximum iteration number is reached. We have observed that for undecodable blocks, the MP algorithms always run up to the maximum iteration limit and therefore cannot generate the correct codeword. Thus, it would be better to terminate the algorithms early so as to save the unnecessary computational time and reduce the extra power consumption when undecodable blocks are experienced. In this paper, we propose a new T-tolerance stopping criterion for LDPC decoders by exploiting the fact that the total a posteriori probability (APP) should increase as the iteration number grows. Simulation results demonstrate that our proposed new T-tolerance criterion can greatly reduce the average iteration number (complexity) while restricting the decoding performance degradation within 0.1 dB in low bit-energy-to-noise ratio scenarios.

Globecom•Dec 1, 2013•6 citations

Low Complexity Stopping Criterion for LDPC Code Decoders

Frank Kienle, Norbert Wehn

Low density parity check (LDPC) codes are amongst the most powerful codes known today. They are decoded iteratively by a message-passing algorithm. For this, an inherent stopping criterion exists for decodable blocks based on parity checks. For undecodable blocks, typically, a fixed number of iterations are carried out before the decoding procedure is terminated, which is a waste of energy and time. We present a stopping criterion which detects undecodable blocks in an early stage of the decoding process. The novel stopping criterion works for floating and fixed point implementations. It greatly reduces the average number of required iterations without any loss in communication performance.

IEEE Vehicular Technology Conference•Dec 10, 2005•67 citations

New Stopping Criterion for Fast Low-Density Parity-Check Decoders

Tian Xia, Hsiao‐Chun Wu, Hong Jiang

Low-density parity-check (LDPC) codes are favorable in low bit-error-rate and high code-rate applications. However, the decoding complexity for LDPC codes is quite large, especially for nonbinary LDPC codes. In this paper, we propose a new T-tolerance stopping criterion for LDPC decoders by exploiting the fact that the total aposteriori probability (APP) should increase across iterations when message passing (MP) algorithms are employed. Simulation results demonstrate that our proposed new T-tolerance criterion can greatly reduce the average iteration number (complexity) while the decoding performance degradation is controlled within 0.1 dB in the low bit-energy-to-noise-spectral-density ratio (Eb/N0) scenarios.

IEEE Communications Letters•Aug 21, 2014•15 citations
SUMMARY We propose a new stopping criterion for decoding LDPC codes which consists of a measure of decoder behaviors and a decision rule to predict decoding failure. We will show that the proposed measure, the number of satisfied check nodes, does not need (or minimizes) additional complexity, and the decision rule is efficient and more importantly channel independent, which was not possible in the previous work.
Low-density parity-check (LDPC) codes have an inherent stopping criterion, parity-check constraints (equations). By testing the parity-check constraints, an LDPC decoder can detect successful decoding and stop their decoding, which is, however, not possible with turbo codes. In this paper, we propose a stopping criterion to predict decoding failure of LDPC codes, instead of detecting successful decoding. If the decoder predicts the decoding failure in advance, the receiver can more rapidly response to the transmitter and request for additional parity bits with an automatic repeat request (ARQ) protocol, which reduces overall system latency. The receiver can also save power consumption by avoiding unnecessary decoder iterations. The proposed stopping criterion makes use of the variations of the number of satisfied parity-check constraints in the belief-propagation (BP) decoding which is always tested in the conventional BP decoding to detect successful decoding. Thus, the proposed stopping criterion does not require any additional complexity. The counting of satisfied parity-check constraints shows behaviors of the BP decoding, which comes, otherwise, from the observations of changes of log-likelihood ratio (LLR) values in multi-bit resolution with additional complexity.
Nonbinary low-density parity-check (LDPC) codes over finite fields GF(q) have a better performance than those of the binary low-density parity-check codes, at short and medium block lengths, but the decoder of GF(q)-LDPC has more complexity. In this paper, a new stopping criterion is proposed. Based on the changes of the variance of variable node¿s extrinsic information, the criterion can predict a decoding failure and decide whether the iteration of the decoder should be stopped. The simulation results show that the stopping criterion can greatly reduces the average number of required iterations of GF(q)-LDPC decoder with negligible performance loss.
Nonbiliary low-density parity-check (LDPC) codes can lead to excellent error performance while the codewords are of short or moderate length. However, the high decoding complexity of nonbiliary LDPC codes inevitably depreciates their practical values. The computational bottleneck arises from the check node processing in the iterative message passing (MP) algorithms which terminate when either all parity checks are satisfied or the maximum iteration number is reached. We have observed that for undecodable blocks, the MP algorithms always run up to the maximum iteration limit and therefore cannot generate the correct codeword. Thus, it would be better to terminate the algorithms early so as to save the unnecessary computational time and reduce the extra power consumption when undecodable blocks are experienced. In this paper, we propose a new T-tolerance stopping criterion for LDPC decoders by exploiting the fact that the total a posteriori probability (APP) should increase as the iteration number grows. Simulation results demonstrate that our proposed new T-tolerance criterion can greatly reduce the average iteration number (complexity) while restricting the decoding performance degradation within 0.1 dB in low bit-energy-to-noise ratio scenarios.
Low density parity check (LDPC) codes are amongst the most powerful codes known today. They are decoded iteratively by a message-passing algorithm. For this, an inherent stopping criterion exists for decodable blocks based on parity checks. For undecodable blocks, typically, a fixed number of iterations are carried out before the decoding procedure is terminated, which is a waste of energy and time. We present a stopping criterion which detects undecodable blocks in an early stage of the decoding process. The novel stopping criterion works for floating and fixed point implementations. It greatly reduces the average number of required iterations without any loss in communication performance.
Low-density parity-check (LDPC) codes are favorable in low bit-error-rate and high code-rate applications. However, the decoding complexity for LDPC codes is quite large, especially for nonbinary LDPC codes. In this paper, we propose a new T-tolerance stopping criterion for LDPC decoders by exploiting the fact that the total aposteriori probability (APP) should increase across iterations when message passing (MP) algorithms are employed. Simulation results demonstrate that our proposed new T-tolerance criterion can greatly reduce the average iteration number (complexity) while the decoding performance degradation is controlled within 0.1 dB in the low bit-energy-to-noise-spectral-density ratio (Eb/N0) scenarios.