A conceptual framework for understanding turbo codes

IEEE Journal on Selected Areas in Communications

Volumn 16, Issue 2, 1998, Pages 245-254

  Battail, G ^a  

^a TELECOM PARISTECH   (France)

Author keywords

Iterated replication decoding; Random like codes; Recursive convolutional codes; Turbo codes

Indexed keywords

BIT ERROR RATE; DECODING; ITERATIVE METHODS; RANDOM PROCESSES; RECURSIVE FUNCTIONS;

RANDOM LIKE CODES; TURBO CODES;

CONVOLUTIONAL CODES;

EID: 0032001727     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.661112     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 ICC'93, Geneva, Switzerland, May 1993, pp. 1064-1070.
2. G. Battail, "Construction explicite de bons codes longs," Ann. Télécommun., vol. 44, pp. 392-404, July-Aug. 1989.
3. E. Biglieri and V. Volski, "The weight distribution of the iterated product of single-parity-check codes is approximately Gaussian," Electron. Lett., vol. 30, pp. 923-924, June 9, 1994.
4. G. Caire, G. Taricco, and G. Battail, "Weight distribution and performance of the iterated product of single parity check codes," in Proc. IEEE GLOBECOM'94, Commun. Theory Mini-Conf., San Francisco, CA, Nov. 1994, pp. 206-211; also, Ann. Télécommun., vol. 50, pp. 752-761, Sept.-Oct. 1995.
5. G. Caire, G. Taricco, and G. Battail, "Weight distribution and performance of the iterated product of single parity check codes," in Proc. IEEE GLOBECOM'94, Commun. Theory Mini-Conf., San Francisco, CA, Nov. 1994, pp. 206-211; also, Ann. Télécommun., vol. 50, pp. 752-761, Sept.-Oct. 1995.
6. G. Battail, "Le décodage pondéré en tant que procédé de réévaluation d'une distribution de probabilité," Ann. Télécommun., vol. 42, pp. 499-509, Sept.-Oct. 1987.
7. J. E. Shore and R. W. Johnson, "Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy," IEEE Trans. Inform. Theory, vol. IT-26, pp. 26-37, Jan. 1980.
8. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, Mar. 1974.
9. C. R. P. Hartmann and L. D. Rudolph, "An optimum symbol-by-symbol decoding rule for linear codes," IEEE Trans. Inform. Theory, vol. IT-22, pp. 514-517, Sept. 1976.
10. G. Battail and M. Decouvelaere, "Décodage par répliques," Ann. Télécommun., vol. 31, pp. 387-404, Nov.-Dec. 1976.
11. G. Battail, "Pondération des symboles décodés par l'algorithme de Viterbi," Ann. T élécommun., vol. 42, pp. 31-38, Jan.-Feb. 1987.
12. J. Hagenauer and P. Hoeher, "A Viterbi algorithm with soft-decision outputs and its applications," in Proc. IEEE GLOBECOM'89, Dallas, TX, Nov. 1989, pp. 47.1.1-17.1.7.
13. M. Moher, "Decoding via cross-entropy minimization," in Proc. IEEE GLOBECOM'93, Houston, TX, Nov. 1993, pp. 809-813.
14. G. Caire, E. Biglieri, and G. Taricco, "The iterated decoding algorithm," presented at the Mediterranean Workshop Coding and Inform. Integrity, Palma de Mallorca, Spain, Feb. 1996.
15. G. Battail, "On random-like codes," in Proc. 4th Canadian Workshop Inform. Theory, Lac Delage, P.Q., Canada, May 1995; Information Theory and Applications II, J.-Y. Chouinard, P. Fortier, and T. A. Gulliver, Eds., Lecture Notes in Computer Science no. 1133. Berlin: Springer, 1996, pp. 76-94.
16. G. Battail, "On random-like codes," in Proc. 4th Canadian Workshop Inform. Theory, Lac Delage, P.Q., Canada, May 1995; Information Theory and Applications II, J.-Y. Chouinard, P. Fortier, and T. A. Gulliver, Eds., Lecture Notes in Computer Science no. 1133. Berlin: Springer, 1996, pp. 76-94.
17. H. Kalouti, D. E. Lazić, and T. Beth, "On the relation between distance distributions of block codes and the binomial distribution," Ann. Télécommun., vol. 50, pp. 762-778, Sept.-Oct. 1995.
18. D. E. Lazić, and V. Šenk, "A direct geometrical method for bounding the error exponent for any specific family of channel codes - Part I: Cutoff rate lower bound for block codes," IEEE Trans. Inform. Theory, vol. 38, pp. 1548-1559, Sept. 1992.
19. P. Robertson, "Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes," in Proc. IEEE GLOBECOM'94, San Francisco, CA, Nov. 1994, pp. 1298-1303.
20. Y. V. Svirid, "Weight distributions and bounds for turbo-codes," European Trans. Telecommun., vol. 6, pp. 543-556, Sept.-Oct. 1995.
21. G. Battail, C. Berrou, and A. Glavieux, "Pseudo-random recursive convolutional coding for near-capacity performance," in Proc. IEEE GLOBECOM'93, Commun. Theory Mini-Conf., vol. 4, Houston, TX, Nov. 1993, pp. 23-27.
22. G. Battail, "Codage convolutif récursif pseudo-aléatoire," Ann. Télécommun., vol. 50, pp. 779-789, Sept.-Oct. 1995.
23. D. Divsalar and F. Pollara, "On the design of turbo codes," Telecommun. Data Acquisition Progr. Rep. 42-123, pp. 99-121, July-Sept. 1995, Jet Propulsion Lab., Pasadena, CA, Nov. 15, 1995.
24. G. D. Forney, Jr, "Convolutional codes I: Algebraic structure," IEEE Trans. Inform. Theory, vol. IT-16, pp. 720-738, Nov. 1970.
25. L. C. Perez, J. Seghers, and D. J. Costello, Jr., "A distance spectrum interpretation of turbo codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1698-1704, Nov. 1996.
26. G. Battail, "Pseudo-random turbo-codes," in Proc. Int. Symp. Signals, Syst., Electron., San Francisco, CA, Oct. 1995, pp. 419-422.
27. S. Riedel and Y. Svirid, "Iterative ('turbo') decoding of threshold decodable codes," European Trans. Telecommun., vol. 6, pp. 527-534, Sept./Oct. 1995.
28. G. Battail, M. Decouvelaere, and P. Godlewski, "Replication decoding," IEEE Trans. Inform. Theory, vol. IT-25, pp. 332-345, May 1979.
29. J. L. Massey, Threshold Decoding. Cambridge, MA: M.I.T. Press, 1963.
30. G. D. Forney, Jr, Concatenated Codes. Cambridge, MA: M.I.T. Press, 1966.
31. G. Battail, "Description polynomial des codes en blocs linéaires," Ann. Télécommun., vol. 38, pp. 3-15, Jan.-Feb. 1983.