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

Advances in intelligent systems research/Advances in Intelligent Systems Research

A New Early Termination Strategy for QC-LDPC Codes Based on the Layered Message Passing Decoding

Zhejun Zhang, Guanghui He, Jun Ma

Published Jan 1, 2013• 1 citation
Publisher

Abstract

Low-density parity-check (LDPC) codes are one of the most popular linear block codes have ever been used in the communication system.The standard two-phase message passing decoding (TPMPD) algorithm and the layered message-passing decoding (LMPD) algorithm are widely used in LDPC decoder.However, the convergence speed of LMPD algorithm is much faster than that of TPMPD algorithm, particularly in the condition of high signal noise ratio (SNR).In this paper, we propose an early termination criterion for quasi-cyclic low-density parity-check (QC-LDPC) codes based on LMPD algorithm with fast convergence speed.The strategy is to dynamically reprocesses the uncorrected related layers while skipping the corrected ones.Simulations show that 3% reduction in terms of iteration numbers can be achieved with no performance loss compared to the traditional termination strategies, such as hard decision aided (HDA) strategy and parity check equations (PCE) strategy.Furthermore, the optimized early termination strategy achieves low complexity in hardware implementation.

DOI
10.2991/wiet-13.2013.39

Related papers

Modified layered message passing decoding with dynamic scheduling and early termination for QC-LDPC codes

Yeong-Luh Ueng, Yu-Lun Wang, Chi-Yu Lin +2 more

The convergence speed of layered message-passing decoding (LMPD) is faster than that of standard two phase message passing (TPMP) decoding. We propose to use dynamic scheduling and early termination to reduce computational complexity for a modified LMPD algorithm which was proposed for quasi-cyclic low-density parity-check (QC-LDPC) codes. We dynamically skip or redo the decoding operations for some layers based on appropriate criteria. An early termination strategy which is efficient in hardware implementation is also proposed in this paper. The modified MPD using these two techniques simultaneously can reduce the computational complexity with similar error performance as compared to the case of not using these two techniques.

IEEE International Symposium on Circuits and Systems proceedings•May 1, 2009•9 citations

Early Termination Scheme for 5G NR LDPC Code

Namil Kim, Jin-Up Kim

According to its excellent error recovery capability, Low Density Parity Check code has been adopted as a channel coding method for 5G NR data channels. This paper proposes a novel early termination scheme of the layered quasi-cyclic LDPC code decoder for a 5G NR data channel. In terms of early termination and error correction performance, the proposed scheme shows improved performance compared to the conventional scheme. Simulation results show that 18.7% reduction with regard to average iteration numbers can be achieved compared to the traditional termination schemes, such as syndrome check(SDC) and hard decision aid(HDS). Furthermore, the proposed scheme shows error correction performance improvement of 0.2dB.

International Conference on Information and Communication Technology Convergence (ICTC)•Oct 20, 2021•8 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

Fast convergence algorithm for decoding of low density parity check codes

Jin Xie, Liuguo Yin, Ning Ge +1 more

Abstract: In this paper, a fast-convergence algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. By putting more weight on the message update from check node to variable node in current iteration, the proposed method speeds up the decoding significantly. Simulation results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce about 1/6 iteration numbers for LDPC codes used in DVB-S2, with hardware complexity overhead less than 2%. Key–Words: LDPC code, fast convergence decoding algorithm, layered decoding, min-sum algorithm, hardware implementation 1

WSEAS TRANSACTIONS on COMMUNICATIONS archive•Jul 1, 2009•1 citation

A Low Complexity Decoding Algorithm Design Based on Quasi-Cyclic LDPC Codes

Cai Honghao, Yingkun Yang, Yi Qu

