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

Communications technology

Implementation of Fully Parallel Stochastic LDPC Decoder

Ren Xiang-wei

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

This paper proposes a new architecture for fully parallel stochastic low-density parity-check(LDPC) decoder.This architecture,in combination of the stochastic computation idea,could greatly reduce the complexity of operation,the area consumption of Implementation and markably raise the throughput.Meanwhile,the EM architecture is also introduced to circumvent the hold-state problem.Simulation in AWGN channel shows that,compared with the traditional LDPC decoder,the new scheme with proposed architecture has nearly 0.2dB performance loss,while the decoding complexity is significantly reduced.

Related papers

Fully Parallel Stochastic LDPC Decoders

Saeed Sharifi Tehrani, Shie Mannor, Warren J. Gross

Stochastic decoding is a new approach to iterative decoding on graphs. This paper presents a hardware architecture for fully parallel stochastic low-density parity-check (LDPC) decoders. To obtain the characteristics of the proposed architecture, we apply this architecture to decode an irregular state-of-the-art (1056,528) LDPC code on a Xilinx Virtex-4 LX200 field-programmable gate-array (FPGA) device. The implemented decoder achieves a clock frequency of 222 MHz and a throughput of about 1.66 Gb/s at$E_{b}/N_{0}={\hbox {4.25~dB}}$(a bit error rate of$10^{-8}$). It provides decoding performance within 0.5 and 0.25 dB of the floating-point sum-product algorithm with 32 and 16 iterations, respectively, and similar error-floor behavior. The decoder uses less than 40% of the lookup tables, flip-flops, and IO ports available on the FPGA device. The results provided in this paper validate the potential of stochastic LDPC decoding as a practical and competitive fully parallel decoding approach.

IEEE Transactions on Signal Processing•Aug 20, 2008•204 citations

Delayed Stochastic Decoding of LDPC Codes

A. Naderi, Shie Mannor, Mohamad Sawan +1 more

A new stochastic decoding algorithm, called Delayed Stochastic (DS) decoding, is introduced to implement low-density-parity-check (LDPC) decoders. The delayed stochastic decoding uses an alternative method to track probability values, which results in reduction of hardware complexity and memory requirement of the stochastic decoders. It is therefore suitable for fully-parallel implementation of long LDPC codes with applications in optical communications. Two decoders are implemented using the DS algorithm for medium (2048, 1723) and long (32768, 26624) LDPC codes. The decoders occupy 3.93- mm2and 56.5- mm2silicon area using 90-nm CMOS technology and provide maximum core throughputs of 172.4 and 477.7 Gb/s at [(Eb)/(No)]=5.5 and 4.8 dB, respectively.

IEEE Transactions on Signal Processing•Aug 15, 2011•138 citations

An Efficient LDPC Decoder Based on Multi-Dimension Nonlinear Stochastic Computing

Kaining Han, Ziming Liu, Jianhao Hu

Low-Density Parity-Check (LDPC) decoders face significant challenges in hardware complexity and routing congestion when targeting high throughput for next-generation communication systems. While stochastic computing offers a low-complexity alternative for fully parallel decoder implementation, it suffers from the hold-state problem in variable node updating, degrading performance and convergence. To address this issue, this paper presents a novel stochastic LDPC decoder based on a multi-dimensional nonlinear (MDN) stochastic computing unit. The proposed method formulates the update process as a multivariable optimization problem, achieving high accuracy. Implementation results show that the proposed decoder delivers comparable bit-error-rate (BER) performance while achieving 26% and 62% higher hardware efficiency for IEEE 802.3an and 5G NR LDPC codes, respectively.

IEEE Transactions on Circuits & Systems II Express Briefs•Jan 1, 2026•0 citations

Improved decoding approach of low-density parity-check codes with finite precision

Kuang Wang

An improved parallel decoding approach of sum-product algorithm for low-density parity-check codes(LDPC) was presented in order to solve the problem of divergence in decoding iteration with finite precision,.In addition,the reason for improving the convergence speed was discussed detailedly and the pipeline structure was provided.By eliminating the unexpected state in which operation data didn't satisfy input rules due to the finite precision effect thus could not be preceded correctly,the iteration convergence was improved efficiently and led to decoding with no error.Compared with the original parallel approach,this improvement don't involve too much control logic and computational complexity.Simulation shows that the proposed decoding approach over additive white Gaussian noise(AWGN) channel achieves good performance,especially at high code rate,it suffers negligible performance loss compared with the forward-backward approach while reducing the operation complexity effectively.

Journal of Zhejiang University(Engineering Science)•Jan 1, 2008•0 citations

Convergence-optimized variable node structure for stochastic LDPC decoder

Qichen Zhang, Yun Chen, Di Wu +2 more

By using stochastic computation, a fully-parallel low-density parity-check (LDPC) decoder can be implemented using a lower wire complexity. In order to enhance the decoder performance, probability tracers, such as up/down counters, are added at each edge between variable nodes and check nodes, as described in previous literature. However, this causes a large decoding latency and a high number of decoding failures. In this paper, a convergence-optimized structure for variable nodes is proposed that is able to overcome these issues. As a result, the throughput for the proposed decoder is 20.5Gb/s, which is 101% higher than the original counter-based decoder presented in the previous literature.

IEEE International Conference on Acoustics Speech and Signal Processing•Mar 1, 2016•2 citations

Efficient Highly-Parallel Decoder Architecture for Quasi-Cyclic Low-Density Parity-Check Codes

Daesun Oh, Keshab K. Parhi

In this paper, the authors propose an efficient highly-parallel decoder architecture using partially overlapped decoding scheme for quasi-cyclic (QC) low-density parity-check (LDPC) codes, which leads to reduction in hardware complexity and power consumption. Generally, due to the regularly structured parity-check matrix H of QC LDPC codes, the message updating computations in the check node unit (CNU) and the variable node unit (VNU) can be efficiently overlapped, which increases the decoding throughput by maximizing the hardware utilization efficiency (HUE). However, the partially overlapped decoding scheme cannot be used to design a highly-parallel decoding architecture for high-throughput applications. For (3, 5)-regular QC LDPC codes, our proposed method could reduce the hardware complexity by approximately 33% for the CNU and 20% for the VNU in the highly-parallel decoder architecture without any performance degradation. In addition, the power consumption can be minimized by reducing the total number of memory accesses for updated messages.

