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 Symposium on Turbo Codes and Iterative Information Processing

Fast convergence stochastic LDPC decoder based on edge memory structure

Guiwu Yang, Kai Kang, Jianhao Hu, Qiu Dong Huang, Yujing Lin

Published Dec 1, 2018• 0 citations
Publisher

Abstract

In recent years, the LDPC decoder based on stochastic calculation has been becoming a hot topic, and the re-randomization structure based on edge memory for the stochastic LDPC decoder shows great advantages over performance and complexity compared with the traditional decoders. However, latching issue is also the main challenge for the stochastic LDPC decoders with edge memory structure, similar to stochastic LDPC decoders with other structures. Frequent latching state results in a low information updating efficiency, which reduces decoding performance and convergence speed. In order to speed up the information updating efficiency of the stochastic decoder, in this paper, we propose a dual memory parallel update structure for edge memory. Based on the proposed structure, the efficiency of information convergence is greatly accelerated with acceptable hardware cost. And the decoding performance and latency are also improved.

DOI
10.1109/istc.2018.8625320

Related papers

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

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

Efficient algorithms for stochastic decoding of LDPC codes

Kuo-Lun Huang

The expanding demand for high-speed communications has resulted in development of high-throughput error-correcting techniques required by emerging communication standards. Low-Density Parity-Check (LDPC) codes are a class of linear block codes that achieve near-capacity performance and have been selected as part of many digital communication standards. Stochastic computation has been proposed as a hardware efficient approach for decoding LDPC codes. Using stochastic computation, all messages in the iterative decoding process are represented by Bernoulli sequences. Computations on these sequences are performed bit-by-bit using simple logic operations. Furthermore, serial messages used in stochastic decoders help alleviate routing congestion in hardware implementation of decoder. These factors make stochastic decoding a low complexity alternative to implement LDPC decoders. In this dissertation, we analyze the characteristics of stochastic decoding and propose reduced-latency designs for stochastic LDPC decoders to achieve improved performance on various channel models.

•Jan 1, 2016•2 citations

Enhancing the Decoding of Short LDPC Codes with Stochastic Sequences

Yuyuan Gu, Haien Li

Low-Density Parity-Check (LDPC) codes are one of the most popular codes used in nowadays’ communication due to their high coding efficiency at low decoding complexity. With these characteristics, LDPC codes are suitable for high-speed information transmission systems. The widely used decoding algorithm for LDPC codes is Belief Propagation (BP) decoding with which the performance of LDPC codes can approach the Shannon limit. With the development of 5G, a lot of attention is given to the so-called ultra-reliable low latency communication scenario which needs the short code to transmit. However, short codes will not have a very good performance with BP decoding. To solve this problem, investigations have been done such as multiple-bases BP decoding. Although this decoding method has a better performance than BP decoding, it will cause a high complexity in the hardware implementation. Besides, an investigation on the stochastic decoding for shortcodes was proposed in 2003. This decoding method is hardware friendly, but its performance can only approach BP decoding. Inspired by multiple-bases BP decoding and stochastic decoding, binary stochastic decoding with parallel decoders is proposed in this thesis firstly. It represents stochastic sequences with multiple parallel Tanner graphs and uses hard-decision decoding in the iterative part because of the binary input bits. However, this decoding method has a severe performance loss compared to BP decoding. To avoid this problem, the enhancement method is used to make the binary sequences be non-binary sequences that can form more powerful parallel decoders. Then the non-binary symbols of these new sequences are transformed to their corresponding log-likelihood ratio which enables the iterative part to use BP decoding. In addition, combining with the ML decision of list decoding, the decision part of our stochastic decoder can fully utilize the output to increase the efficiency of the decoding method. After ensuring the performance of our non-binary stochastic decoding to be better than BP decoding, the complexity of the decoder is reduced to save the computational resources. Finally, with constant adjustments, the bit width of each non-binary symbol is determined to be 15, and the sequence length is reduced to 20 which can let the non-binary stochastic decoding has an acceptable complexity while keeping good performance.

•Jan 1, 2021•1 citation

Dual-Bit-Wise Stochastic Decoding for Polar Codes

Suwen Song, Lu Liu, Zhongfeng Wang +1 more

Polar codes, being the first class of codes with provable capacity-achieving property, have aroused extensive attention. The belief propagation (BP) algorithm, which is one of the popular decoding approaches for polar codes, possesses inherent high parallelism but also high computational complexity. With low complexity and high fault tolerance, stochastic computing has been well studied and applied to BP decoding for polar codes. However, existing stochastic BP decoders suffer from high decoding latency. In this paper, firstly, a novel dual-bit-wise iterative message update method is proposed for stochastic BP, reducing the decoding latency by more than half. Based on the dual-bit-wise decoding, more special nodes in the factor graph are investigated and then fully exploited to pursue lower decoding complexity than prior arts. Moreover, a well-optimized architecture is developed for the proposed stochastic decoder, where the random number generator (RNG), tracking forecast memory (TFM), and hard decision unit are intelligently designed for reduced hardware cost. Experimental results demonstrate that the presented decoder can exhibit 61.7% lower decoding latency than the state-of-the-art works. Besides, the throughput and hardware efficiency can be improved by nearly$2.8\times$and$2.7\times$, respectively.

IEEE Transactions on Signal Processing•Jan 1, 2023•3 citations

Implementation of Fully Parallel Stochastic LDPC Decoder

Ren Xiang-wei

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.

Communications technology•Jan 1, 2011•0 citations
In recent years, the LDPC decoder based on stochastic calculation has been becoming a hot topic, and the re-randomization structure based on edge memory for the stochastic LDPC decoder shows great advantages over performance and complexity compared with the traditional decoders. However, latching issue is also the main challenge for the stochastic LDPC decoders with edge memory structure, similar to stochastic LDPC decoders with other structures. Frequent latching state results in a low information updating efficiency, which reduces decoding performance and convergence speed. In order to speed up the information updating efficiency of the stochastic decoder, in this paper, we propose a dual memory parallel update structure for edge memory. Based on the proposed structure, the efficiency of information convergence is greatly accelerated with acceptable hardware cost. And the decoding performance and latency are also improved.
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.
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.
The expanding demand for high-speed communications has resulted in development of high-throughput error-correcting techniques required by emerging communication standards. Low-Density Parity-Check (LDPC) codes are a class of linear block codes that achieve near-capacity performance and have been selected as part of many digital communication standards. Stochastic computation has been proposed as a hardware efficient approach for decoding LDPC codes. Using stochastic computation, all messages in the iterative decoding process are represented by Bernoulli sequences. Computations on these sequences are performed bit-by-bit using simple logic operations. Furthermore, serial messages used in stochastic decoders help alleviate routing congestion in hardware implementation of decoder. These factors make stochastic decoding a low complexity alternative to implement LDPC decoders. In this dissertation, we analyze the characteristics of stochastic decoding and propose reduced-latency designs for stochastic LDPC decoders to achieve improved performance on various channel models.
Low-Density Parity-Check (LDPC) codes are one of the most popular codes used in nowadays’ communication due to their high coding efficiency at low decoding complexity. With these characteristics, LDPC codes are suitable for high-speed information transmission systems. The widely used decoding algorithm for LDPC codes is Belief Propagation (BP) decoding with which the performance of LDPC codes can approach the Shannon limit. With the development of 5G, a lot of attention is given to the so-called ultra-reliable low latency communication scenario which needs the short code to transmit. However, short codes will not have a very good performance with BP decoding. To solve this problem, investigations have been done such as multiple-bases BP decoding. Although this decoding method has a better performance than BP decoding, it will cause a high complexity in the hardware implementation. Besides, an investigation on the stochastic decoding for shortcodes was proposed in 2003. This decoding method is hardware friendly, but its performance can only approach BP decoding. Inspired by multiple-bases BP decoding and stochastic decoding, binary stochastic decoding with parallel decoders is proposed in this thesis firstly. It represents stochastic sequences with multiple parallel Tanner graphs and uses hard-decision decoding in the iterative part because of the binary input bits. However, this decoding method has a severe performance loss compared to BP decoding. To avoid this problem, the enhancement method is used to make the binary sequences be non-binary sequences that can form more powerful parallel decoders. Then the non-binary symbols of these new sequences are transformed to their corresponding log-likelihood ratio which enables the iterative part to use BP decoding. In addition, combining with the ML decision of list decoding, the decision part of our stochastic decoder can fully utilize the output to increase the efficiency of the decoding method. After ensuring the performance of our non-binary stochastic decoding to be better than BP decoding, the complexity of the decoder is reduced to save the computational resources. Finally, with constant adjustments, the bit width of each non-binary symbol is determined to be 15, and the sequence length is reduced to 20 which can let the non-binary stochastic decoding has an acceptable complexity while keeping good performance.
Polar codes, being the first class of codes with provable capacity-achieving property, have aroused extensive attention. The belief propagation (BP) algorithm, which is one of the popular decoding approaches for polar codes, possesses inherent high parallelism but also high computational complexity. With low complexity and high fault tolerance, stochastic computing has been well studied and applied to BP decoding for polar codes. However, existing stochastic BP decoders suffer from high decoding latency. In this paper, firstly, a novel dual-bit-wise iterative message update method is proposed for stochastic BP, reducing the decoding latency by more than half. Based on the dual-bit-wise decoding, more special nodes in the factor graph are investigated and then fully exploited to pursue lower decoding complexity than prior arts. Moreover, a well-optimized architecture is developed for the proposed stochastic decoder, where the random number generator (RNG), tracking forecast memory (TFM), and hard decision unit are intelligently designed for reduced hardware cost. Experimental results demonstrate that the presented decoder can exhibit 61.7% lower decoding latency than the state-of-the-art works. Besides, the throughput and hardware efficiency can be improved by nearly2.8×2.8\times2.8×and2.7×2.7\times2.7×, respectively.
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.