OpenCL/CUDA algorithms for parallel decoding of any irregular LDPC code using GPU

TL;DR

This paper introduces a scalable parallel LDPC decoding algorithm suitable for irregular codes, leveraging GPU architectures with OpenCL and CUDA, enabling efficient decoding without node degree limitations.

Contribution

It presents a novel parallel decoding approach for irregular LDPC codes that includes syndrome calculation and is adaptable to GPU and FPGA platforms.

Findings

Efficient decoding of irregular LDPC codes on GPU using OpenCL and CUDA.

Scalable approach supports any irregular LDPC code without maximum node degree constraints.

Performance evaluation demonstrates effectiveness on parallel hardware.

Abstract

The development of multicore architectures supporting parallel data processing has led to a paradigm shift, which affects communication systems significantly. This article provides a scalable parallel approach of an iterative LDPC decoder, presented in a tutorial-based style. It is suitable for decoding any irregular LDPC code without the limitation of the maximum node degree, and it includes a parallel calculation of the syndrome. This is the main difference from algorithms presented so far. The proposed approach can be implemented in applications supporting massive parallel computing, such as GPU or FPGA devices. The implementation of the LDPC decoder with the use the OpenCL and CUDA frameworks is discussed and the performance evaluation is given at the end of this contribution.