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 International Conference on Communication Problem-Solving

An improved-performance decoding algorithm of LDPC codes for layered decoding

Jia Li, Gaigai Yang, Zhiqiang Zhao

Published Dec 1, 2014• 1 citation
Publisher

Abstract

In order to reduce the bit error rate of low-density parity-check codes for layered decoding algorithm and improve the decoding convergence speed, an improved layered decoding algorithm is proposed. In layered decoding algorithm, updated bit nodes information can be used by check nodes in the iteration process while in dynamic decoding algorithm check nodes update in order according to the reliability. The proposed algorithm combines advantages of the layered and dynamic decoding algorithm. Moreover, compared with the definition of remaining information for check nodes in the dynamic decoding algorithm, a new method to evaluate the reliability is defined in the proposed algorithm. Based on 1/2 code rate china mobile multimedia broadcasting standard, simulation and comparison between the conventional layered decoding algorithm and the proposed layered decoding algorithm have been carried out. The simulation results show that under the same bit error rate, the signal to noise ratio of the improved algorithm reduces nearly 0.4dB as well as convergence speed improves obviously. The proposed layered decoding algorithm reduces the bit error rate and improves the reliability of data in communication system which uses LDPC codes as the channel coding.

DOI
10.1109/iccps.2014.7062283

Related papers

Improved Algorithm Based on Confidence Propagation Decoding Algorithm

Xiuyang Li, Yanfeng Tang, Cheng Zhang +1 more

Low-density parity-check codes(LDPC) have the advantages of high performance, flexibility, parallelized processing and iterative decoding, which make them one of the widely used error correction code schemes in communication and storage systems. In order to improve the decoding convergence speed of low-density parity-check codes, the idea of layered decoding is added to the log-likelihood ratio confidence propagation decoding algorithm, and an improved algorithm based on layered decoding strategy is proposed, which solves the problem of low decoding rate caused by vertical iteration after the completion of horizontal iteration by using the log-likelihood ratio confidence propagation decoding algorithm in each layer, at the same time. The results show that the average decoding rate of the algorithm is improved by about 25.5% compared with that before the improvement without losing or almost losing the error correction performance, and the performance of the improved layered decoding algorithm with log-likelihood ratio confidence propagation decoding is optimal when the signal-to-noise ratio is greater than 4, and the decoding performance is improved.

International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT)•Jun 16, 2023•0 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

Improved Layered Minimum Sum Decoding Algorithm Based on Overestimation

Liu Yu, Lin Bai, Yaohui Hao

Quasi-cyclic low-density parity-check (QC-LDPC) codes are linear block codes with performance close to the Shannon limit. The layered minimum sum (LMS) decoding algorithm speeds up the decoding convergence by layering the check matrix and updating the nodes according to the layers. However, the MS algorithm has the problem of over estimation and affects the decoding performance due to its simplified strategy of MS algorithm updating the message of check nodes. Therefore, this paper proposes a layered minimum sum decoding algorithm based on overestimation. By setting the correction threshold and updating the check nodes by the conditions, the decoding performance is improved. When the code length is 2048 and the bit error rate is , the proposed algorithm can improve the decoding convergence speed by about 25% and obtain a coding gain of about 0.1 dB.

•Sep 23, 2022•0 citations

Improved Extended Min-Sum Algorithm for Non-Binary LDPC Codes Based on Node Reliability

Yibing Li, Sitong Zhang, Fang Ye +3 more

Low Density Parity Check (LDPC) codes have been widely applied in recent years, and Extended Min-Sum (EMS) decoding algorithm is the most practical algorithm, which has a fairly low computational cost. Due to the great loss in error correction performance of EMS algorithm, in this paper, we establish constraints to obtain reliable nodes while decoding and evaluate the reliability of the nodes. The nodes and information transferred between nodes are processed and optimized according to the reliability of the nodes. High reliability nodes will not be updated in the decoding process while the information of the sub-reliability nodes will be optimized in different situations, thereby improving the decoding accuracy. This algorithm can accelerate the convergence of the algorithm, while the reduced number of update nodes can control the increase of the computation to a certain extent, and maintain the advantage of the low computation quantity of EMS algorithm. Through simulation results and computational analysis, we prove that the improved algorithm has significantly improved error correction performance compared with the traditional EMS algorithm. Under the same conditions, it has completely entered the waterfall area at 3.6dB, and the EMS algorithm has not entered the waterfall area. By comparing the average iteration times of decoding of the two algorithms, the convergence speed of the algorithm can be reflected. Compared with EMS algorithm, the improved algorithm has significantly improved the convergence speed in most areas, which indicates that the processing of sub-reliable nodes accelerates the convergence of the algorithm. Finally, the average update times of the check nodes and variable nodes of the two algorithms are compared respectively. Although the improved algorithm introduces extra processing flow, it speeds up the convergence of the algorithm, and the computational cost of decoding is less expensive.

IEEE-APS Topical Conference on Antennas and Propagation in Wireless Communications (APWC)•Sep 1, 2019•0 citations

Optimized decoding schedule for irregular LDPC codes

Xuwei Chen, Hui Ling Yu, Youyun Xu

Recently, the concept of layered decoding schedule for Low-Density Parity-Check codes has been introduced. But the advantage of layered decoding schedule for irregular LDPC codes is not as obvious as regular LDPC codes. The major drawback of the layered irregular LDPC codes versus the layered regular LDPC codes is its comparative low convergence decoding speed. Simulation results show that different bit node degrees of irregular LDPC codes significantly contribute to the decoding performance. The decoding performance of bit nodes with different degrees is of great difference. Bit nodes with small degrees always converge slower than larger ones. In this paper, we propose an optimized decoding schedule for irregular LDPC codes to accelerate the decoding convergence rate. Meanwhile, for the irregular LDPC decoder, the faster decoding speed means a higher throughput and almost the same error performance.

IET International Communication Conference on Wireless Mobile and Computing (CCWMC)•Jan 1, 2009•2 citations

Improved layered min-sum decoding algorithm for low density parity check codes

Jin Xie, Liuguo Yin, Ning Ge +1 more

In this paper, an improved layered min-sum (ILMS) algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. The proposed method speeds up the decoding by slightly amplifying the message update from check node to variable node. Simulations and analytical results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce the number of iterations by 8.4%-62.6%, with hardware increase less than 2%.

•May 20, 2009•1 citation
In order to reduce the bit error rate of low-density parity-check codes for layered decoding algorithm and improve the decoding convergence speed, an improved layered decoding algorithm is proposed. In layered decoding algorithm, updated bit nodes information can be used by check nodes in the iteration process while in dynamic decoding algorithm check nodes update in order according to the reliability. The proposed algorithm combines advantages of the layered and dynamic decoding algorithm. Moreover, compared with the definition of remaining information for check nodes in the dynamic decoding algorithm, a new method to evaluate the reliability is defined in the proposed algorithm. Based on 1/2 code rate china mobile multimedia broadcasting standard, simulation and comparison between the conventional layered decoding algorithm and the proposed layered decoding algorithm have been carried out. The simulation results show that under the same bit error rate, the signal to noise ratio of the improved algorithm reduces nearly 0.4dB as well as convergence speed improves obviously. The proposed layered decoding algorithm reduces the bit error rate and improves the reliability of data in communication system which uses LDPC codes as the channel coding.
Low-density parity-check codes(LDPC) have the advantages of high performance, flexibility, parallelized processing and iterative decoding, which make them one of the widely used error correction code schemes in communication and storage systems. In order to improve the decoding convergence speed of low-density parity-check codes, the idea of layered decoding is added to the log-likelihood ratio confidence propagation decoding algorithm, and an improved algorithm based on layered decoding strategy is proposed, which solves the problem of low decoding rate caused by vertical iteration after the completion of horizontal iteration by using the log-likelihood ratio confidence propagation decoding algorithm in each layer, at the same time. The results show that the average decoding rate of the algorithm is improved by about 25.5% compared with that before the improvement without losing or almost losing the error correction performance, and the performance of the improved layered decoding algorithm with log-likelihood ratio confidence propagation decoding is optimal when the signal-to-noise ratio is greater than 4, and the decoding performance is improved.
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
Quasi-cyclic low-density parity-check (QC-LDPC) codes are linear block codes with performance close to the Shannon limit. The layered minimum sum (LMS) decoding algorithm speeds up the decoding convergence by layering the check matrix and updating the nodes according to the layers. However, the MS algorithm has the problem of over estimation and affects the decoding performance due to its simplified strategy of MS algorithm updating the message of check nodes. Therefore, this paper proposes a layered minimum sum decoding algorithm based on overestimation. By setting the correction threshold and updating the check nodes by the conditions, the decoding performance is improved. When the code length is 2048 and the bit error rate is , the proposed algorithm can improve the decoding convergence speed by about 25% and obtain a coding gain of about 0.1 dB.
Low Density Parity Check (LDPC) codes have been widely applied in recent years, and Extended Min-Sum (EMS) decoding algorithm is the most practical algorithm, which has a fairly low computational cost. Due to the great loss in error correction performance of EMS algorithm, in this paper, we establish constraints to obtain reliable nodes while decoding and evaluate the reliability of the nodes. The nodes and information transferred between nodes are processed and optimized according to the reliability of the nodes. High reliability nodes will not be updated in the decoding process while the information of the sub-reliability nodes will be optimized in different situations, thereby improving the decoding accuracy. This algorithm can accelerate the convergence of the algorithm, while the reduced number of update nodes can control the increase of the computation to a certain extent, and maintain the advantage of the low computation quantity of EMS algorithm. Through simulation results and computational analysis, we prove that the improved algorithm has significantly improved error correction performance compared with the traditional EMS algorithm. Under the same conditions, it has completely entered the waterfall area at 3.6dB, and the EMS algorithm has not entered the waterfall area. By comparing the average iteration times of decoding of the two algorithms, the convergence speed of the algorithm can be reflected. Compared with EMS algorithm, the improved algorithm has significantly improved the convergence speed in most areas, which indicates that the processing of sub-reliable nodes accelerates the convergence of the algorithm. Finally, the average update times of the check nodes and variable nodes of the two algorithms are compared respectively. Although the improved algorithm introduces extra processing flow, it speeds up the convergence of the algorithm, and the computational cost of decoding is less expensive.
Recently, the concept of layered decoding schedule for Low-Density Parity-Check codes has been introduced. But the advantage of layered decoding schedule for irregular LDPC codes is not as obvious as regular LDPC codes. The major drawback of the layered irregular LDPC codes versus the layered regular LDPC codes is its comparative low convergence decoding speed. Simulation results show that different bit node degrees of irregular LDPC codes significantly contribute to the decoding performance. The decoding performance of bit nodes with different degrees is of great difference. Bit nodes with small degrees always converge slower than larger ones. In this paper, we propose an optimized decoding schedule for irregular LDPC codes to accelerate the decoding convergence rate. Meanwhile, for the irregular LDPC decoder, the faster decoding speed means a higher throughput and almost the same error performance.