Skip to main content

Accelerating Q-ary Sliding-Window Belief Propagation Algorithm with GPU

  • Conference paper
  • First Online:
IoT as a Service (IoTaaS 2019)

Abstract

In this paper, we present a parallel Sliding-Window Belief Propagation algorithm to decode Q-ary Low-Density-Parity-Codes. The bottlenecks of sequential algorithm are carefully investigated. We use MATLAB platform to develop the parallel algorithm and run these bottlenecks simultaneously on thousands of threads of GPU. The experiment results show that our parallel algorithm achieves 2.3\(\times \) to 30.3\(\times \) speedup ratio than sequential algorithm.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. MacKay, D.J.C.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inf. Theory 45(2), 399–431 (1999)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Davey, M.C., MacKay, D.: Low-density parity check codes over GF(\(q\)). IEEE Commun. Lett. 2(6), 165–167 (1998)

    Article  Google Scholar 

  4. 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 

  5. Fang, Y.: Asymmetric Slepian-Wolf coding of nonstationarily-correlated M-ary sources with sliding-window belief propagation. IEEE Trans. Commun. 61(12), 5114–5124 (2013). https://doi.org/10.1109/TCOMM.2013.111313.130230

    Article  Google Scholar 

  6. Fang, Y., Yang, Y., Shan, B., Stankovic, V.: Joint source-channel estimation via sliding-window belief propagation. IEEE Trans. Commun. (2019, submited)

    Google Scholar 

  7. NVIDIA. http://www.nvidia.com/object/what-is-gpu-computing.html

  8. Shan, B., Fang, Y.: GPU accelerated parallel algorithm of sliding-window belief propagation for LDPC codes. Int. J. Parallel Program. (2019). https://doi.org/10.1007/s10766-019-00632-3

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bowei Shan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Shan, B., Chen, S., Fang, Y. (2020). Accelerating Q-ary Sliding-Window Belief Propagation Algorithm with GPU. In: Li, B., Zheng, J., Fang, Y., Yang, M., Yan, Z. (eds) IoT as a Service. IoTaaS 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 316. Springer, Cham. https://doi.org/10.1007/978-3-030-44751-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-44751-9_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-44750-2

  • Online ISBN: 978-3-030-44751-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics