Geometry based designs of LDPC codes

Author

Zhang, Haotian ; Moura, José M F

Author_Institution

Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA

Volume

2

fYear

2004

fDate

20-24 June 2004

Firstpage

762

Abstract

In this paper we construct three types of low-density parity-check codes with column weight j = 3 based on geometries in graphical models. Low-density parity-check codes with j > 2 are desired because their minimum distance improves linearly with the code block length n. The codes we present here have girth 8 and girth 10. All codes are regular and well-structured. These codes have flexible block lengths and code rates, and may be used in the area of communications and data storage. Our simulation results show that they have better bit-error-rate decoding performance and lower error floors in additive white Gaussian noise channels than randomly constructed low-density parity-check codes.

Keywords

AWGN channels; decoding; error statistics; matrix algebra; parity check codes; LDPC codes; additive white Gaussian noise channels; bit-error-rate; code rates; data storage; low-density parity-check codes; Additive white noise; Computational geometry; Equations; Finance; Floors; Graphical models; Iterative decoding; Memory; Parity check codes; Sum product algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2004 IEEE International Conference on

Print_ISBN

0-7803-8533-0

Type

conf

DOI

10.1109/ICC.2004.1312604

Filename

1312604