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

Jin Lu, Jos M. F. Moura
2007 IEEE Transactions on Information Theory  
We consider turbo-structured low-density paritycheck (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 j 2 and row weight k and arbitrary girth g. We develop a linear complexity
more » ... r 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.
doi:10.1109/tit.2006.890690 fatcat:ywbluxer5rhxvlfzwnwykkccge