Interleaving and termination in unpunctured symmetric turbo codes

Buy article PDF
© IEE
Published 14/07/2012

Abstract

The turbo code interleaver design problem is considered for large block sizes, where the effect of trellis termination is less marked. The performance is compared for various interleavers with a similar block size, including an implementation of the uniform interleaver. An optimised interleaver design technique based on simulated annealing is proposed. The results obtained show that the error performance may be significantly improved without increasing the delay. Finally, interleaver design for small turbo codes is considered. In this case it is shown that while correct termination improves the performance for an average interleaver, its effect on turbo codes with optimised interleavers is negligible. Using the proposed simulated annealing design technique it is easier to include restrictions which make the interleaver correctly-terminating or odd–even. While the S-random algorithm serves well for specifying interleaver spread, the authors believe that their algorithm is better suited for more sophisticated design criteria.

Inspec keywords: interleaved codes; turbo codes; random processes; simulated annealing

Other keywords: simulated annealing; large block sizes; average interleaver; simulated annealing design; code termination; error performance; unpunctured symmetric turbo codes; trellis termination; turbo code interleaver design; optimised interleaver design; uniform interleaver; S-random algorithm; interleaver spread

Subjects: Other topics in statistics; Codes; Optimisation techniques

References

    1. 1)
      • Ramsey, J.L.: `Realization of optimum interleavers', IEEE Trans. Inf. Theory, 1970, (3), p. 338-345
    2. 2)
      • Berrou, C., Glavieux, A., Thitimajshima, P.: `Near Shannon limit error-correcting coding and decoding: Turbo-codes', Proceedings of the IEEE international conference on Communications, May 1993, Geneva, Switzerland, p. 1064–1070
    3. 3)
      • Divsalar, D., Pollara, F.: `Turbo codes for deep-space communications', 42–120, TDA progress report, 15 Feb. 1995
    4. 4)
      • Divsalar, D., Pollara, F.: `Multiple turbo codes for deep-space communications', 42–121, TDA progress report, 15 May 1995
    5. 5)
    6. 6)
      • Berrou, C., Glavieux, A.: `Near optimum error correcting coding and decoding: Turbo-codes', IEEE Trans. Commun., 1996, 44, (10), p. 1261-1271
    7. 7)
    8. 8)
      • Andrews, K.S., Heegard, C., Kozen, D.: `A theory of interleavers', tr97-1634, Technical report, June 1997
    9. 9)
      • Andrews, K.S., Heegard, C., Kozen, D.: `Interleaver design methods for turbo codes', Proceedings of the IEEE international symposium on Information theory, 16–21 Aug. 1998, Cambridge, MA, USA, p. 420
    10. 10)
      • Hokfelt, J., Edfors, O., Maseng, T.: `Interleaver design for turbo codes based on the performance of iterative decoding', Proceedings of the IEEE international conference on Communications, 6–10 June 1999, Vancouver, BC, Canada
    11. 11)
      • Yuan, J., Vucetic, B., Feng, W.: `Combined turbo codes and interleaver design', Proceedings of the IEEE international symposium on Information theory, 16–21 Aug. 1998, Cambridge, MA, USA
    12. 12)
      • Yuan, J., Vucetic, B., Feng, W.: `Combined turbo codes and interleaver design', IEEE Trans. Commun., 1999, 47, (4), p. 487-487
    13. 13)
      • van Laarhoven, P.J.M., Aarts, E.H.L.: Simulated annealing: Theory and applications, 1987 (D. Reidel Publishing CompanyHolland)
    14. 14)
      • Briffa, J.A.: `Interleavers for turbo codes.', 1999, MPhil, University of Malta, Faculty of Engineering
    15. 15)
      • Divsalar, D., Pollara, F.: `On the design of turbo codes', 42–123, TDA progress report, 15th Nov. 1995
    16. 16)
    17. 17)
      • Barbulescu, S.A.: `Iterative decoding of turbo codes and other concatenated codes.', Feb. 1996, PhD, University of South Australia, School of Electronic Engineering, Faculty of Engineering
Print this page
This is a required field
Please enter a valid email address