Transactions Papers - Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach

Author

Zeng, Lingqi ; Lan, Lan ; Tai, Ying Y. ; Song, Shumei ; Lin, Shu ; Abdel-Ghaffar, Khaled

Author_Institution

Link-A-Media Devices Corp., Santa Clara

Volume

56

Issue

4

fYear

2008

fDate

4/1/2008 12:00:00 AM

Firstpage

545

Lastpage

554

Abstract

This paper is concerned with construction of efficiently encodable nonbinary quasi-cyclic LDPC codes based on finite fields. Four classes of nonbinary quasi-cyclic LDPC codes are constructed. Experimental results show that codes constructed perform well with iterative decoding using a fast Fourier transform based q-ary sum-product algorithm and they achieve significant coding gains over Reed-Solomon codes of the same lengths and rates decoded with either algebraic hard- decision Berlekamp-Massey algorithm or algebraic soft-decision Kotter-Vardy algorithm.

Keywords

fast Fourier transforms; iterative decoding; matrix algebra; parity check codes; fast Fourier transform; finite field approach; iterative decoding; nonbinary quasi-cyclic LDPC codes; q-ary sum-product algorithm; Algorithm design and analysis; Belief propagation; Fast Fourier transforms; Galois fields; Iterative algorithms; Iterative decoding; Parity check codes; Performance gain; Reed-Solomon codes; Sum product algorithm;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2008.060024

Filename

4489627