Skip to main content
Log in

GPU Accelerated Parallel Algorithm of Sliding-Window Belief Propagation for LDPC Codes

  • Published:
International Journal of Parallel Programming Aims and scope Submit manuscript

Abstract

Low-Density Parity-Check (LDPC) codes are widely used from hard-disk systems to satellite communications. Sliding-Window Belief Propagation (SWBP) is an effective decoding algorithm of LDPC codes for time-varying channels and demonstrates near-optimal performance in many experiments. However, to adaptively find the best window size, SWBP may need very long computing time. Inspired by Graphics Processing Unit and Compute Unified Device Architecture, in this paper we propose a novel method to address the issue of SWBP’s computing complexity. Different from sequential SWBP, we simultaneously compute the metrics of different window sizes in parallel, which enables us to quickly find the best window size. We use coalesced memory access to accelerate reading and writing processes. Registers and shared memory are also considered in our program to reduce memory latency. On the GTX 1080Ti platform, experimental results show that parallel SWBP can achieve about 14 \(\times \) to 118 \(\times \) speedup ratio for different regular LDPC codes, and about 8 \(\times \) to 120 \(\times \) speedup ratio for different irregular LDPC codes, respectively. According to the trend of our experiments, we strongly believe that, as the length of LDPC codes increases, a higher speedup ratio can be obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Rent this article via DeepDyve

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Gallager, R.G.: Low-density parity-check codes. IRE Trans. Inf. Theory 8(1), 21–28 (1962)

    Article  MathSciNet  Google Scholar 

  2. Mackay, D.J.C., Neal, R.M.: Near shannon limit performance of low density parity check codes. Electron. Lett. 32(6), 457–458 (1997)

    Article  Google Scholar 

  3. Fang, Y.: Ldpc-based lossless compression of nonstationary binary sources using sliding-window belief propagation. IEEE Trans. Commun. 60(11), 3161–3166 (2012)

    Article  Google Scholar 

  4. Chang, C.C., Chang, Y.L., Huang, M.Y., Huang, B.: Accelerating regular LDPC code decoders on GPUS. IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens. 4(3), 653–659 (2011)

    Article  Google Scholar 

  5. Dai, Y., Fang, Y., Yang, L., Jeon, G.: Graphics processing unit-accelerated joint-bitplane belief propagation algorithm in DSC. J. Supercomput. 72(6), 2351–2375 (2016)

    Article  Google Scholar 

  6. Pai, Y.S., Shen, Y.C., Wu, J.L.: High efficient distributed video coding with parallelized design for LDPCA decoding on CUDA based GPGPU. J. Vis. Commun. Image Represent. 23(1), 63–74 (2012)

    Article  Google Scholar 

  7. Park, J.Y., Chung, K.S.: Parallel LDPC decoding using CUDA and OPENMP. Eurasip J. Wirel. Commun. Netw. 2011(1), 1–8 (2011)

    Article  Google Scholar 

  8. Falcao, G., Sousa, L., Silva, V.: Massively LDPC decoding on multicore architectures. IEEE Trans. Parallel Distrib. Syst. 22(2), 309–322 (2010)

    Article  Google Scholar 

  9. NVIDIA: cublas. https://developer.nvidia.com/cublas. Accessed 10 Apr 2018

  10. Thrust. http://thrust.github.io/. Accessed 10 Apr 2018

  11. Source codes. http://js.chd.edu.cn/xxgcxy/dbw_en/list.htm. Accessed 10 Apr 2018

Download references

Acknowledgements

We would like to thank colleagues in School of Information Engineering, Chang’an University, for their useful suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yong Fang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work was supported by the Fundamental Research Fund for the Central Universities of China (Grant no. 300102249304), the Provincial Science Foundation of Shannxi, China-Key Project (Grant no. 2016JZ024), and the Provincial Foundation for Sci-Tech Youth Nova of Shaanxi, China (Grant no. 2014KJXX-41).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shan, B., Fang, Y. GPU Accelerated Parallel Algorithm of Sliding-Window Belief Propagation for LDPC Codes. Int J Parallel Prog 48, 566–579 (2020). https://doi.org/10.1007/s10766-019-00632-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10766-019-00632-3

Keywords

Navigation