Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A class of generalized LDPC codes with fast parallel decoding algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiuni Wang ; Dept. of Electron. & Commun. Eng., Sun Yat-sen Univ., Guangzhou, China ; Xiao Ma

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.

Published in:

Communications Letters, IEEE  (Volume:13 ,  Issue: 7 )