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

Conference proceedings - Canadian Conference on Electrical and Computer Engineering

Two Improved Algorithms for Layered QC-LDPC Decoding Algorithm

Xiao Zheng, Qingsheng Hu, Jun Feng

Published May 1, 2018• 4 citations
Publisher

Abstract

Low-Density Parity-Check code is a kind of near-optimal error correction code. In order to improve the performance of layered decoding algorithms, two algorithms are put forward in this paper. In the first algorithm, additional messages are employed for the messages updating operation of each layer by using another layered part, making it possible to accelerate the speed of convergence. In the second one, a correction operation for certain type of errors is performed to improve the decoding performance. Simulation results show that more decoding gain and accelerated convergence can be obtained compared with the conventional layered decoding algorithms.

DOI
10.1109/ccece.2018.8447564

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

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

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

Jia Li, Gaigai Yang, Zhiqiang Zhao

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.

IEEE International Conference on Communication Problem-Solving•Dec 1, 2014•1 citation

A Second Minimum Approximation Method for Layered Min-Sum Decoding of QC-LDPC Codes

Zijian Qin, Yangcan Zhou, Zhongfeng Wang

Low-density parity-check (LDPC) codes have attracted tremendous attention for their excellent error-correction performance and inherent fitness for high-parallelism implementation. With great complexity reduction and friendly for hardware implementation, the min-sum (MS) decoding algorithm for LDPC codes gains widespread applications in practical. In the MS decoding algorithm, finding the first two minima among input variable-to-check messages is the most complex part. To further reduce the complexity of the MS decoding algorithm, an efficient single-minimum (single-min) based layered MS decoding for quasi-cyclic LDPC (QC-LDPC) codes is proposed in this paper. It is found that statistically the difference between the first minimum and second minimum increases as the decoding becomes more convergent. Accordingly, in the proposed single-min scheme, the second minimum is approximately derived based on the first minimum and an index indicating the convergence degree. Besides, some other metrics that are easily obtained are used to refine the second minimum. Simulation results show that the proposed method can significantly improve the error-correction performance and lower the average number of iterations, compared with the state-of-the-art single-min based MS decoding algorithms.

Information Communication Technologies Conference (ICTC)•May 17, 2023•1 citation

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 decoding algorithm for LDPC codes based on integer operation

MA Hui-miao

Based on the investigation of the low-density parity-check(LDPC) codes' layered decoding algorithm in additive white Gaussian noise(AWGN) channel,an improved layered decoding algorithm based on integer operation is proposed for decoding LDPC codes.All the variables are indicated as integers in the proposed algorithm,so it is very convenient for implementation in hardware.At the same time,a modified factor is introduced to improve the layered decoding algorithm.With this modified factor,its decoding performance is improved greatly.Simulation results in AWGN channel show that the improved layered decoding algorithm can not only reduce the computation complexity and accelerate the convergence rate,but also have a lower error floor.

Systems engineering and electronics•Jan 1, 2013•0 citations
Low-Density Parity-Check code is a kind of near-optimal error correction code. In order to improve the performance of layered decoding algorithms, two algorithms are put forward in this paper. In the first algorithm, additional messages are employed for the messages updating operation of each layer by using another layered part, making it possible to accelerate the speed of convergence. In the second one, a correction operation for certain type of errors is performed to improve the decoding performance. Simulation results show that more decoding gain and accelerated convergence can be obtained compared with the conventional layered decoding algorithms.
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.
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.
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 (LDPC) codes have attracted tremendous attention for their excellent error-correction performance and inherent fitness for high-parallelism implementation. With great complexity reduction and friendly for hardware implementation, the min-sum (MS) decoding algorithm for LDPC codes gains widespread applications in practical. In the MS decoding algorithm, finding the first two minima among input variable-to-check messages is the most complex part. To further reduce the complexity of the MS decoding algorithm, an efficient single-minimum (single-min) based layered MS decoding for quasi-cyclic LDPC (QC-LDPC) codes is proposed in this paper. It is found that statistically the difference between the first minimum and second minimum increases as the decoding becomes more convergent. Accordingly, in the proposed single-min scheme, the second minimum is approximately derived based on the first minimum and an index indicating the convergence degree. Besides, some other metrics that are easily obtained are used to refine the second minimum. Simulation results show that the proposed method can significantly improve the error-correction performance and lower the average number of iterations, compared with the state-of-the-art single-min based MS decoding algorithms.
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
Based on the investigation of the low-density parity-check(LDPC) codes' layered decoding algorithm in additive white Gaussian noise(AWGN) channel,an improved layered decoding algorithm based on integer operation is proposed for decoding LDPC codes.All the variables are indicated as integers in the proposed algorithm,so it is very convenient for implementation in hardware.At the same time,a modified factor is introduced to improve the layered decoding algorithm.With this modified factor,its decoding performance is improved greatly.Simulation results in AWGN channel show that the improved layered decoding algorithm can not only reduce the computation complexity and accelerate the convergence rate,but also have a lower error floor.