32 states double binary turbo code

As a result of exhaustive searches on the set of memory 5 systematic and recursive component encoders, the paper proposes a double binary turbo code (DBTC) incorporating the best encoder found. The proposed DBTC's performances in terms of bit error rate (BER) and frame error rate (FER) show a substantial reduction in the error floor effect and superior convergence to the memory 4 DBTC in DVB-RCS2 standard. In the paper are presented: the family of double-binary convolutional encoders of memory 5, the selection algorithm used to identify the most efficient encoder, the performance obtained by incorporating the selected encoder in the turbo-code. The proposed turbo code works at a distance of about 0.6 dB from the theoretical limit, even for FER values below 10-9. The use of such a turbo code is recommended in applications where a very small error rate is desired.

[1]  Wolfgang Koch,et al.  Optimum and sub-optimum detection of coded data disturbed by time-varying intersymbol interference (applicable to digital mobile radio receivers) , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[2]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.

[3]  Claude Berrou,et al.  Turbo codes with rate-m/(m+1) constituent convolutional codes , 2005, IEEE Transactions on Communications.

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

[5]  Paola Bisaglia,et al.  Stopping Rules for Duo-Binary Turbo Codes and Application to HomePlug AV , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[6]  David J. C. MacKay,et al.  Good Codes Based on Very Sparse Matrices , 1995, IMACC.

[7]  Christian Bettstetter,et al.  Turbo decoding with tail-biting trellises , 1998, 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167).

[8]  Fabrizio Pollara,et al.  Stopping Rules for Turbo Decoders , 2000 .

[9]  Alexandru Isar,et al.  Double-binary RSC convolutional codes selection based on convergence of iterative turbo-decoding process , 2011, ISSCS 2011 - International Symposium on Signals, Circuits and Systems.

[10]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[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]  Jing Sun,et al.  Interleavers for turbo codes using permutation polynomials over integer rings , 2005, IEEE Transactions on Information Theory.

[13]  Youssouf Ould-Cheikh-Mouhamedou.  A Simple and Efficient Method for Lowering the Error Floors of Turbo Codes that Use Structured Interleavers , 2012, IEEE Communications Letters.

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

[15]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[16]  Alexandru Isar,et al.  On the Equivalence Between Canonical Forms of Recursive Systematic Convolutional Transducers Based on Single Shift Registers , 2014, IEEE Access.

[17]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .