A High Throughput Efficient Approach for Decoding LDPC Codes onto GPU Devices

Abstract : Low density parity check (LDPC) decoding process is known as compute intensive. This kind of digital communication applications was recently implemented onto graphic processing unit (GPU) devices for LDPC code performance estimation and/or for real-time measurements. Overall previous studies about LDPC decoding on GPU were based on the implementation of the flooding-based decoding algorithm that provides massive computation parallelism. More efficient layered schedules were proposed in literature because decoder iteration can be split into sublayer iterations. These schedules seem to badly fit onto GPU devices due to restricted computation parallelism and complex memory access patterns. However, the layered schedules enable the decoding convergence to speed up by two. In this letter, we show that: 1) layered schedule can be efficiently implemented onto a GPU device; and 2) this approach--implemented onto a low-cost GPU device--provides higher throughputs with identical correction performances (BER) compared to previously published results.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01002957
Contributor : Bertrand Le Gal <>
Submitted on : Saturday, June 7, 2014 - 7:07:41 PM
Last modification on : Thursday, September 12, 2019 - 8:38:08 AM

Identifiers

Citation

Bertrand Le Gal, Christophe Jégo, Jérémie Crenne. A High Throughput Efficient Approach for Decoding LDPC Codes onto GPU Devices. IEEE Embedded Systems Letters, Institute of Electrical and Electronics Engineers, 2014, 6 (2), pp.29-32. ⟨10.1109/LES.2014.2311317⟩. ⟨hal-01002957⟩

Share

Metrics

Record views

135