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

High Throughput Layered Decoding Design of QC-LDPC Codes

XU Bin, HE Yucheng

Published Jul 1, 2019• 0 citations
Publisher

Abstract

To address the low throughput and high storage resource consumption of the low density parity-check decoder,this paper proposes a layered decoding algorithm of QC-LDPC codes.The algorithm uses the receiving channel module to initialize the likelihood ratio information.Then the storage check information and posteriori information are combined to generate a node self-updating decoding algorithm based on the layered minimum sum.The decoder is judged based on the sign bit of posterior information.Simulation results show that the storage resources of the improved decoder are saved by 20% compared with the traditional decoder.When the number of iterations is 10,the throughput can reach 516.8 Mb/s.

DOI
10.19678/j.issn.1000-3428.0050741

Related papers

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

Low-Complexity High-Throughput QC-LDPC Decoder for 5G New Radio Wireless Communication

Tram Thi Bao Nguyen, Tuy Tan Nguyen, Hanho Lee

This paper presents a pipelined layered quasi-cyclic low-density parity-check (QC-LDPC) decoder architecture targeting low-complexity, high-throughput, and efficient use of hardware resources compliant with the specifications of 5G new radio (NR) wireless communication standard. First, a combined min-sum (CMS) decoding algorithm, which is a combination of the offset min-sum and the original min-sum algorithm, is proposed. Then, a low-complexity and high-throughput pipelined layered QC-LDPC decoder architecture for enhanced mobile broadband specifications in 5G NR wireless standards based on CMS algorithm with pipeline layered scheduling is presented. Enhanced versions of check node-based processor architectures are proposed to improve the complexity of the LDPC decoders. An efficient minimum-finder for the check node unit architecture that reduces the hardware required for the computation of the first two minima is introduced. Moreover, a low complexity a posteriori information update unit architecture, which only requires one adder array for their operations, is presented. The proposed architecture shows significant improvements in terms of area and throughput compared to other QC-LDPC decoder architectures available in the literature.

Electronics•Feb 22, 2021•41 citations

Implementation of QC-LDPC Code Decoder with High Performance

Lin Zhi-guo

A multi-rate decoder of Quasi-Cyclic LDPC(QC-LDPC) decoder is presented based on the improvement of layered decoding algorithm.The implementation has larger bit throughput resulting from fast convergence speed by more than 50 percent in terms of decoding iterations.Only four memories are used to store the messages which significantly reduce the area and the power dissipation.Adjusted integer quantization of layered decoding algorithm for check-node updating reduces the complexity and the correction factor guarantees the error rate performance.The proposed decoding architecture is implemented in the standard recommended.The decoder consumes 0.6 million gates,and reaches a throughput of 134 Mb/s at a clock frequency of 110 MHz with rate of 1/2.

•Jan 1, 2011•0 citations

Design of F-L-QC-LDPC Decoder Based on LNMS Decoding Algorithm

Youyao Liu, Haimei Huang, Jialei Gao +1 more

Low Density Parity Check Code (LDPC) can meet the decoding requirements of a variety of code lengths and rates in different communication scenarios, but the LDPC code check matrix is irregular, which has problems with difficult storage and reading of the check matrix and high coding complexity. For the decoding requirements of multi-code length, this paper proposes a Quasi Crystal Low Density Parity Check Codes (QCLDPC) code based on Fibonacci Lucas sequence, which can obtain the codewords with different code length and code rate by changing the number of rows and columns of the exponential matrix. In terms of decoding algorithms, the Layered Non-Maximum Suppression (LNMS) decoding algorithm, which combines the minimum sum decoding algorithm with the layered algorithm, is proposed to improve the convergence speed of decoding iteration and decoder throughput. Through simulation and comparative experiments, it is proved that this design can support a variety of bit rates, block lengths and sub matrix sizes, and meet the requirements of high throughput and low complexity decoder in modern communication systems.

International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)•Jul 29, 2023•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

A QC-LDPC construction algorithm for increasing the throughput of layered decoders

Jianjun Zhang, Mingke Dong, Ye Jin

Pipelined layered decoder (PLD) of quasi-cyclic low-density parity-check (QC-LDPC) codes is one of most popular high-throughput decoder in modern communication systems. However, the traditional QC-LDPC codes are not suitable for PLD and lead to memory access conflict problems (MACPs) that reduce the throughput of PLD. Therefore, an efficient layered block progressive edge-growth (EL-BPEG) algorithm is proposed to construct a class of QC-LDPC codes that can avoid MACPs and increase throughput. EL-BPEG appends check nodes, rather than variable nodes, progressively into Tanner Graph with strict concentrated check-node degrees. And it establishes edges according to the latency of the pipelines in PLD; thus, all idle clocks can be eliminated for the PLD with EL-BPEG codes. Result indicates that the throughput of PLD can be improved by 50.2% to 99.2% by using the EL-BPEG codes compared with the traditional QC-LDPC codes. Simulations show that the error performances of EL-BPEG codes are as well as the codes in standards.

