Construction of Quasi-Cyclic LDPC Codes Based on the Primitive Elements of Finite Fields

Author

Song, Shumei ; Lan, Lan ; Lin, Shu ; Abdel-Ghaffar, Khaled

Author_Institution

Dept. of Electr. & Comput. Eng., California Univ., Davis, CA

fYear

2006

fDate

22-24 March 2006

Firstpage

835

Lastpage

838

Abstract

This paper presents an algebraic method for constructing quasi-cyclic LDPC codes based on the primitive elements of finite fields. The construction gives a class of efficiently encodable quasi-cyclic LDPC codes. Experimental results show that the constructed codes decoded with iterative decoding using the sum-product algorithm perform well over the AWGN channel.

Keywords

AWGN channels; algebraic codes; channel coding; cyclic codes; iterative decoding; parity check codes; AWGN channel; algebraic method; iterative decoding; low density parity check; primitive elements of finite field; quasicyclic LDPC code construction; sum-product algorithm; AWGN channels; Block codes; Galois fields; Iterative decoding; Null space; Parity check codes; Reed-Solomon codes; Sparse matrices; Sum product algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Sciences and Systems, 2006 40th Annual Conference on

Conference_Location

Princeton, NJ

Print_ISBN

1-4244-0349-9

Electronic_ISBN

1-4244-0350-2

Type

conf

DOI

10.1109/CISS.2006.286583

Filename

4067924

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3283871