Two Algebraic Methods for Constructing Efficiently Encodable Quasi-Cyclic LDPC Codes

Author

Liu, Keke ; Fei, Zesong ; Kuang, Jingming

Author_Institution

Dept. of E.E., Beijing Inst. of Technol., Beijing

fYear

2008

fDate

12-14 Oct. 2008

Firstpage

1

Lastpage

4

Abstract

In this paper, we present two algebraic methods for constructing Quasi-Cyclic LDPC codes. The first method is based on the quadratic residues modulo p (where p is a prime), the second method is based on the multiplicative inverses in finite fields. The codes constructed based on these methods are efficiently encodable and have a girth at least 6. Simulation results show that with SPA decoding, the constructed codes based on our methods perform very well over the AWGN channel compared to some other types of famous codes, such as random Mackay code or extended EG-LDPC code recommended by NASA.

Keywords

AWGN channels; algebra; cyclic codes; parity check codes; AWGN channel; NASA; additive white Gaussian noise channel; algebraic methods; extended EG-LDPC code; finite field multiplicative inverses; low density parity check codes; quadratic residues; quasi-cyclic LDPC codes; random Mackay code; AWGN channels; Channel coding; Floors; Galois fields; Geometry; Iterative decoding; NASA; Parity check codes; Quantum cascade lasers; Satellite communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on

Conference_Location

Dalian

Print_ISBN

978-1-4244-2107-7

Electronic_ISBN

978-1-4244-2108-4

Type

conf

DOI

10.1109/WiCom.2008.360

Filename

4678269