Design of Three-Dimensional Multiple Slice Turbo Codes

This paper proposes a new approach to designing low-complexity high-speed turbo codes for very low frame error rate applications. The key idea is to adapt and optimize the technique of multiple turbo codes to obtain the required frame error rate combined with a family of turbo codes, called multiple slice turbo codes (MSTCs), which allows high throughput at low hardware complexity. The proposed coding scheme is based on a versatile three-dimensional multiple slice turbo code (3D-MSTC) using duobinary trellises. Simple deterministic interleavers are used for the sake of hardware simplicity. A new heuristic optimization method of the interleavers is described, leading to excellent performance. Moreover, by a novel asymmetric puncturing pattern, we show that convergence can be traded off against minimum distance (i.e., error floor) in order to adapt the performance of the 3D-MSTC to the requirement of the application. Based on this asymmetry of the puncturing pattern, two new adapted iterative decoding structures are proposed. Their performance and associated decoder complexities are compared to an 8-state and a 16-state duobinary 2D-MSTC. For a information frame, the -state trellis 3D-MSTC proposed achieves a throughput of for an estimated area of in a technology. The simulation results show that the FER is below at SNR of , which represents a gain of more than over an -state 2D-MSTC. The union bound gives an error floor that appears at FER below . The performance of the proposed 3D-MSTC for low FERs outperforms the performance of a -state 2D-MSTC with 20% less complexity.

[1]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[2]  Daniel J. Costello,et al.  New low-complexity turbo-like codes , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

[3]  Vincent C. Gaudet,et al.  On multiple slice turbo codes , 2005, Ann. des Télécommunications.

[4]  Joachim Hagenauer,et al.  A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[5]  Claude Berrou,et al.  The ten-year-old turbo codes are entering into service , 2003, IEEE Commun. Mag..

[6]  Patrick Robertson,et al.  A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[7]  Claude Berrou,et al.  Multiple parallel concatenation of circular recursive systematic convolutional (Crsc) codes , 1999, Ann. des Télécommunications.

[8]  Johannes B. Huber,et al.  Design of \Multiple{Turbo{Codes" with Transfer Characteristics of Component Codes , 2002 .

[9]  O. Y. Takeshita,et al.  On the decoding structure for multiple turbo codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[10]  Matthew C. Valenti.  Inserting turbo code technology into the DVB satellite broadcasting system , 2000, MILCOM 2000 Proceedings. 21st Century Military Communications. Architectures and Technologies for Information Superiority (Cat. No.00CH37155).

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

[12]  Hamid R. Sadjadpour,et al.  Interleaver design for multiple turbo codes , 2003, CCECE 2003 - Canadian Conference on Electrical and Computer Engineering. Toward a Caring and Humane Technology (Cat. No.03CH37436).

[13]  Claude Berrou,et al.  Computing the minimum distance of linear codes by the error impulse method , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[14]  S. S. Pietrobon,et al.  Interleaver design for three dimensional turbo codes , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[15]  Ran Ginosar,et al.  Parallel VLSI architecture for MAP turbo decoder , 2002, The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.

[16]  N. J. A. Sloane,et al.  Interleaver design for turbo codes , 2001, IEEE J. Sel. Areas Commun..

[17]  Ove Edfors,et al.  Interleaver design for turbo codes based on the performance of iterative decoding , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[18]  Pedro Velez-Belchi.  Interaction channel for satellite distribution systems , 2000 .

[19]  Ching He.  On the Performance of Low Complexity Multiple Turbo Codes , 2001 .

[20]  S. Dolinar,et al.  Weight distributions for turbo codes using random and nonrandom permutations , 1995 .

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

[22]  J. D. Andersen.  Turbo codes extended with outer BCH code , 1996 .

[23]  Stephen B. Wicker,et al.  Turbo Coding , 1998 .

[24]  P. Sweeney,et al.  Error control coding—fundamentals and applications, by Shu Lin and Daniel J. Costello Jr., Prentice‐Hall International, Hemel Hempstead, Herts., U.K., 1982. No. of pages: 720. Price: £43.20 , 1984 .