Parallel LDPC decoding on a GPU using OpenCL and global memory for accelerators
- Authors
- Hong, Jung-Hyun; Chung, Ki-Seok
- Issue Date
- Aug-2015
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Keywords
- GMAC; LDPC decoder; OpenCL
- Citation
- Proceedings of the 2015 IEEE International Conference on Networking, Architecture and Storage, NAS 2015, pp.353 - 354
- Indexed
- SCOPUS
- Journal Title
- Proceedings of the 2015 IEEE International Conference on Networking, Architecture and Storage, NAS 2015
- Start Page
- 353
- End Page
- 354
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/156616
- DOI
- 10.1109/NAS.2015.7255228
- ISSN
- 0000-0000
- Abstract
- This paper introduces a parallel software decoder of Low Density Parity Check (LDPC) codes with an Open Computing Language (OpenCL) framework including Global Memory for ACcelerators (GMAC). The LDPC code is one of the most popular and strongest error correcting codes for mobile communication systems. OpenCL is an open standard programming framework that supports programming languages and application programming interfaces (APIs) for heterogeneous platforms. GMAC is a software implementation of Asymmetric Distributed Shared Memory (ADSM) that maintains a shared logical memory space for the host to access memory objects in the physical memory of an OpenCL device. In this paper, we parallelize the iterative LDPC decoding steps on a graphics processing unit (GPU) using OpenCL. To improve the performance of the proposed decoder, data transfer optimization techniques between the host and the GPU including pre-pinned OpenCL memory objects for GMAC are applied. In terms of the entire decoding time, the speedup of the proposed LDPC decoder over a conventional OpenCL implementation is 1.28.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 융합전자공학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/156616)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.