Laminated turbo codes

In this paper we introduce a new coding scheme - so-called laminated turbo codes. It is characterized by a block-convolutional structure that enables us to combine the advantages of a convolutional encoder memory and a block-oriented decoding method. We show that this block-convolutional structure is superior in terms of its error correction capability compared to the pure block structure of the corresponding self-concatenated code. Comparisons to turbo codes and multiple turbo codes are also included. Finally, the impact of the inter-block memory is investigated.

[1]  Dariush Divsalar,et al.  Serial and Hybrid Concatenated Codes with Applications , 1997 .

[2]  Michael Lentmaier.  Towards a Theory of Codes for Iterative Decoding , 2003 .

[3]  Michael Lentmaier,et al.  Terminated LDPC convolutional codes with thresholds close to capacity , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[4]  Michael Lentmaier,et al.  An analysis of the block error probability performance of iterative decoding , 2005, IEEE Transactions on Information Theory.

[5]  Michael Lentmaier,et al.  To the Theory of Low-Density Convolutional Codes. II , 2001, Probl. Inf. Transm..

[6]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[7]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.

[8]  D. Divsalar,et al.  Multiple turbo codes for deep-space communications , 1995 .

[9]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.