Extended tail-biting schemes for turbo codes

In this letter, we investigate the problem of using tailbiting recursive systematic convolutional (RSC) codes in turbo codes. Tailbiting is not always possible for a given RSC code with fixed length. We propose an extended tailbiting method for RSC codes and compare it with another extension method proposed by Van Stralen, et al. (IEE Electron. Lett., vol. 35, pp. 1461-1462, 1999). Several schemes using these extended tailbiting RSC codes in turbo code systems are developed and compared.

[1]  John B. Anderson,et al.  Tailbiting MAP Decoders , 1998, IEEE J. Sel. Areas Commun..

[2]  Rolf Johannesson,et al.  A note on tailbiting codes and their feedback encoders , 2002, IEEE Trans. Inf. Theory.

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

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

[5]  Sergio Benedetto,et al.  Unveiling turbo codes: some results on parallel concatenated coding schemes , 1996, IEEE Trans. Inf. Theory.

[6]  J. B. Anderson,et al.  Tailbiting and decoding recursive systematic codes , 1999 .

[7]  Ove Edfors,et al.  On the theory and performance of trellis termination methods for turbo codes , 2001, IEEE J. Sel. Areas Commun..