Joint permutor analysis and design for multiple turbo codes

IEEE Transactions on Information Theory

Volumn 52, Issue 9, 2006, Pages 4068-4083

  He, Ching ^a,b   Lentmaier, Michael ^a,c   Costello Jr , Daneil J ^a   Zigangirov, Kamil Sh ^a  

^a University of Notre Dame   (United States)

^b SEAGATE TECHNOLOGY   (United States)

^c GERMAN AEROSPACE CENTER DLR   (Germany)

Author keywords

Interleaver; Minimum distance; Multiple turbo code; Pemutor; Summary distance; Turbo code

Indexed keywords

ALGORITHMS; ENCODING (SYMBOLS); PROBABILITY; RANDOM PROCESSES;

MINIMUM DISTANCE; MULTIPLE TURBO CODE; PERMUTOR; SUMMARY DISTANCE;

TURBO CODES;

EID: 33748560140     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.879973     Document Type: Article

References (31)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near shannon limit error correcting coding and decoding: Turbo codes," in Proc. IEEE Int. Conf. Communications, Geneva, Switzerland, May 1993, pp. 1064-1070.
2. L. Perez, J. Seghers, and D. J. Costello Jr., "A distance spectrum interpretation of turbo codes," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1698-1709, Nov. 1996.
3. S. Benedetto and G. Montorsi, "Unveiling turbo codes: Some results on parallel concatenated coding schemes," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 409-429, Mar. 1996.
4. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 429-445, Mar. 1996.
5. S. Dolinar and D. Divsalar, "Weight distributions for turbo codes using random and nonrandom permutations," JPL TDA Progr. Report, pp. 56-65, Aug. 1995.
6. O. Takeshita and D. J. Costello Jr., "New deterministic interleaver designs for turbo codes," IEEE Trans. Inf. Theory, vol. 46, no. 6, pp. 1988-2006, Sep. 2000.
7. S. Crozier and P. Guinand, "High-performance low-memory interleaver banks for turbo-codes," in Proc. IEEE 54th Vehicular Technology Conf., Atlantic City, NJ, Oct. 2001, vol. 4, pp. 2394-2398.
8. J. Hokfelt, O. Edfors, and T. Maseng, "A turbo code interleaver design criterion based on the performance of iterative decoding," IEEE Commu. Lett., vol. 5, no. 2, pp. 52-54, Feb. 2001.
9. F. Daneshgaran and M. Laddomada, "Optimized prunable single-cycle interleavers for turbo codes," IEEE Trans. Commun., vol. 52, no. 6, pp. 899-909, Jun. 2004.
10. S. Crozier and P. Guinand, "Distance upper bounds and true minimum distance results for turbo-codes designed with DRP interleavers," in Proc. 3rd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2003, pp. 169-172.
11. R. Garello, P. Pierleoni, and S. Benedetto, "Computing the free distance of turbo codes and serially concatenated codes with interleavers: Algorithms and applications," IEEE J. Sel. Areas Commun., vol. 19, no. 5, pp. 800-812, May 2001.
12. E. Rosnes and Ø. Ytrehus, "Improved algorithms for high rate turbo code weight distribution calculation," in Proc. 10th Int. Conf. Telecommunications, Papeete, French Polynesia, Feb. 2003, vol. 1, pp. 104-111.
13. E. Rosnes and Ø. Ytrehus, "An efficient algorithm for tailbiting turbo code weight distribution calculation," in Proc. 3rd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2003, pp. 439-442.
14. C. Berrou, S. Vaton, M. Jezequel, and C. Douillard, "Computing the minimum distance of linear codes by the error impulse method," in Proc. IEEE Global Telecommunications Conf., Taipei, Taiwan, Nov. 2002, vol. 2, pp. 1017-1020.
15. D. V. Truhachev, M. Lentmaier, and K. Sh. Zigangirov, "Some results concerning design and decoding of turbo-codes," Probl. Inf. Transm., vol. 37, pp. 190-205, Jul./Sept. 2001.
16. M. Breiling, "A logarithmic upper bound on the minimum distance of turbo codes," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1692-1710, Aug. 2004.
17. A. Perotti and S. Benedetto, "A new upper bound on the minimum distance of turbo codes," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 2985-2997, Dec. 2004.
18. D. Divsalar and F. Pollara, "Multiple turbo codes for deep-space communications," JPL TDA Progr. Rep., pp. 66-77, May 1995.
19. N. Kahale and R. Urbanke, "On the minimum distance of parallel and serially concatenated codes," in Proc. IEEE Int. Symp. Information Theory, Cambridge, MA, Aug. 1998, p. 31.
20. S. ten Brink, "Convergence of multi-dimensional iterative decoding schemes," in Proc. 35th Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, Nov. 2001, vol. 1, pp. 270-274.
21. C. He, A. Banerjee, D. J. Costello Jr., and P. C. Massey, "On the performance of low complexity multiple turbo codes," in Proc. 40th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2002, pp. 1168-1177.
22. free in MPCCC systems," IEEE Trans. Commun., vol. 51, no. 3, pp. 318-325, Mar. 2003.
23. A. Huebner, K. Sh. Zigangirov, and D. J. Costello Jr., "A new cyclebased joint permutor design for multiple turbo codes," IEEE Trans. Commun., submitted for publication.
24. C. He, D. J. Costello Jr., A. Huebner, and K.Sh. Zigangirov, "Joint interleaver design for low complexity multiple turbo codes," in Proc. 41th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2003, pp. 1298-1306.
25. E. Boutillon and D. Gnaedig, "Maximum spread of d-dimensional multiple turbo codes," IEEE Trans. Commun. [Online]. Available: Http:// lester.univ-ubs.fr:8080/ boutillon/articles/IEEE_COM⊃read.pdf, to be published
26. S. Crozier, P. Guinand, J. Lodge, and A. Hunt, "Construction and performance of new tail-biting turbo codes," in Proc. 6th Int. Workshop on Digital Signal Processing Techniques for Space Applications, Estec, Noordwijk, The Netherlands, Sep. 1998, Paper 1.3.
27. R. Johannesson and K. Sh. Zigangirov, Fundamentals of Convolutional Coding. Piscataway, NJ: IEEE Press, 1999.
28. W. W. Peterson and E. J. Weldon Jr., Error-Correcting Codes, 2nd ed. Cambridge, MA: MIT Press, 1972.
29. M. Oberg and P. H. Siegel, "Application of distance spectrum analysis to turbo code performance improvement," in Proc. 35th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 1997, pp. 701-710.
30. S. Crozier, P. Guinand, and A. Hunt, "Computing the minimum distance of turbo-codes using iterative decoding techniques," in Proc. 22nd Bienn. Symp. Communications, Kingston, ON, Canada, May 2004, pp. 306-308.
31. C. Berrou, E. Maury, and H. Gonzalez, "Which minimum hamming distance do we really need?," in Proc. 3rd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2003, pp. 141-148.