Turbo codes with rate-m/(m + 1) constituent convolutional codes

IEEE Transactions on Communications

Volumn 53, Issue 10, 2005, Pages 1630-1638

  Douillard, Catherine ^a   Berrou, Claude ^a  

^a ECOLE DES MINES DE NANTES   (France)

Author keywords

Iterative decoding; Permutation; Rate m (m + 1) recursive systematic convolutional (RSC) code; Tailbiting code; Turbo code (TC)

Indexed keywords

BINARY CODES; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONVOLUTIONAL CODES; DECODING; ENCODING (SYMBOLS); ITERATIVE METHODS; MATRIX ALGEBRA;

ITERATIVE DECODING; PERMUTATION; RECURSIVE SYSTEMATIC CONVOLUTIONAL (RSC) CODE; TAILBITING CODE;

TURBO CODES;

EID: 27644554361     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2005.857165     Document Type: Article

References (28)

1. C. Berrou and A. Glavieux, "Near-optimum error-correcting coding and decoding: Turbo codes," IEEE Trans. Commun., vol. 44, no. 10, pp. 1261-1271, Oct. 1996.
2. P. Robertson and T. Wörz, "Bandwidth-efficient turbo trellis-coded modulation using punctured component codes," IEEE J. Sel. Areas Commun., vol. 16, no. 2, pp. 206-218, Feb. 1998.
3. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Parallel concatenated trellis-coded modulation," in Proc. IEEE Int. Conf. Commun., vol. 2, Dallas, TX, Jun. 1996, pp. 974-978.
4. C. Fragouli and R. D. Wesel, "Turbo-encoder design for symbol-interleaved parallel concatenated trellis-coded modulation," IEEE Trans. Commun., vol. 49, no. 3, pp. 425-435, Mar. 2001.
5. "Interaction Channel for Satellite Distribution Systems," DVB, ETSI EN 301 790, vol. 1.2.2, 2000.
6. "Interaction Channel for Digital Terrestrial Television," DVB, ETSI EN 301 958, vol. 1.1.1, 2002.
7. IEEE Standard for Local and Metropolitan Area Networks, IEEE 802.16a, 2003.
8. S. Riedel, "Symbol-by-symbol MAP decoding algorithm for high-rate convolutional codes that use reciprocal dual codes," IEEE J. Sel. Areas Commun., vol. 16, no. 2, pp. 175-185, Feb. 1998.
9. C. Weiss, C. Bettstetter, S. Riedel, and D. J. Costello, "Turbo decoding with tailbiting trellises," in Proc. IEEE Int. Symp. Signals, Syst., Electron., Pisa, Italy, Oct. 1998, pp. 343-348.
10. R. Johannesson and K. S. Zigangirov, Fundamentals of Convolutional Coding, ser. Digital, Mobile Commun.. New York: IEEE Press, 1999. ch. 4.
11. S. Dolinar and D. Divsalar, "Weight distribution of turbo codes using random and nonrandom permutations," JPL, NASA, TDA Prog. Rep. 42-122, 1995.
12. C. Heegard and S. B. Wicker, Turbo Coding. Norwell, MA: Kluwer, 1999, ch. 3.
13. S. Crozier, J. Lodge, P. Guinand, and A. Hunt, "Performance of turbo codes with relatively prime and golden interleaving strategies," in Proc. 6th Int. Mobile Satellite Conf., Ottawa, ON, Canada, Jun. 1999, pp. 268-275.
14. C. Berrou, Y. Saouter, C. Douillard, S. Kerouédan, and M. Jézéquel, "Designing good permutations for turbo codes: Toward a single model," in Proc. IEEE Int. Conf. Commun., Pads, France, Jun. 2004, pp. 341-345.
15. S. Benedetto and G. Montorsi, "Design of parallel concatenated convolutional codes," IEEE Trans. Commun., vol. 44, no. 5, pp. 591-600, May 1996.
16. E. Boutillon and D. Gnaedig, "Maximum spread of D-dimensional multiple turbo codes," IEEE Trans. Commun., vol. 53, no. 8, pp. 1237-1242, Aug. 2005.
17. C. Berrou, E. A. Maury, and H. Gonzalez, "Which minimum Hamming distance do we really need?," in Proc. 3rd Symp. Turbo Codes, Brest, France, Sep. 2003, pp. 141-148.
18. C. Berrou, M. Jézéquel, C. Douillard, and S. Kerouédan, "The advantages of nonbinary turbo codes," in Proc. Inf. Theory Workshop, Cairns, Australia, Sep. 2001, pp. 61-63.
19. C. Berrou, "Some clinical aspects of turbo codes," in Proc. Int. Symp. Turbo Codes Related Top., Brest. France, Sep. 1997, pp. 26-31.
20. C. Berrou and M. Jézéquel, "Nonbinary convolutional codes for turbo coding," Electron. Lett., vol. 35, no. 1, pp. 39-40, Jan. 1999.
21. H. Lin and D. G. Messerschmitt, "Algorithms and architectures for concurrent Viterbi decoding," in Proc. IEEE Int. Conf. Commun., Boston, MA, Jun. 1989, pp. 836-840.
22. L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol-error rate," IEEE Trans. Inf. Theory, vol, IT-20, no. 3, pp. 284-287, Mar. 1974.
23. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "A soft-input soft-output APP module for iterative decoding of concatenated codes," IEEE Commun. Lett., vol. 1, pp. 22-24, Jan. 1997.
24. P. Robertson, P. Hoeher, and E. Villebrun, "Optimal and suboptimal maximum a posteriori algorithms suitable for turbo decoding," Eur. Trans. Telecommun., vol. 8, pp. 119-125, Mar./Apr. 1997.
25. J. Vogt and A. Finger, "Improving the max-log-MAP turbo decoder," Electron. Lett., vol. 36, no. 23, pp. 1937-1939, Nov. 2000.
26. A. S. Barbulescu, "Iterative decoding of turbo codes and other concatenated codes," Ph.D. dissertation, Univ. South Australia, 1996.
27. R. Garello and A. V. Casado, "The all-zero iterative decoding algorithm for turbo code minimum distance computation," in Proc. Int. Conf. Commun., Paris, France, Jun. 2004, pp. 361-364.
28. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968, sec. 5.6.