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 Forum on Computer Science-Technology and Applications

A Low-Complexity Layered Decoding Algorithm for LDPC Codes

Wang Zhongxun, Qing Mu

Published Jan 1, 2009• 2 citations
Publisher

Abstract

A Low-complexity Layered Decoding Algorithm for LDPC Codes is proposed. Our modified algorithm reduces the number of operations in variable nodes to lower LDPC decoder power consumption. The modified parts of LDPC decoder architecture is also described. Simulation results show that comparing with SPA and MSA, our algorithm reducing the number of operations nearly to 60% with little performance loss.

DOI
10.1109/ifcsta.2009.200

Related papers

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

A New Reduced-Complexity Decoding Algorithm for LDPC Codes

Guiyuan Sun, Jiejun Jin, Wei Yao +1 more

This letter proposes a new algorithm for the check node update in the decoding of low-density parity-check (LDPC) codes. The proposed algorithm is based on a new approximation formula of standard sum-product algorithm (SPA) which can reduce the approximation error of min-sum algorithm (MSA) and has almost the same performance as sum-product algorithm (SPA) under both floating precision operation and fixed-point operation. Besides, the new approximation formula can be implemented in simple structures competitive with MSA.

IEICE Transactions on Communications•Jul 1, 2007•2 citations

An optimized min-sum variable node layering for LDPC decoding

Nassib Laouini, Larbi Ben Hadj Slama, Ammar Bouallègue

Layered decoding is well appreciated in Low-Density Parity-Check (LDPC) decoder implementation since it provides efficient and high-throughput implementation of LDPC decoders. Variable-Node Layered Belief Propagation (VL-BP) algorithm and their reduced-complexity derivatives for LDPC codes are presented. The VL-BP algorithm is a modification of Belief Propagation algorithm (BP), where the variable nodes are divided in subgroups called layers and each iteration is broken into multiple sub-iterations. Some simplifications can also be made to lower the complexity of both BP and CL-BP algorithms, and particularly the complexity of the check node update rule. In this paper, we consider Variable Node Layered BP (VL-BP) algorithm and propose an optimized min-sum VL-BP (MS VL-BP) algorithm for decoding LDPC code which has better performance not only from MS VL-BP algorithm but also from BP algorithm. In this decoding method, unlike other layered algorithms, we consider for the first layer a set of variable nodes that has a low value of the intrinsic information. Simulation results show that good performance can be achieved, and which can even be improved by the addition of either a normalization term or an additive offset term.

•Apr 1, 2014•1 citation

Reduced-Complexity Belief Propagation Decoding for LDPC Codes

Heping Wan, Joonyoung Cho, Min Jang +1 more

Two methods are proposed to reduce the complexity of the belief propagation (BP) decoding for low-density parity-check (LDPC) codes, with the focus on the layered decoding for quasi-cyclic LDPC (QC-LDPC) codes. The two methods can be separately incorporated into the layered decoding procedures and combined seamlessly to provide the two-fold complexity reduction. In the first method, the message updates regarding a subset of variable nodes are omitted. To construct the subset, the most reliable bit-level channels, derived fromM-ary input channels, are identified. Then, we select the variable nodes with initial log-likelihood ratios (LLRs) exceeding a threshold among the ones assigned to the most reliable bit-level channels to form the subset. The threshold is designed and adjusted based on characteristics of the most reliable bit-level channels. Our numerical results demonstrate that the first method significantly reduces the complexity with negligibly impacting the error-correcting performance. In the second method, each layer of base graphs of QC-LDPC codes uses either sum-product algorithm (SPA) or min-sum algorithm (MSA) to update LLRs. A degree-based algorithm is presented to determine the layers employing either SPA or MSA. We compare with two intuitive methods: 1) applying SPA to randomly selected layers and MSA to the remaining layers, and 2) applying SPA to the core layers of 5G NR LDPC codes and MSA to the remaining layers. According to the numerical results, the degree-based algorithm maximally reduces the complexity while maintaining the same performance. To evaluate the joint method, the first method is applied on top of the second method. Further complexity reduction is achieved without degrading the performance of the second method.

IEEE Access•Jan 1, 2026•0 citations

Low Complexity Decoding Algorithm of QC-LDPC Code

Fanglong Yi, Pengjun Wang

Through the research on the decoding algorithm of low-density parity-check (LDPC) code, a low complexity decoding algorithm suitable for quasi-cyclic LDPC (QC-LDPC) code is proposed in this paper. The algorithm adopts layered decoding (LD), and the sub-minimum is replaced by the sum of an optimal correction factor and the minimum during the process of the check nodes update. Therefore, it is not required to find the sub-minimum and the computational complexity reduces significantly. Matlab simulation results show that the decoding performance of this algorithm is very near to min-sum (MS) algorithm, and more superior than single min-sum (SMS) algorithm.

IEEE Asia-Pacific Services Computing Conference (APSCC)•Dec 1, 2010•3 citations
A Low-complexity Layered Decoding Algorithm for LDPC Codes is proposed. Our modified algorithm reduces the number of operations in variable nodes to lower LDPC decoder power consumption. The modified parts of LDPC decoder architecture is also described. Simulation results show that comparing with SPA and MSA, our algorithm reducing the number of operations nearly to 60% with little performance loss.
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.
This letter proposes a new algorithm for the check node update in the decoding of low-density parity-check (LDPC) codes. The proposed algorithm is based on a new approximation formula of standard sum-product algorithm (SPA) which can reduce the approximation error of min-sum algorithm (MSA) and has almost the same performance as sum-product algorithm (SPA) under both floating precision operation and fixed-point operation. Besides, the new approximation formula can be implemented in simple structures competitive with MSA.
Layered decoding is well appreciated in Low-Density Parity-Check (LDPC) decoder implementation since it provides efficient and high-throughput implementation of LDPC decoders. Variable-Node Layered Belief Propagation (VL-BP) algorithm and their reduced-complexity derivatives for LDPC codes are presented. The VL-BP algorithm is a modification of Belief Propagation algorithm (BP), where the variable nodes are divided in subgroups called layers and each iteration is broken into multiple sub-iterations. Some simplifications can also be made to lower the complexity of both BP and CL-BP algorithms, and particularly the complexity of the check node update rule. In this paper, we consider Variable Node Layered BP (VL-BP) algorithm and propose an optimized min-sum VL-BP (MS VL-BP) algorithm for decoding LDPC code which has better performance not only from MS VL-BP algorithm but also from BP algorithm. In this decoding method, unlike other layered algorithms, we consider for the first layer a set of variable nodes that has a low value of the intrinsic information. Simulation results show that good performance can be achieved, and which can even be improved by the addition of either a normalization term or an additive offset term.
Two methods are proposed to reduce the complexity of the belief propagation (BP) decoding for low-density parity-check (LDPC) codes, with the focus on the layered decoding for quasi-cyclic LDPC (QC-LDPC) codes. The two methods can be separately incorporated into the layered decoding procedures and combined seamlessly to provide the two-fold complexity reduction. In the first method, the message updates regarding a subset of variable nodes are omitted. To construct the subset, the most reliable bit-level channels, derived fromM-ary input channels, are identified. Then, we select the variable nodes with initial log-likelihood ratios (LLRs) exceeding a threshold among the ones assigned to the most reliable bit-level channels to form the subset. The threshold is designed and adjusted based on characteristics of the most reliable bit-level channels. Our numerical results demonstrate that the first method significantly reduces the complexity with negligibly impacting the error-correcting performance. In the second method, each layer of base graphs of QC-LDPC codes uses either sum-product algorithm (SPA) or min-sum algorithm (MSA) to update LLRs. A degree-based algorithm is presented to determine the layers employing either SPA or MSA. We compare with two intuitive methods: 1) applying SPA to randomly selected layers and MSA to the remaining layers, and 2) applying SPA to the core layers of 5G NR LDPC codes and MSA to the remaining layers. According to the numerical results, the degree-based algorithm maximally reduces the complexity while maintaining the same performance. To evaluate the joint method, the first method is applied on top of the second method. Further complexity reduction is achieved without degrading the performance of the second method.
Through the research on the decoding algorithm of low-density parity-check (LDPC) code, a low complexity decoding algorithm suitable for quasi-cyclic LDPC (QC-LDPC) code is proposed in this paper. The algorithm adopts layered decoding (LD), and the sub-minimum is replaced by the sum of an optimal correction factor and the minimum during the process of the check nodes update. Therefore, it is not required to find the sub-minimum and the computational complexity reduces significantly. Matlab simulation results show that the decoding performance of this algorithm is very near to min-sum (MS) algorithm, and more superior than single min-sum (SMS) algorithm.