Abstract
In this work, we propose an efficient quasi-cyclic LDPC (QC-LDPC) decoder simulator which runs on graphics processing units (GPUs). We optimize the data structures of the messages used in the decoding process such that both the read and write processes can be performed in a highly parallel manner by the GPUs. We also propose a highly efficient algorithm to convert the data structure of the messages from one form to another with very little latency. Finally, with the use of a large number of cores in the GPU to perform the simple computations simultaneously, our GPU-based LDPC decoder is found to run at around 100 times faster than a CPU-based simulator.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
The current generation CUDA architecture, code named fermi, http://www.nvidia.com/object/fermi_architecture.html
Chen, J., Dholakia, A., Eleftheriou, E., Fossorier, M., Hu, X.: Reduced-Complexity decoding of LDPC codes. IEEE Transactions on Communications 53(8), 1288–1299 (2005), doi:10.1109/TCOMM.2005.852852
Falcao, G., Silva, V., Sousa, L.: How GPUs can outperform ASICs for fast LDPC decoding. In: Proceedings of the 23rd International Conference on Supercomputing, pp. 390–399. ACM, Yorktown Heights (2009), http://portal.acm.org/citation.cfm?id=1542275.1542330
Falcao, G., Sousa, L., Silva, V.: Massive parallel LDPC decoding on GPU. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 83–90. ACM, Salt Lake City (2008), http://portal.acm.org/citation.cfm?id=1345206.1345221
Fossorier, M.: Quasicyclic low-density parity-check codes from circulant permutation matrices. IEEE Transactions on Information Theory 50(8), 1788–1793 (2004), doi:10.1109/TIT.2004.831841
Gallager, R.G.: Low-Density Parity-Check Codes. The MIT Press, Cambridge (1963)
Hu, X., Eleftheriou, E., Arnold, D., Dholakia, A.: Efficient implementations of the sum-product algorithm for decoding LDPC codes. In: IEEE Global Telecommunications Conference, GLOBECOM 2001, vol. 2, p. 1036E (2001)
MacKay, D.: Good error-correcting codes based on very sparse matrices. IEEE Transactions on Information Theory 45(2), 399–431 (1999)
Nvidia, C.: CUDA C best practices guide version 3.2. Tech. rep., NVIDIA Corporation (2010)
Richardson, T., Shokrollahi, M., Urbanke, R.: Design of capacity-approaching irregular low-density parity-check codes. IEEE Transactions on Information Theory 47(2), 619–637 (2001)
Richardson, T., Urbanke, R.: Efficient encoding of low-density parity-check codes. IEEE Transactions on Information Theory 47(2), 638–656 (2001)
Tam, W., Lau, F., Tse, C.: A class of QC-LDPC codes with low encoding complexity and good error performance. IEEE Communications Letters 14(2), 169–171 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, Y., Chen, X., Sham, CW., Tam, W.M., Lau, F.C.M. (2011). Efficient Decoding of QC-LDPC Codes Using GPUs. In: Xiang, Y., Cuzzocrea, A., Hobbs, M., Zhou, W. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2011. Lecture Notes in Computer Science, vol 7016. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24650-0_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-24650-0_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24649-4
Online ISBN: 978-3-642-24650-0
eBook Packages: Computer ScienceComputer Science (R0)