Entering the 5G era, the hardware design of low-density parity-check (LDPC) codes under the new standard has increasingly higher requirements on throughput. According to the geometric characteristics of the check matrices of the quasi-cyclicQC) LDCP codes under the CCSDS standard, this paper designs a layered dynamic normalized minimum sum algorithm(LDNMSA) under the pre-termination decoding based on de-layering scheme. The check matrix structure of this code is easy for hardware design and the storage resource consumption is low. The approximate replacement of the minimum sum algorithm(MSA) reduces the computational complexity of the check node update process. The determination of correction factors and inter-layer deletion thresholds through computer simulation improves the decoding performance and the speed of a single iteration, and adopt the layered scheduling scheme with optimized update order reduces the number of iterations required for decoding. Experimental results show that when the bit error rate(BER) is 10-5, the designed algorithm has a gain of approximately 0.5 dB compared to the MSA. The speed and calculation amounts to a single iteration are much lower than the log-likelihood-ratio(LLR) belief propagation(BP) algorithm and the performance is only less than 0.1dB.

International Conference on Computing, Electronics & Communications Engineering (iCCECE)•Aug 17, 2020•2 citations
Low-density parity-check (LDPC) codes are one of the most popular linear block codes have ever been used in the communication system.The standard two-phase message passing decoding (TPMPD) algorithm and the layered message-passing decoding (LMPD) algorithm are widely used in LDPC decoder.However, the convergence speed of LMPD algorithm is much faster than that of TPMPD algorithm, particularly in the condition of high signal noise ratio (SNR).In this paper, we propose an early termination criterion for quasi-cyclic low-density parity-check (QC-LDPC) codes based on LMPD algorithm with fast convergence speed.The strategy is to dynamically reprocesses the uncorrected related layers while skipping the corrected ones.Simulations show that 3% reduction in terms of iteration numbers can be achieved with no performance loss compared to the traditional termination strategies, such as hard decision aided (HDA) strategy and parity check equations (PCE) strategy.Furthermore, the optimized early termination strategy achieves low complexity in hardware implementation.
The convergence speed of layered message-passing decoding (LMPD) is faster than that of standard two phase message passing (TPMP) decoding. We propose to use dynamic scheduling and early termination to reduce computational complexity for a modified LMPD algorithm which was proposed for quasi-cyclic low-density parity-check (QC-LDPC) codes. We dynamically skip or redo the decoding operations for some layers based on appropriate criteria. An early termination strategy which is efficient in hardware implementation is also proposed in this paper. The modified MPD using these two techniques simultaneously can reduce the computational complexity with similar error performance as compared to the case of not using these two techniques.
According to its excellent error recovery capability, Low Density Parity Check code has been adopted as a channel coding method for 5G NR data channels. This paper proposes a novel early termination scheme of the layered quasi-cyclic LDPC code decoder for a 5G NR data channel. In terms of early termination and error correction performance, the proposed scheme shows improved performance compared to the conventional scheme. Simulation results show that 18.7% reduction with regard to average iteration numbers can be achieved compared to the traditional termination schemes, such as syndrome check(SDC) and hard decision aid(HDS). Furthermore, the proposed scheme shows error correction performance improvement of 0.2dB.
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.
Abstract: In this paper, a fast-convergence algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. By putting more weight on the message update from check node to variable node in current iteration, the proposed method speeds up the decoding significantly. Simulation results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce about 1/6 iteration numbers for LDPC codes used in DVB-S2, with hardware complexity overhead less than 2%. Key–Words: LDPC code, fast convergence decoding algorithm, layered decoding, min-sum algorithm, hardware implementation 1
Entering the 5G era, the hardware design of low-density parity-check (LDPC) codes under the new standard has increasingly higher requirements on throughput. According to the geometric characteristics of the check matrices of the quasi-cyclicQC) LDCP codes under the CCSDS standard, this paper designs a layered dynamic normalized minimum sum algorithm(LDNMSA) under the pre-termination decoding based on de-layering scheme. The check matrix structure of this code is easy for hardware design and the storage resource consumption is low. The approximate replacement of the minimum sum algorithm(MSA) reduces the computational complexity of the check node update process. The determination of correction factors and inter-layer deletion thresholds through computer simulation improves the decoding performance and the speed of a single iteration, and adopt the layered scheduling scheme with optimized update order reduces the number of iterations required for decoding. Experimental results show that when the bit error rate(BER) is 10-5, the designed algorithm has a gain of approximately 0.5 dB compared to the MSA. The speed and calculation amounts to a single iteration are much lower than the log-likelihood-ratio(LLR) belief propagation(BP) algorithm and the performance is only less than 0.1dB.