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

International Conference on Wireless and Mobile Communications

A low-complexity stopping criterion for the decoder of parallel concatenated LDPC codes

Xu Xiaojian, Li Jin, Hanying Hu

Published Jul 1, 2006• 0 citations
Publisher

Abstract

In this paper, we propose a novel stopping criteria that based on the mean of the magnitude of the extrinsic information in the iterative decoder of parallel concatenated LDPC (low- density parity-check) codes. The proposed criterion has low computation complexity and few storage requirements. Simulations results proved that the MEM (mean of extrinsic information magnitude) rules outperforms the other existing criterions in terms of BER and average number of super iterations.

DOI
10.1109/icwmc.2006.6

Related papers

A novel simple stopping criterion for the PCGC decoder

Xu Xiaojian, Li Jin, Hanying Hu

In this paper, in order to degrade the computation complexity and storage of the iterative decoder of parallel concatenated LDPC (low-density parity-check) codes, we propose a novel stopping criteria by using of the mean of the magnitude of the extrinsic information. We verify our algorithms with Monte Carlo simulation, and the results proved that the proposed rules outperforms the other existing criterions in terms of BER and average number of super iterations

International Conference on ITS Telecommunications•Jun 1, 2006•0 citations

Analysis of stop criterions in the decoder of parallel concatenated LDPC codes

Xiaohu You

To reduce the computation complexity of the decoder of parallel concatenated Gallager code, two kinds of low complexity stop criterion were proposed. The criterions decide whether the iteration of the decoder should be stopped based on the change of the variance of extrinsic information. The computer simulation results prove that the stop criteri-ons could reduce the computation complexity of the PCGC decoder with negligible performance loss.

Journal of Communications•Jan 1, 2006•1 citation

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

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

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

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
In this paper, we propose a novel stopping criteria that based on the mean of the magnitude of the extrinsic information in the iterative decoder of parallel concatenated LDPC (low- density parity-check) codes. The proposed criterion has low computation complexity and few storage requirements. Simulations results proved that the MEM (mean of extrinsic information magnitude) rules outperforms the other existing criterions in terms of BER and average number of super iterations.
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.
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.
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.