Skip to main content

Advertisement

Springer Nature Link
Log in

GPU Accelerated Belief Propagation Decoding of Non-Binary LDPC Codes with Parallel and Sequential Scheduling

  • Published:
Journal of Signal Processing Systems Aims and scope Submit manuscript

Abstract

Low-Density Parity-Check (LDPC) codes are very powerful channel coding schemes with a broad range of applications. The existence of low complexity (i.e., linear time) iterative message passing decoders with close to optimum error correction performance is one of the main strengths of LDPC codes. It has been shown that the performance of these decoders can be further enhanced if the LDPC codes are extended to higher order Galois fields, yielding so called non-binary LDPC codes. However, this performance gain comes at the cost of rapidly increasing decoding complexity. To deal with this increased complexity, we present an efficient implementation of a signed-log domain FFT decoder for non-binary irregular LDPC codes which exploits the inherent massive parallelization capabilities of message passing decoders. We employ Nvidia’s Compute Unified Device Architecture (CUDA) to incorporate the available processing power of state-of-the-art Graphics Processing Units (GPUs). Furthermore, we present a CUDA implementation of the signed-log domain FFT decoder using the so-called layered update rule, in which check nodes are updated one after another. This sequential updating of nodes has been shown to converge about twice as fast as the traditional flooding scheme. To achieve a high speedup of the layered CUDA implementation, we employ quasi-cyclic non-binary LDPC codes since they allow to update multiple neighboring check nodes in parallel without any performance loss.

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

Access this article

Log in via an institution

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.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12
Figure 13

Similar content being viewed by others

