A class of generalized LDPC codes with fast parallel decoding algorithms

Authors:
Xiuni Wang;Xiao Ma
Affiliations:
Department of Electronics and Communication Engineering, Sun Yat-sen University, Guangzhou, China;Department of Electronics and Communication Engineering, Sun Yat-sen University, Guangzhou, China
Venue:
IEEE Communications Letters
Year:
2009

Citing 5
Cited 0

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Information Theory and Reliable Communication

Information Theory and Reliable Communication
Quasicyclic low-density parity-check codes from circulant permutation matrices

IEEE Transactions on Information Theory
Distance properties of expander codes

IEEE Transactions on Information Theory
Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.02

Visualization

Abstract

Given the Tanner graph of a generalized low-density parity-check (GLDPC) code, the decoding complexity is mainly dominated by the decoding algorithm of subcodes. In this paper, we propose a class of GLDPC codes with fast parallel decoding algorithm. The parity-check matrices of the newly constructed subcodes are composed of several square matrices, which can be viewed as elements of a finite field. Therefore the FFT-based a posteriori probability (APP) algorithm for nonbinary codes can be applied to decode the subcodes. When compared with the trellis-based APP algorithm, the FFT-based APP algorithm can be implemented in parallel and has lower complexity. Simulation results show that the proposed GLDPC codes perform well on AWGN channels.