Browse

Massively parallel implementation of cyclic LDPC codes on a general purpose graphic processing unit

Cited 0 time in Web of Science Cited 11 time in Scopus
Authors
Ji, Hyunwoo; Cho, Junho; Sung, Wonyong
Issue Date
2009-10
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
IEEE Workshop on Signal Processing Systems, 7-9 Oct. 2009, Tampere, Finland
Keywords
low-density parity-check (LDPC) codesCompute Unified Device Architecture (CUDA)general purpose graphics processing units (GPGPUs)parallel processing
Description
2009 IEEE Workshop On Signal Processing Systems (SiPS)
Tampere, Finland
2009-10-07 ~ 2009-10-09
Abstract
Simulation of low-density parity-check (LDPC) codes frequently takes several days, thus the use of general purpose graphics processing units (GPGPUs) is very promising. However, GPGPUs are designed for compute-intensive applications, and they are not optimized for data caching or control management. In LDPC decoding, the parity check matrix H needs to be accessed at every node updating process, and the size of H matrix is often larger than that of GPU on-chip memory especially when the code-length is long or the weight is high. In this work, the parity check matrix of cyclic or quasi-cyclic LDPC codes is greatly compressed by exploiting the periodic property of the matrix. In our experiments, the Compute Unified Device Architecture (CUDA) of Nvidia is used. With the (1057, 813) and (4161, 3431) projective geometry (PG)–LDPC codes, the execution speed of the proposed method is more than twice of the reference implementations that do not exploit the cyclic property of the parity check matrices.
Language
English
URI
http://www.sips09.com

https://hdl.handle.net/10371/70477
DOI
https://doi.org/10.1109/SIPS.2009.5336268
Files in This Item:
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Electrical and Computer Engineering (전기·정보공학부)Others_전기·정보공학부
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse