Construction of Large Girth (3,k) LDPC Codes Based on Cuboid

Author

Xiongfei, Tao ; Weizhong, Liu ; Xuecheng, Zou

Author_Institution

Dept. of Electron. Sci. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan

fYear

2006

fDate

22-24 Sept. 2006

Firstpage

1

Lastpage

4

Abstract

The girth and minimum distance are two important factors of LDPC codes. In this paper we construct a type of LDPC codes with girth 8 based on cuboid. The codes are regular, whose column weight is 3. The minimum distance of the code with exact cuboid structure is only 8 and the distribution of code word weight is not optimal, so we proposed a scheme to improve the codes. The simulation results comparing the bit error rate (BER) performance over AWGN channels with randomly constructed LDPC codes shows that our codes are better than the randomly constructed ones

Keywords

AWGN channels; channel coding; error statistics; parity check codes; random codes; AWGN channels; bit error rate; code word weight; cuboid; large girth LDPC codes; randomly constructed LDPC codes; AWGN channels; Algorithm design and analysis; Bipartite graph; Block codes; Geometry; Iterative algorithms; Iterative decoding; Parity check codes; Performance analysis; Sparse matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2006. WiCOM 2006.International Conference on

Conference_Location

Wuhan

Print_ISBN

1-4244-0517-3

Type

conf

DOI

10.1109/WiCOM.2006.129

Filename

4149306