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.
Access this article
Rent this article via DeepDyve
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10766-019-00632-3/MediaObjects/10766_2019_632_Fig1_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10766-019-00632-3/MediaObjects/10766_2019_632_Fig2_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10766-019-00632-3/MediaObjects/10766_2019_632_Fig3_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10766-019-00632-3/MediaObjects/10766_2019_632_Fig4_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10766-019-00632-3/MediaObjects/10766_2019_632_Fig5_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10766-019-00632-3/MediaObjects/10766_2019_632_Fig6_HTML.png)
Similar content being viewed by others
References
Gallager, R.G.: Low-density parity-check codes. IRE Trans. Inf. Theory 8(1), 21–28 (1962)
Mackay, D.J.C., Neal, R.M.: Near shannon limit performance of low density parity check codes. Electron. Lett. 32(6), 457–458 (1997)
Fang, Y.: Ldpc-based lossless compression of nonstationary binary sources using sliding-window belief propagation. IEEE Trans. Commun. 60(11), 3161–3166 (2012)
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)
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)
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)
Park, J.Y., Chung, K.S.: Parallel LDPC decoding using CUDA and OPENMP. Eurasip J. Wirel. Commun. Netw. 2011(1), 1–8 (2011)
Falcao, G., Sousa, L., Silva, V.: Massively LDPC decoding on multicore architectures. IEEE Trans. Parallel Distrib. Syst. 22(2), 309–322 (2010)
NVIDIA: cublas. https://developer.nvidia.com/cublas. Accessed 10 Apr 2018
Thrust. http://thrust.github.io/. Accessed 10 Apr 2018
Source codes. http://js.chd.edu.cn/xxgcxy/dbw_en/list.htm. Accessed 10 Apr 2018
Acknowledgements
We would like to thank colleagues in School of Information Engineering, Chang’an University, for their useful suggestions.
Author information
Authors and Affiliations
Corresponding author
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
About this article
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
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10766-019-00632-3