A distance spectrum interpretation of turbo codes

IEEE Transactions on Information Theory

Volumn 42, Issue 6 PART 1, 1996, Pages 1698-1709

  Ferez, Lance C ^a,d   Seghers, Jan ^b,c   Costello Jr , Daniel J ^d  

^a UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

^b UNIVERSITY OF NEBRASKA LINCOLN   (United States)

^c ETH ZURICH   (Switzerland)

^d University of Notre Dame   (United States)

Author keywords

Convolutional codes; Distance spectrum; Turbo codes

Indexed keywords

CODING ERRORS; COMPUTER SIMULATION; CONVOLUTIONAL CODES; ENCODING (SYMBOLS); POLYNOMIALS; SIGNAL TO NOISE RATIO; SPECTRUM ANALYSIS;

DISTANCE SPECTRUM; SPECTRAL THINNING PROCESS; TURBO CODES; TURBO ENCODER;

CODES (SYMBOLS);

EID: 0030290420     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556666     Document Type: Article

References (45)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, Near Shannon limit error-correcting coding and decoding: Turbo-codes, in Proc. 1993 IEEE Int. Conf. on Communication (Geneva, Switzerland, 1993), pp. 1064-1070.
2. C. Berrou and A. Glavieux, Turbo-codes: General principles and applications, in Proc 6th Tirrenia Int. Workshop on Digital Communications (Tirrenia, Italy, Sept. 1993), pp. 215-226.
3. G. Battail, C. Berrou, and A. Glavieux, Pseudo-random recursive convolutional coding for near-capacity performance, in Proc. Communication Theory Mini-Conf., Globecom '93 (Houston, TX, Dec. 1993), pp. 23-27.
4. G. Battail, On random-like codes, preprint.
5. Pseudo-random Turbo-codes, in Proc. Int. Symp. on Signals, Systems and Electronics (San Francisco, CA, Oct. 25-27, 1995), pp. 419-422.
6. S. Benedetto and G. Montorsi, Average performance of parallel concatenated block codes, Electron. Lett., vol. 31, no. 3, pp. 156-158, Feb. 2, 1995.
7. Performance evaluation of TURBO-codes, Electron. Lett., vol. 31, no. 3, pp. 163-165, Feb. 2, 1995.
8. Unveiling turbo codes: some results on parallel concatenated coding schemes, IEEE Trans. Inform. Theory, vol. 42, no. 2, pp. 409-428, Mar. 1996.
9. Design of parallel concatenated convolutional codes, IEEE Trans. Commun., vol. 44, no. 5, pp. 591-600, May 1996.
10. J. D. Andersen, The TURBO coding scheme, Rep. IT-146, Tech. Univ. of Denmark, Lyngby, June 1994.
11. J. D. Andersen, TURBO coding for deep space applications, in Proc 1995 IEEE Int. Symp. on Information Theory (Whistler, BC, Canada, Sept. 1995), p. 36.
12. [12| P. Robertson, Illuminating the structure of parallel concatenated recursive systematic (TURBO) codes, in Proc. GLOBECOM '94 (San Francisco, CA, Nov. 1994), vol. 3, pp. 1298-1303.
13. J. Hagenauer and L. Papke, Decoding Turbo'-codes with the soft output Viterbi algorithm, in Proc. 1994 IEEE Int.. Symp. on Information Theory (Trondheim, Norway, June 1994), p. 164.
14. [14[ J. Hagenauer, P. Robertson, and L. Papke, Iterative (TURBO) decoding of systematic convolutional codes with MAP and SOVA algorithms, in Proc. 1TG Conf. on "Source and Channel Coding" (Frankfurt, Germany, Oct. 1994), pp. 1-9.
15. J. Hagenauer, E. Offer, and L. Papke, Iterative decoding of binary block and convolutional codes, IEEE Trans. Inform. Theory, vol. 42, no. 2, pp. 429-445, Mar. 1996.
16. Y. V. Svirid, Weight distributions and bounds for turbo codes, European Trans. Telecommun., vol. 6, no. 5, pp. 543-556, Sept.-Oct. 1995.
17. Y. V. Svirid and S. Riedel, Threshold decoding of turbo codes, in Proc. 1995 IEEE Int. Symp. on Information Theory (Whistler, BC, Canada, Sept. 1995), p. 39.
18. D. Divsalar and F. Pollara, Low-rate turbo codes for deep-space communications, in Proc. 1995 IEEE Int. Symp. on Information Theory (Whistler, BC, Canada, Sept. 1995), p. 35.
19. D. Divsalar and F. Pollara, Turbo codes for PCS applications, in Proc. 1995 IEEE Int. Conf. on Communications (Seattle, WA, June 1995).
20. Turbo codes for deep-space communications, TDA Progr. Rep. 42-120, Jet Propulsion Lab., Pasadena, CA, pp. 29-39, Feb. 15, 1995.
21. Multiple turbo codes for deep-space communications, TDA Progr. Rep. 42-121, Jet Propulsion Lab., Pasadena, CA, pp. 66-77, May 15, 1995.
22. D. Divsalar, S. Dolinar, F. Pollara, and R. J. McEliece, Transfer function bounds on the performance of turbo codes, TDA Progr. Rep. 42-122, Jet Propulsion Lab., Pasadena, CA, pp. 44-55, Aug. 15, 1995.
23. S. Dolinar and D. Divsalar, Weight distributions for turbo codes using random and nonrandom permutations, TDA Progr. Rep. 42-122, Jet Propulsion Lab., Pasadena, CA, pp. 56-65, Aug. 15, 1995.
24. D. Divsalar and F. Pollara, On the design of turbo codes, TDA Progr. Rep. 42-123, Jet Propulsion Lab., Pasadena, CA, pp. 99-121, Nov. 15, 1995.
25. J.-F. Cheng and R. J. McEliece, Unit-memory Hamming turbo codes, in Proc. 1995 IEEE Int. Symp. on Information Theory (Whistler, BC, Canada, Sept. 1995), p. 33.
26. R. J. McEliece, E. R. Rodemich, and J.-F. Cheng, The turbo decision algorithm, in P roc. 33rd Annu. Allerton Conf. on Communication, Control and Computing (Monticello, IL, Oct. 1995), p. 366.
27. D. Divsalar and R. J. McEliece, The effective free distance of turbo codes, Electron. Lett., submitted for publication.
28. J. Seghers, On the free distance of TURBO codes and related product codes, Final Rep., Diploma Project SS 1995, no. 6613, Swiss Federal Institute of Technology, Zurich, Switzerland, Aug. 1995.
29. J. Seghers, L. C. Ferez, and D. J. Costello, Jr., On selecting code generators for turbo codes, in Proc. 33rd Annual Allerton Conf. on Communication, Control and Computing (Monticello, IL,'Oct. 1995), pp.. 357-361.
30. D. Arnold and G. Meyerhans, The realization of the the turbo-coding system, Semester Project Rep., Swiss Federal Institute of Technology, Zurich, Switzerland, July 1995.
31. A. S. Barbulescu and S. S. Pietrobon, Interleaver design for turbo codes, Electron. Lett.,.vol. 30, no. 25, p. 2107, Dec. 8, 1994.
32. Terminating the trelfis of turbo-codes in the same state, Electron. Lett., vol. 31, no. 1, pp. 22-23, Jan. 5, 1995.
33. Rate compatible turbo codes, Electron. Lett., vol. 31, no. 7, pp. 535-536, Mar. 30, 1995.
34. -, Interleaver design for three dimensional turbo codes, in Proc. 1995 IEEE Int. Symp. on Information Theory (Whistler, BC, Canada, Sept. 1995), pg. 37.
35. M. C. Reed and S. S. Pietrobon, Turbo-code termination for short frames, Electron. Lett., submitted for publication.
36. O. Joerssen and H. Meyr, Terminating the trellis of turbo-codes, Electron. Lett., vol. 30, no. 16, pp. 1285-1286, Aug. 4, 1994.
37. P. Jung and M. Nahan, Performance evaluation of turbo codes for short frame transmission systems, Electron. Lett., vol. 30, no. 2, pp. 111-113, Jan. 20, 1994.
38. Dependence of the error performance of turbo-codes on the interleaver structure in short frame transmission systems, Electron. Lett., vol. 30, no. 4, pp. 285-288, Feb. 17, 1994.
39. P. Jung, Novel low complexity decoder for turbo-codes, Electron. Lett., vol. 31, no. 2, pp. 86-87, Jan. 19, 1995.
40. R. Podemski, W. Holubowicz, C. Berrou, and A. Glavieux, Distance spectrum of the turbo-codes, in Proc. 1995 IEEE Int. Symp. on Information Theory (Whistler, BC, Canada, Sept. 1995), p. 34.
41. R. Podemski, W. Holubowicz, C. Berrou, and G. Battail, Hamming distance spectra of turbo-codes, Ann. Télécommun., vol. 50, no. 9-10, pp. 790-797, Sept-Oct. 1995.
42. G. Caire, G. Taricco, and E. Biglieri, On the convergence of the iterated decoding algorithm, in Proc. 1995 IEEE Int. Symp. on Information Theory (Whistler, BC, Canada, Sept. 1995), p. 472.
43. N. Wiberg, H.-A. Loeliger, and R. Kotier, Codes and iterative decoding on general graphs, European Trans. Telecommun., vol. 6, no. 5, pp. 513-525, Sept.-Oct. 1995.
44. S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
45. M. Cedervall and R. Johannesson, A fast algorithm for computing distance spectrum of convolutional codes, IEEE Trans. Inform. Theory, vol. 35, no. 6, pp. 1146-1159, Nov. 1989.