Analysis of three-dimensional turbo codes

Our paper presents a detailed study of the three-dimensional turbo code (3D TC). This code which combines both parallel and serial concatenation is derived from the classical TC by concatenating a rate-1 post-encoder at its output. The 3D TC provides very low error rates for a wide range of block lengths and coding rates, at the expense of an increase in complexity and a loss in convergence. This paper deals with the performance improvement of the 3D TC. First, we optimize the distance spectrum of the 3D TC by means of the adoption of a non regular post-encoding pattern. This allows us to increase the minimum hamming distance (MHD) and thereby to improve the performance at very low error rates. Then, we propose a time varying construction of the post-encoded parity in order to reduce the observable loss of convergence at high error rates. Performance comparisons are made between the 3GPP2 standardized TC and the corresponding 3D code. The different improvement stages are illustrated with simulation results, asymptotical bounds, and EXIT charts.

[1]  Christian Bettstetter,et al.  Code construction and decoding of parallel concatenated tail-biting codes , 2001, IEEE Trans. Inf. Theory.

[2]  N. Wehn,et al.  Duo Binary Turbo Decoder Hardware Implementation , 2009 .

[3]  C. Douillard,et al.  Adding a Rate-1 Third Dimension to Turbo Codes , 2007, 2007 IEEE Information Theory Workshop.

[4]  C. Douillard,et al.  Reducing the convergence loss of 3-dimensional turbo codes , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

[5]  Andres I. Vila Casado,et al.  The all-zero iterative decoding algorithm for turbo code minimum distance computation , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[6]  Giuseppe Caire,et al.  Bit-Interleaved Coded Modulation , 2008, Found. Trends Commun. Inf. Theory.

[7]  D.K. Ben Ismail,et al.  Improving 3-dimensional turbo codes using 3GPP2 interleavers , 2009, 2009 First International Conference on Communications and Networking.

[8]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[9]  Jing Sun,et al.  Extended tail-biting schemes for turbo codes , 2005, IEEE Communications Letters.

[10]  Claude Berrou,et al.  Improving the distance properties of turbo codes using a third component code: 3D turbo codes - [transactions letters] , 2009, IEEE Transactions on Communications.

[11]  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.

[12]  Dariush Divsalar,et al.  Soft-Output Decoding Algorithms in Iterative Decoding of Turbo Codes , 1996 .

[13]  S. ten Brink,et al.  Code doping for triggering iterative decoding convergence , 2001 .

[14]  David Gnaedig,et al.  Maximum spread of D-dimensional multiple turbo codes , 2005, IEEE Transactions on Communications.