TS-LDPC Codes: Turbo-Structured Codes With Large Girth

Author

Lu, Jin ; Moura, José M F

Author_Institution

Sun Microsystems, Louisville, CO

Volume

53

Issue

3

fYear

2007

fDate

3/1/2007 12:00:00 AM

Firstpage

1080

Lastpage

1094

Abstract

We consider turbo-structured low-density parity-check (TS-LDPC) codes-structured regular codes whose Tanner graph is composed of two trees connected by an interleaver. TS-LDPC codes with good girth properties are easy to construct: careful design of the interleaver component prevents short cycles of any desired length in its Tanner graph. We present algorithms to construct TS-LDPC codes with arbitrary column weight jges2 and row weight k and arbitrary girth g. We develop a linear complexity encoding algorithm for a type of TS-LDPC codes-encoding friendly TS-LDPC (EFTS-LDPC) codes. Simulation results demonstrate that the bit-error rate (BER) performance at low signal-to-noise ratio (SNR) is competitive with the error performance of random LDPC codes of the same size, with better error floor properties at high SNR

Keywords

error statistics; interleaved codes; parity check codes; trees (mathematics); turbo codes; BER performance; TS-LDPC codes; Tanner graph; bit-error rate; girth property; interleaver component; linear complexity encoding algorithm; low-density parity-check codes; trees; turbo-structured codes; Bit error rate; Data storage systems; Digital communication; Geometry; Iterative decoding; Magnetic recording; Parity check codes; Signal processing algorithms; Signal to noise ratio; Tree graphs; Error floor; girth; interleaver; low-density parity-check (LDPC) codes; turbo-structured;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2006.890690

Filename

4106128