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

Journal of Communications

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

Xiaohu You

Published Jan 1, 2006• 1 citation
OpenAlex

Abstract

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.

Related papers

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

Xu Xiaojian, Li Jin, Hanying Hu

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.

International Conference on Wireless and Mobile Communications•Jul 1, 2006•0 citations

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

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

Low complexity decoding algorithm of parallel concatenated LDPC code

Jin Li, Xiaohu You, Yun Hee Kim

PCGC (parallel concatenated Gallager code) is a new class of concatenated codes based on component LDPC codes. The decoder of it uses modified BP (belief propagation) algorithm in component LDPC decoder. But this conventional decoding algorithm has high complexity and is not suitable for implementation in hardware. So in this paper we propose a new decoding algorithm of PCGC, which has good performance and low complexity. And it is feasible to be implemented in hardware.

IEEE Circuits and Systems Symposium on Emerging Technologies•Nov 12, 2004•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

Research on stopping criterion for irregular LDPC codes decoding

Changhao Zhai, Chengxin Xu, Xin Zhang +1 more

In this paper, an improved stopping criterion for irregular LDPC decoding is proposed. This scheme considers the decoding property of irregular LDPC codes. When the lowest degree variable nodes reach stable state, the decoder gets the final decoding result. Therefore, the improved criterion is based on the convergence of the mean magnitude of the log-likelihood ratio (LLR) information of the lowest degree variable nodes at the output of each decoding iteration. Compared with existing schemes, this scheme decreases average number of iterations (ANI) and reduces computation complexity under slight performance degradation.

International Wireless Communications and Mobile Computing Conference (IWCMC)•Jun 21, 2009•0 citations
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.
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.
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.
In this paper, an improved stopping criterion for irregular LDPC decoding is proposed. This scheme considers the decoding property of irregular LDPC codes. When the lowest degree variable nodes reach stable state, the decoder gets the final decoding result. Therefore, the improved criterion is based on the convergence of the mean magnitude of the log-likelihood ratio (LLR) information of the lowest degree variable nodes at the output of each decoding iteration. Compared with existing schemes, this scheme decreases average number of iterations (ANI) and reduces computation complexity under slight performance degradation.