The design of structured regular LDPC codes with large girth

Author

Zhang, Haotian ; Moura, José M F

Author_Institution

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

Volume

7

fYear

2003

fDate

1-5 Dec. 2003

Firstpage

4022

Abstract

The paper introduces three new classes of structured regular (n, 2, k) LDPC codes with girth 12, 16, and 20, respectively. These codes are systematically constructed, well structured, and have uniform row and column weights, which make them able to simplify greatly the implementation of LDPC coders. Their large girth improves their decoding performance. Simulation results compare their bit error rate (BER) performance over additive white Gaussian noise (AWGN) channels with randomly constructed LDPC codes. When concatenated with error-correcting codes such as Reed-Solomon codes, LDPC codes with j=2 are promising for data storage and other applications.

Keywords

AWGN channels; Reed-Solomon codes; concatenated codes; error correction codes; error statistics; iterative decoding; parity check codes; AWGN channels; BER; Reed-Solomon codes; additive white Gaussian noise channels; bit error rate; column weights; concatenated codes; data storage; error-correcting codes; iterative decoding; large girth codes; row weights; structured regular LDPC codes; AWGN; Bit error rate; Decoding; Equations; Error correction codes; Geometry; Memory; Parity check codes; Reed-Solomon codes; Sum product algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE

Print_ISBN

0-7803-7974-8

Type

conf

DOI

10.1109/GLOCOM.2003.1258984

Filename

1258984