IEEE International Symposium on Circuits and Systems proceedings•May 1, 2007•15 citations
This paper proposes a new architecture for fully parallel stochastic low-density parity-check(LDPC) decoder.This architecture,in combination of the stochastic computation idea,could greatly reduce the complexity of operation,the area consumption of Implementation and markably raise the throughput.Meanwhile,the EM architecture is also introduced to circumvent the hold-state problem.Simulation in AWGN channel shows that,compared with the traditional LDPC decoder,the new scheme with proposed architecture has nearly 0.2dB performance loss,while the decoding complexity is significantly reduced.
Stochastic decoding is a new approach to iterative decoding on graphs. This paper presents a hardware architecture for fully parallel stochastic low-density parity-check (LDPC) decoders. To obtain the characteristics of the proposed architecture, we apply this architecture to decode an irregular state-of-the-art (1056,528) LDPC code on a Xilinx Virtex-4 LX200 field-programmable gate-array (FPGA) device. The implemented decoder achieves a clock frequency of 222 MHz and a throughput of about 1.66 Gb/s atEb/N0=4.25 dBE_{b}/N_{0}={\hbox {4.25~dB}}Eb​/N0​=4.25 dB(a bit error rate of10−810^{-8}10−8). It provides decoding performance within 0.5 and 0.25 dB of the floating-point sum-product algorithm with 32 and 16 iterations, respectively, and similar error-floor behavior. The decoder uses less than 40% of the lookup tables, flip-flops, and IO ports available on the FPGA device. The results provided in this paper validate the potential of stochastic LDPC decoding as a practical and competitive fully parallel decoding approach.
A new stochastic decoding algorithm, called Delayed Stochastic (DS) decoding, is introduced to implement low-density-parity-check (LDPC) decoders. The delayed stochastic decoding uses an alternative method to track probability values, which results in reduction of hardware complexity and memory requirement of the stochastic decoders. It is therefore suitable for fully-parallel implementation of long LDPC codes with applications in optical communications. Two decoders are implemented using the DS algorithm for medium (2048, 1723) and long (32768, 26624) LDPC codes. The decoders occupy 3.93- mm2and 56.5- mm2silicon area using 90-nm CMOS technology and provide maximum core throughputs of 172.4 and 477.7 Gb/s at [(Eb)/(No)]=5.5 and 4.8 dB, respectively.
Low-Density Parity-Check (LDPC) decoders face significant challenges in hardware complexity and routing congestion when targeting high throughput for next-generation communication systems. While stochastic computing offers a low-complexity alternative for fully parallel decoder implementation, it suffers from the hold-state problem in variable node updating, degrading performance and convergence. To address this issue, this paper presents a novel stochastic LDPC decoder based on a multi-dimensional nonlinear (MDN) stochastic computing unit. The proposed method formulates the update process as a multivariable optimization problem, achieving high accuracy. Implementation results show that the proposed decoder delivers comparable bit-error-rate (BER) performance while achieving 26% and 62% higher hardware efficiency for IEEE 802.3an and 5G NR LDPC codes, respectively.
An improved parallel decoding approach of sum-product algorithm for low-density parity-check codes(LDPC) was presented in order to solve the problem of divergence in decoding iteration with finite precision,.In addition,the reason for improving the convergence speed was discussed detailedly and the pipeline structure was provided.By eliminating the unexpected state in which operation data didn't satisfy input rules due to the finite precision effect thus could not be preceded correctly,the iteration convergence was improved efficiently and led to decoding with no error.Compared with the original parallel approach,this improvement don't involve too much control logic and computational complexity.Simulation shows that the proposed decoding approach over additive white Gaussian noise(AWGN) channel achieves good performance,especially at high code rate,it suffers negligible performance loss compared with the forward-backward approach while reducing the operation complexity effectively.
By using stochastic computation, a fully-parallel low-density parity-check (LDPC) decoder can be implemented using a lower wire complexity. In order to enhance the decoder performance, probability tracers, such as up/down counters, are added at each edge between variable nodes and check nodes, as described in previous literature. However, this causes a large decoding latency and a high number of decoding failures. In this paper, a convergence-optimized structure for variable nodes is proposed that is able to overcome these issues. As a result, the throughput for the proposed decoder is 20.5Gb/s, which is 101% higher than the original counter-based decoder presented in the previous literature.
In this paper, the authors propose an efficient highly-parallel decoder architecture using partially overlapped decoding scheme for quasi-cyclic (QC) low-density parity-check (LDPC) codes, which leads to reduction in hardware complexity and power consumption. Generally, due to the regularly structured parity-check matrix H of QC LDPC codes, the message updating computations in the check node unit (CNU) and the variable node unit (VNU) can be efficiently overlapped, which increases the decoding throughput by maximizing the hardware utilization efficiency (HUE). However, the partially overlapped decoding scheme cannot be used to design a highly-parallel decoding architecture for high-throughput applications. For (3, 5)-regular QC LDPC codes, our proposed method could reduce the hardware complexity by approximately 33% for the CNU and 20% for the VNU in the highly-parallel decoder architecture without any performance degradation. In addition, the power consumption can be minimized by reducing the total number of memory accesses for updated messages.