References

  1. Andrade, J., Falcao, G., Silva, V., Kasai, K. (2013). FFT-SPA non-binary LDPC decoding on GPU. In Proceedings IEEE International Conference on Acoustics, Speech and Signal Processing.

  2. Barnault, L., & Declercq, D. (2003). Fast decoding algorithm for LDPC over G F(2q). In Proceedings IEEE Information Theory Workshop.

  3. Beermann, M., Monzo, E., Schmalen, L., Vary, P. (2013). High speed decoding of non-binary irregular LDPC codes using GPUs. In Proceedings IEEE Workshop on Signal Processing Systems.

  4. Byers, G.J., & Takawira, F. (2004). Fourier transform decoding of non-binary LDPC codes. In Proceedings Southern African Telecommunication Networks and Applications Conference.

  5. Chen, T.P., & Chen, Y.K. (2009). Challenges and opportunities of obtaining performance from multi-core CPUs and many-core GPUs. In Proceedings IEEE International Conference on Acoustics, Speech and Signal Processing.

  6. Cook, S. (2012). Morgan Kaufmann,

  7. Costantini, L.,Matuz, B., Liva, G., Paolini, E., Chiani, M. (2010). On the performance of moderate-length non-binary LDPC codes for space communications. In Proceedings Advanced Satellite Multimedia Systems Conference (ASMA) and Signal Processing for Space Communications Workshop (SPSC).

  8. Davey, M.C., & MacKay, D. J.C. (1998). Low-density parity check codes over GF(q). IEEE Communications Letters 2(6): 165–167.

    Article  Google Scholar 

  9. Davey, M.C., & MacKay, D. J.C. (1998). Low-density parity check codes over GF(q). In Proceedings IEEE Information Theory Workshop.

  10. Gallager, R.G. (1963). M.I.T. Press, Cambridge.

  11. Hagenauer, J., Offer, E., Papke, L. (1996). Iterative decoding of binary block and convolutional codes. IEEE transactions communications 42(2): 429–445.

    MATH  Google Scholar 

  12. Halfhill, T.R. (2008). Microprocessor Report,

  13. Hocevar, D. (2004). A reduced complexity decoder architecture via layered decoding of LDPC codes. In Proceedings IEEE Workshop on Signal Processing Systems.

  14. Hu, X.Y., Eleftheriou, E., Arnold, D.M. (2005). Regular and irregular progressive edge-growth Tanner graphs. IEEE Transactions Informatics Theory 51(1): 386–398.

    Article  MATH  MathSciNet  Google Scholar 

  15. Khronos Group OpenCL – The open standard for parallel programming of heterogeneous systems. http://khronos.org/opencl/.

  16. Leven, A., & Schmalen, L. (2013). Optical Fiber Telecommunications Volume VI-A. In I.P. Kaminow, T. Li, A.E. Willner (Eds.), Chapter 15: Implementation aspects of coherent transmit and receive functions in application-specific integrated circuits. Academic Press.

  17. Liva, G., Matuz, B., Paolini, E., Chiani, M. (2012). Short non-binary IRA codes on large-girth Hamiltonian graphs. In Proceedings IEEE International Conference on Communications.

  18. MacKay, D. J.C., & Neal, R.M. (1995). Good codes based on very sparse matrices. In 5th IMA Conference Cryptography and Coding.

  19. Monzó E. (2010). Massive parallel decoding of low-density parity-check codes using graphic cards. Master’s thesis, RWTH Aachen University & Universidad Politecnica de Valencia. Available online: http://riunet.upv.es/bitstream/handle/10251/13736/Thesis - Enrique Monzó Solves-1.pdf. Accessed 2014.

  20. Nilsen, C.IC., & Hafizovic, I. (2009). Digital beamforming using a GPU. In Proceedings IEEE International Conference on Acoustics, Speech and Signal Processing.

  21. Pearl, J. (1988). Morgan Kaufmann, San Mateo.

  22. Romero, D., & Chang, N. (2012). Sequential decoding of non-binary LDPC codes on graphics processing units. In Proceedings Asilomar Conference on Signals, Systems and Computers.

  23. Song, H., & Cruz, J. (2003). Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording. IEEE Transactions Magnetic 39(2): 1081–1087.

    Article  Google Scholar 

  24. Tanner, R.M. (1981). A recursive approach to low complexity codes. IEEE Transactions Information Theory 27(5): 533–547.

    Article  MATH  MathSciNet  Google Scholar 

  25. Voicila, A., Declercq, D., Verdier, F., Fossorier, M., Urard, P. (2010). Low-complexity decoding for non-binary LDPC codes in high order fields. IEEE Transactions Communication 58(5): 1365–1375.

    Article  Google Scholar 

  26. Wang, G., Shen, H., Yin, B., Wu, M., Sun, Y., Cavallaro, J.R. (2012). Parallel non-binary LDPC decoding on GPU. In Proceed ings Asilomar Conference on Signals, Systems and Computers.

  27. Wymeersch, H., Steendam, H., Moeneclaey, M. (2004). Log-domain decoding of LDPC codes over GF(q). In Proceedings IEEE International Conference On Communications.

  28. Zhang, J., & Fossorier, M. (2002). Shuffled belief propagation decoding. In Proceedings Asilomar Conference on Signals, Systems And Computers.

Download references

Author information

Authors and Affiliations

  1. RWTH Aachen University, Institute of Communication Systems and Data Processing, Aachen, Germany

    Moritz Beermann & Peter Vary

  2. Bell Laboratories, Alcatel-Lucent, Stuttgart, Germany

    Laurent Schmalen

  3. Philips Research, Eindhoven, Netherlands

    Enrique Monzó

Authors
  1. Moritz Beermann
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Enrique Monzó
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Laurent Schmalen
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Peter Vary
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Moritz Beermann.

Additional information

Parts of this paper have been presented at the 2013 IEEE Workshop on Signal Processing System under the title “High Speed Decoding of Non-Binary Irregular LDPC Codes Using GPUs” [3]

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Beermann, M., Monzó, E., Schmalen, L. et al. GPU Accelerated Belief Propagation Decoding of Non-Binary LDPC Codes with Parallel and Sequential Scheduling. J Sign Process Syst 78, 21–34 (2015). https://doi.org/10.1007/s11265-014-0927-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-014-0927-7

Keywords