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

Asilomar Conference on Signals, Systems and Computers (ACSSC)

Efficient early stopping method for LDPC decoding based on check-node messages

Zhaohui Cai, Jianzhong Hao, Ubolthip Sethakaset

Published Oct 1, 2008• 2 citations
Publisher

Abstract

An efficient early stopping method is proposed in this paper to reduce the average number of iterations for low density parity check (LDPC) decoders. The method is very efficient especially when the channel signal-to-noise ratio (SNR) is low. It is based on the estimation of the log-likelihood ratio (LLR) messages of the check nodes.
DOI
10.1109/acssc.2008.5074448

Related papers

An efficient early stopping scheme for LDPC decoding based on check-node messages

Zhaohui Cai, Jianzhong Hao, Lin Wang

An efficient early stopping method is proposed in this paper to reduce the average number of iterations for low density parity check (LDPC) decoders. The method is very efficient especially when the channel signal-to-noise ratio (SNR) is low. It is based on the estimation of the log-likelihood ratio (LLR) messages of the check nodes.

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

Early stopping for LDPC decoding: convergence of mean magnitude (CMM)

Jin Li, Xiaohu You, Jing Li

A new early stopping criterion is proposed for low density parity check (LDPC) codes to reduce the number of decoding iterations while preserving a good decoding performance. The new criterion is based on the convergence of the mean magnitude (CMM) of the log-likelihood ratio messages at the output of each decoding iteration. Information-theoretic support and extensive simulations are provided to demonstrate the efficiency of the criterion

IEEE Communications Letters•Sep 1, 2006•67 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

A Channel-Adaptive Early Termination strategy for LDPC decoders

Yu-Hsin Chen, Yi‐Ju Chen, Xin-Yu Shih +1 more

In this paper, we propose a new Channel-Adaptive Early Termination (CAET) strategy to early stop Low-Density Parity-Check (LDPC) decoders. Our method checks the sign-changing rate of the log-likelihood ratios, and is able to perform the early termination under all SNR ranges with simple methodology. The average decoding latency can be decreased from the preset number of 8 to 6.73 iterations with negligible performance degradation. In addition, we create the BER Performance Loss Ratio (BPLR) index to evaluate the performance loss of different ET criteria. Compared to the hard-decision-aided criterion, our CAET strategy reduces the decoding iterations effectively and improves the BPLR by 76.6%.

SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems•Oct 1, 2009•13 citations

A hybrid low complexity decoding of LDPC codes

Hua Wang, Guangrong Fan, Jingming Kuang

An efficient early stopping criterion based on the evolution of the number of reliable variable nodes (NRVN) is proposed for low density parity check (LDPC) codes in this paper. This criterion can significantly reduce the average number of iterations (ANI) at low to middle signal to noise ratios (SNRs) with minimal performance degradation. Furthermore, a hybrid decoding method is presented to reduce the decoding complexity of LDPC codes by combining the proposed stopping criterion and forced convergence (FC) decoding algorithm. Compared with the classic belief propagation (BP) decoding, significant computation complexity reduction can be achieved with small computation overhead.

IET International Conference on Wireless, Mobile and Multimedia Networks (ICWMMN)•Jan 1, 2010•1 citation

Efficient Difference-based Decoding Implementations of LDPC Codes

Zhanji Wu, Peng Mugen, Wang Wenbo +1 more

Efficient implementations of the sum-product algorithm (SPA) for decoding low-density parity-check (LDPC) codes using difference-based messages between bit nodes and check nodes are presented. As for the updates of check nodes, reduced- complexity derivatives are also put forward. As compared with the traditional Log-Likelihood-Ratio(LLR)-based decoding implementations, the proposed method has much lower complexity and latency, while it has no obvious loss of the error performance.

IEEE Communications Letters•May 1, 2008•3 citations
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.
In this paper, we propose a new Channel-Adaptive Early Termination (CAET) strategy to early stop Low-Density Parity-Check (LDPC) decoders. Our method checks the sign-changing rate of the log-likelihood ratios, and is able to perform the early termination under all SNR ranges with simple methodology. The average decoding latency can be decreased from the preset number of 8 to 6.73 iterations with negligible performance degradation. In addition, we create the BER Performance Loss Ratio (BPLR) index to evaluate the performance loss of different ET criteria. Compared to the hard-decision-aided criterion, our CAET strategy reduces the decoding iterations effectively and improves the BPLR by 76.6%.
An efficient early stopping criterion based on the evolution of the number of reliable variable nodes (NRVN) is proposed for low density parity check (LDPC) codes in this paper. This criterion can significantly reduce the average number of iterations (ANI) at low to middle signal to noise ratios (SNRs) with minimal performance degradation. Furthermore, a hybrid decoding method is presented to reduce the decoding complexity of LDPC codes by combining the proposed stopping criterion and forced convergence (FC) decoding algorithm. Compared with the classic belief propagation (BP) decoding, significant computation complexity reduction can be achieved with small computation overhead.