6898

Parallel LDPC decoding using CUDA and OpenMP

Joo-Yul Park, Ki-Seok Chung
Department of Electronics, Computer & Communication Engineering, Hanyang University, Seoul, Korea
EURASIP Journal on Wireless Communications and Networking, 2011:172, 2011

@article{park2011parallel,

   title={Parallel LDPC decoding using CUDA and OpenMP},

   author={Park, J.Y. and Chung, K.S.},

   journal={EURASIP Journal on Wireless Communications and Networking},

   volume={2011},

   number={1},

   pages={172},

   year={2011},

   publisher={Springer}

}

Download Download (PDF)   View View   Source Source   

1044

views

Digital mobile communication technologies, such as next generation mobile communication and mobile TV, are rapidly advancing. Hardware designs to provide baseband processing of new protocol standards are being actively attempted, because of concurrently emerging multiple standards and diverse needs on device functions, hardware-only implementation may have reached a limit. To overcome this challenge, digital communication system designs are adopting software solutions that use central processing units or graphics processing units (GPUs) to implement communication protocols. In this article we propose a parallel software implementation of low density parity check decoding algorithms, and we use a multi-core processor and a GPU to achieve both flexibility and high performance. Specifically, we use OpenMP for parallelizing software on a multi-core processor and Compute Unified Device Architecture (CUDA) for parallel software running on a GPU. We process information on H-matrices using OpenMP pragmas on a multi-core processor and execute decoding algorithms in parallel using CUDA on a GPU. We evaluated the performance of the proposed implementation with respect to two different code rates for the China Multimedia Mobile Broadcasting (CMMB) standard, and we verified that the proposed implementation satisfies the CMMB bandwidth requirement.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: