A class of structured LDPC codes with large girth

Author

Lu, Jin ; Moura, Jose M F ; Niesen, Urs

Author_Institution

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

Volume

1

fYear

2004

fDate

20-24 June 2004

Firstpage

425

Abstract

A class of structured LDPC codes-turbo-structured LDPC (TS-LDPC) codes-composed of two subtrees connected by an interleaver is introduced in this paper. TS-LDPC codes with good girth properties are easy to design: careful design of the interleaver component prevents short cycles in its Tanner graph. A methodology to design TS-LDPC codes with arbitrary column weight j≥2 and arbitrary girth is also presented. In addition, a complexity reduced decoding algorithm is described. Simulation results demonstrate the good performance of TS-LDPC codes when compared to random LDPC codes of the similar size and rate.

Keywords

decoding; error correction codes; error statistics; graph theory; parity check codes; turbo codes; TS-LDPC; Tanner graph; interleaver component; low density parity check code; structured LDPC codes; turbo-structured LDPC codes; Bipartite graph; Concatenated codes; Data storage systems; Decision support systems; Design methodology; Iterative algorithms; Iterative decoding; Magnetic recording; Parity check codes; Tree graphs;

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.1312524

Filename

1312524