Convergence analysis of generalized serial message-passing schedules
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Analysis of LDPC decoding schedules
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Design of turbo-like codes for short frames
IEEE Communications Letters
Structure, property, and design of nonbinary regular cycle codes
IEEE Transactions on Communications
Linear time encoding of LDPC codes
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
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