Simple Metrics for Turbo Code Interleavers

Abstract

In this paper, we consider the searching for good turbo code interleavers. Especially, we focus on the permutation polynomial interleavers. Three key properties (i.e. spread factor, dispersion, and edge effects) of turbo code interleavers are investigated, and two new metrics alpha and beta are proposed for turbo code interleavers. Good permutation polynomial interleavers for turbo codes of various lengths are found by these metrics. Computer simulations show that interleavers with small α or β will lead to the poor performance of turbo codes. Furthermore, turbo codes with good permutation polynomial interleavers found by these metrics always outperform the well-known s-random interleavers. Moreover, turbo codes with good cubic permutation polynomial interleavers found by these metrics are superior to the quadratic permutation polynomial interleavers adopted as turbo code interleavers in the 3rd generation partnership project long term evolution and its advance.

Keywords

• -

References

1. S. Parkvall, A. Furus r, and E. Dahlman, Evolution of LTE toward IMT-advanced. IEEE Commu. Mag., vol.49, no.2, pp.84-91, 2011.
2. E. Dahlman, S. Parkvall, J. Skold and P. Beming, 3G Evolution: HSPA and LTE for Mobile Broadband, New York: Academic Press, 2008.
3. O.Y.~Takesita, Permutation polynomial interleavers: an algebraic-geometric perspective. IEEE Trans. Inform. Theory, vol.53, no.6, pp.2116-2132, 2007.
4. J.~Sun and O.Y.~Takesita, Interleavers for turbo codes using permutation polynomials over integer rings. IEEE Trans. Inform. Theory, vol.51, no.1, pp.101-119, 2005.
5. C. Berrou, A. Glavieux, Near optimum error correcting coding and decoding: turbo-codes. IEEE Trans. Commu., vol.44, no.10, pp.1261-1271, 1996.
6. B.~Vucetic, Y.~Li and L.C.~Perez, Recent advances in turbo code design and theory. Proceedings of IEEE, vol.95, no.6, pp.1323-1344, 2007.
7. C.L.~Perez, J.~Seghers and D.J.~Costell, A distance spectrum interpretation of turbo codes. IEEE Trans. Inform. Theory, vol.42, no.6, pp.1698-1709, 1996.
8. C.~Berrou, S.K.Y.~Saouter, and M.~Jezequel, Designing good permutations for turbo codes:towards a single model. in Proc. International Conference on Communications, vol.1, pp.341-345, Paris, France, 2004.

9. J.~Hokfelt, O.~Edforts, and T.~Maseng, A turbo code interleaver design criterion based on the performance of iterative decoding. IEEE Commun. Lett., vol.5,no.2, pp.52-54, 2001.
10. J.~Hokfelt, O.~Edfors and T.~Maseng, A survey on trellis termination alternatives for turbo codes. in Proc. 49th Vehicular Technology Conference, vol.3, pp.22252229, 1999.
11. O.Y.~Takesita, A new metric for permutation polynomial interleavers. in Proc. 2006 International Symposium on Information Theory, pp.1983-1987, Seattle,USA, 2006.
12. M.~Breiling, A logarithmic upper bound on the minimum distance of turbo codes. IEEE Trans. Inform. Theory, vol.50, no.8, pp.1692-1710, 2004.
13. 3GPP: 3rd Generation Partnership Project. 3GPP TS 36.212. http://www.3gpp.org/ftp/Specs/2010-06/Rel9/36_series/, 2010.
14. H.~Zhao and P.~Fan, Simple method for generating mthorder permutation polynomianls over integer rings. Electron. Lett., vol.43, no.8, pp.449-451, 2007.
15. H.~Zhao and P.~Fan, A note on 'a simple coefficient test for cubic permutation polynomials over integer rings'. IEEE Commun.Lett., vol.11 no.12, pp.991, 2007.
16. J.~Vogt and A.~Finger, Improving the max-log-MAP turbo decoder. Electron. Lett., vol.36, no.23,pp.19371939, 2000.