IEEE International Conference on Communication Technology (ICCT)•Nov 1, 2013•2 citations
To address the low throughput and high storage resource consumption of the low density parity-check decoder,this paper proposes a layered decoding algorithm of QC-LDPC codes.The algorithm uses the receiving channel module to initialize the likelihood ratio information.Then the storage check information and posteriori information are combined to generate a node self-updating decoding algorithm based on the layered minimum sum.The decoder is judged based on the sign bit of posterior information.Simulation results show that the storage resources of the improved decoder are saved by 20% compared with the traditional decoder.When the number of iterations is 10,the throughput can reach 516.8 Mb/s.
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.
This paper presents a pipelined layered quasi-cyclic low-density parity-check (QC-LDPC) decoder architecture targeting low-complexity, high-throughput, and efficient use of hardware resources compliant with the specifications of 5G new radio (NR) wireless communication standard. First, a combined min-sum (CMS) decoding algorithm, which is a combination of the offset min-sum and the original min-sum algorithm, is proposed. Then, a low-complexity and high-throughput pipelined layered QC-LDPC decoder architecture for enhanced mobile broadband specifications in 5G NR wireless standards based on CMS algorithm with pipeline layered scheduling is presented. Enhanced versions of check node-based processor architectures are proposed to improve the complexity of the LDPC decoders. An efficient minimum-finder for the check node unit architecture that reduces the hardware required for the computation of the first two minima is introduced. Moreover, a low complexity a posteriori information update unit architecture, which only requires one adder array for their operations, is presented. The proposed architecture shows significant improvements in terms of area and throughput compared to other QC-LDPC decoder architectures available in the literature.
A multi-rate decoder of Quasi-Cyclic LDPC(QC-LDPC) decoder is presented based on the improvement of layered decoding algorithm.The implementation has larger bit throughput resulting from fast convergence speed by more than 50 percent in terms of decoding iterations.Only four memories are used to store the messages which significantly reduce the area and the power dissipation.Adjusted integer quantization of layered decoding algorithm for check-node updating reduces the complexity and the correction factor guarantees the error rate performance.The proposed decoding architecture is implemented in the standard recommended.The decoder consumes 0.6 million gates,and reaches a throughput of 134 Mb/s at a clock frequency of 110 MHz with rate of 1/2.
Low Density Parity Check Code (LDPC) can meet the decoding requirements of a variety of code lengths and rates in different communication scenarios, but the LDPC code check matrix is irregular, which has problems with difficult storage and reading of the check matrix and high coding complexity. For the decoding requirements of multi-code length, this paper proposes a Quasi Crystal Low Density Parity Check Codes (QCLDPC) code based on Fibonacci Lucas sequence, which can obtain the codewords with different code length and code rate by changing the number of rows and columns of the exponential matrix. In terms of decoding algorithms, the Layered Non-Maximum Suppression (LNMS) decoding algorithm, which combines the minimum sum decoding algorithm with the layered algorithm, is proposed to improve the convergence speed of decoding iteration and decoder throughput. Through simulation and comparative experiments, it is proved that this design can support a variety of bit rates, block lengths and sub matrix sizes, and meet the requirements of high throughput and low complexity decoder in modern communication systems.
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.
Pipelined layered decoder (PLD) of quasi-cyclic low-density parity-check (QC-LDPC) codes is one of most popular high-throughput decoder in modern communication systems. However, the traditional QC-LDPC codes are not suitable for PLD and lead to memory access conflict problems (MACPs) that reduce the throughput of PLD. Therefore, an efficient layered block progressive edge-growth (EL-BPEG) algorithm is proposed to construct a class of QC-LDPC codes that can avoid MACPs and increase throughput. EL-BPEG appends check nodes, rather than variable nodes, progressively into Tanner Graph with strict concentrated check-node degrees. And it establishes edges according to the latency of the pipelines in PLD; thus, all idle clocks can be eliminated for the PLD with EL-BPEG codes. Result indicates that the throughput of PLD can be improved by 50.2% to 99.2% by using the EL-BPEG codes compared with the traditional QC-LDPC codes. Simulations show that the error performances of EL-BPEG codes are as well as the codes in standards.