By Topic

Constructions of high performance non-binary quasi-cyclic LDPC codes

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
$33 $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

5 Author(s)
Bo Zhou ; Department of Electrical and Computer Engineering, University of California, Davis, 95616, USA ; Li Zhang ; Qin Huang ; Shu Lin
more authors

This paper presents algebraic methods for constructing high performance quasi-cyclic LDPC codes over non-binary fields. Experimental results show that codes constructed based on these methods perform well over the AWGN channel with iterative decoding using a fast Fourier transform based sum-product algorithm. They achieve significantly large coding gains over Reed-Solomon codes of the same lengths and rates decoded with the hard-decision Berlekamp-Massey algorithm, the algebraic soft-decision Kotter-Vardy algorithm, and the Jiang-Narayananpsilas adaptive belief propagation algorithm. Due to their quasi-cyclic structure, these LDPC codes can be efficiently encoded using simple shift-registers with linear complexity. They have a great potential to replace Reed-Solomon codes for some applications in communication or storage systems for combating mixed types of noise and interferences.

Published in:

Information Theory Workshop, 2008. ITW '08. IEEE

Date of Conference:

5-9 May 2008