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 Wireless Communications and Networking Conference

Stopping Criterion for LDPC Decoder based on PEXIT Chart Analysis

Taehyun Kim, Joosung Park, Jun Heo

Published May 1, 2020• 2 citations
Publisher

Abstract

In this paper, an early stopping scheme is proposed for low-density parity-check (LDPC) decoders. The proposed scheme predicts that the LDPC decoder will not be able to correct errors and then stops the iterative decoding process before reaching the maximum number of iterations. When the number of parity checks unsatisfied at both the l-th and the (l-T)-th decoding iterations is larger than a threshold, the decoder with the proposed scheme predicts that the decoding of the codeword is failed at the last iteration. Protograph-based extrinsic information transfer (PEXIT) chart analysis is used to determine the threshold. Simulation results show that the LDPC decoder can correct errors with the lower average number of iterations by using both the conventional syndrome test and proposed scheme.

DOI
10.1109/wcnc45663.2020.9120774

Related papers

Design of Protograph-Based LDPC Codes with Limited Decoding Complexity

Chengjun Tang, Ming Jiang, Chunming Zhao +1 more

In this letter, we present a design method to find good protograph-based low-density parity-check codes with the numbers of nonzero elements in the parity-check matrix and decoding iterations both strictly limited. We utilize the protograph-based extrinsic information transfer (PEXIT) analysis to evaluate the error performance and employ the differential evolution algorithm to devise a well-performed coding scheme. In particular, the number of iterations in the PEXIT analysis is set to a small value due to the limited iterations in the decoding process. Both numerical analyses and simulations verify that the resulting codes exhibit better performance than conventional code designs under the limitation of decoding complexity.

IEEE Communications Letters•Sep 29, 2017•17 citations

An efficient early stopping analog decoder for LDPC codes

Yuan Gao, Yujie Lin, Bowen Zeng +2 more

The analog implementation of error control decoders is a competitive methodology compared with the digital implementation in power efficiency and throughput. In order to detect uncorrectable frames and early stop the iterative decoding of low-density parity check (LDPC) analog decoders, a probability stopping block using probabilities of satisfied checks is proposed. Simulation results show that the proposed criterion can greatly reduce the average number of iterations at low SNR, and has better tradeoff between complexity and performance than other stopping criteria using extrinsic information.

International Conference on Computer Science and Network Technology (ICCSNT)•Dec 1, 2015•1 citation

Logistic Regression for LDPC Decoding Failure Prediction

Taehyun Kim, Joosung Park

In this paper, we propose a regression analysis for the early stopping of low-density parity-check (LDPC) decoder to reduce computational complexity and decoding latency. The proposed scheme predicts the decoding failure of the LDPC decoder using logistic regression. The data sets for the decodability classification consist of the index of iteration and the number of unsatisfied parity checks. Simulation results show that with the proposed scheme, the average number of iterations of the LDPC decoder can be significantly reduced without performance loss. In addition, since the proposed scheme determines the decoding failure based on the instantaneous value, it has advantages in terms of memory and computational complexity compared to the early stopping schemes based on the changes in parameters.

IEEE Consumer Communications and Networking Conference•Jan 9, 2021•3 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

An early stopping criterion for LDPC decoding based on average weighted reliability measure

Tso-Cho Chen

An early stopping criterion for low-density parity-check decoding is proposed to reduce the number of decoding iterations. The proposed early stopping criterion is based on the average weighted reliability measure of the hard output of decoder to detect undecodable blocks in an early stage of the decoding process. Simulation results show that the proposed algorithm can achieve about 0.2–0.4 dB coding gain improvement on average while reducing up to about 50%–85% iteration for decoding at low to medium Eb/N0, compared with the existing method.

Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC)•Jul 1, 2012•2 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
In this paper, an early stopping scheme is proposed for low-density parity-check (LDPC) decoders. The proposed scheme predicts that the LDPC decoder will not be able to correct errors and then stops the iterative decoding process before reaching the maximum number of iterations. When the number of parity checks unsatisfied at both the l-th and the (l-T)-th decoding iterations is larger than a threshold, the decoder with the proposed scheme predicts that the decoding of the codeword is failed at the last iteration. Protograph-based extrinsic information transfer (PEXIT) chart analysis is used to determine the threshold. Simulation results show that the LDPC decoder can correct errors with the lower average number of iterations by using both the conventional syndrome test and proposed scheme.
In this letter, we present a design method to find good protograph-based low-density parity-check codes with the numbers of nonzero elements in the parity-check matrix and decoding iterations both strictly limited. We utilize the protograph-based extrinsic information transfer (PEXIT) analysis to evaluate the error performance and employ the differential evolution algorithm to devise a well-performed coding scheme. In particular, the number of iterations in the PEXIT analysis is set to a small value due to the limited iterations in the decoding process. Both numerical analyses and simulations verify that the resulting codes exhibit better performance than conventional code designs under the limitation of decoding complexity.
The analog implementation of error control decoders is a competitive methodology compared with the digital implementation in power efficiency and throughput. In order to detect uncorrectable frames and early stop the iterative decoding of low-density parity check (LDPC) analog decoders, a probability stopping block using probabilities of satisfied checks is proposed. Simulation results show that the proposed criterion can greatly reduce the average number of iterations at low SNR, and has better tradeoff between complexity and performance than other stopping criteria using extrinsic information.
In this paper, we propose a regression analysis for the early stopping of low-density parity-check (LDPC) decoder to reduce computational complexity and decoding latency. The proposed scheme predicts the decoding failure of the LDPC decoder using logistic regression. The data sets for the decodability classification consist of the index of iteration and the number of unsatisfied parity checks. Simulation results show that with the proposed scheme, the average number of iterations of the LDPC decoder can be significantly reduced without performance loss. In addition, since the proposed scheme determines the decoding failure based on the instantaneous value, it has advantages in terms of memory and computational complexity compared to the early stopping schemes based on the changes in parameters.
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.
An early stopping criterion for low-density parity-check decoding is proposed to reduce the number of decoding iterations. The proposed early stopping criterion is based on the average weighted reliability measure of the hard output of decoder to detect undecodable blocks in an early stage of the decoding process. Simulation results show that the proposed algorithm can achieve about 0.2–0.4 dB coding gain improvement on average while reducing up to about 50%–85% iteration for decoding at low to medium Eb/N0, compared with the existing method.
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.