An Efficient Decoder Scheme for Double Binary Circular Turbo Codes

Recently, double binary circular turbo code has received tremendous attention. Due to its better error-correcting capability than classical turbo code, it has commenced practical applications in current communication standards, such as DVB-RSC and IEEE 802.16 (Wimax). However current decoding schemes will incur a huge computation complexity. In this paper, authors present a novel decoding scheme for double binary circular turbo codes, which will not only reduce the computation complexity, but also give at least 0.5 dB performance gain compared with current decoding schemes

[1]  Michel Jezequel,et al.  The Turbo Code Standard for DVB-RCS , 2004 .

[2]  Mohammad Reza Soleymani,et al.  Triple-binary circular recursive systematic convolutional turbo codes , 2002, The 5th International Symposium on Wireless Personal Multimedia Communications.

[3]  Claude Berrou,et al.  The advantages of non-binary turbo codes , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

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

[5]  Jung-Fu Cheng,et al.  Linearly approximated log-MAP algorithms for turbo decoding , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[6]  Jian Sun,et al.  The UMTS Turbo Code and an Efficient Decoder Implementation Suitable for Software-Defined Radios , 2001, Int. J. Wirel. Inf. Networks.

[7]  Lajos Hanzo,et al.  Comparative study of turbo decoding techniques: an overview , 2000, IEEE Trans. Veh. Technol..

[8]  J. Vogt,et al.  Improving the max-log-MAP turbo decoder , 2000 .