On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders

IEEE Transactions on Information Theory

Volumn 48, Issue 12, 2002, Pages 3052-3061

  Sason, Igal ^a,b   Telatar, Emre ^b   Urbanke, Rüdiger ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b EPFL   (Switzerland)

Author keywords

Convolutional codes; Maximum likelihood (ML) decoding; Serially concatenated codes; Thresholds; Turbo codes; Uniform interleaver; Weight distribution

Indexed keywords

CONVOLUTIONAL CODES; DECODING; MAXIMUM LIKELIHOOD ESTIMATION; POLYNOMIALS; TURBO CODES;

ENCODERS;

ENCODING (SYMBOLS);

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

References (25)

1. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding," IEEE Trans. Inform. Theory, vol. 44, pp. 909-926, May 1998.
2. S. Benedetto and G. Montorsi, "Unveiling turbo codes: Some results on parallel concatenated coding schemes," IEEE Trans. Inform. Theory, vol. 42, pp. 409-428, Mar. 1996.
3. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding," in Proc. ICC'93, Geneva, Switzerland, May 1993, pp. 1064-1070.
4. M. Breiling, "A logarithmic upper bound on the minimum distance of turbo codes," IEEE Trans. Inform. Theory, submitted for publication.
5. F. Daneshgaran and M. Mondin, "An efficient algorithm for obtaining the distance spectrum of turbo codes," in Proc. Int. Symp. Turbo Codes and Related Topics, Brest, France, Sept. 1997, pp. 251-254.
6. C. Di, D. Proietti, T. Richardson, E. Telatar, and R. Urbanke, "Finite length analysis of low-density parity-check ensembles for the binary erasure channel," IEEE Trans. Information Theory, vol. 48, pp. 1570-1579, June 2002.
7. D. Divsalar, "A simple fight bound on error probability of block codes with applications to turbo codes," JPL, TMO Progr. Rep. 42-139, pp. 1-35, Nov. 1999.
8. D. Divsalar, H. Jin, and R.J. McEliece, "Coding theorems for 'turbo-like codes'," in Proc. 1998 Allerton Conf., Monticello, Sept. 1998, pp. 201-210.
9. D. Divsalar and F. Polara, "Serial and hybrid concatenated codes with applications," in Proc. 1st Int. Symp. Turbo Codes and Related Topics, 1997, pp. 80-87.
10. T.M. Duman and M. Salehi, "New performance bounds for turbo codes," IEEE Trans. Commun., vol. 46, pp. 717-723, June 1998.
11. J. Hokfelt, O. Edfors, and T. Maseng, "A survey on trellis termination alternatives for turbo codes," IEEE J. Select. Areas Commun., vol. 19, pp. 838-847, May 2001.
12. H. Jin, "Analysis and design of turbo-like codes," Ph.D. dissertation, Calif. Inst. Technol. (Caltech), Pasadena, 2001.
13. H. Jin and R.J. McEliece, "Repeat-accumulate codes achieve awgn channel capacity," in Proc. Int. Symp. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 1999, pp. 10-18.
14. _, "Coding theorems for turbo code ensembles," IEEE Trans. Inform. Theory, vol. 48, pp. 1451-1461, June 2002.
15. R.J. McEliece, "How to compute weight enumerators for convolutional codes," in Communications and Coding. ser. Tauton Research Studies, M. Darnel and B. Honary, Eds. New York: Wiley, 1998, ch. 6, pp. 121-141.
16. M. Peleg, I. Sason, S. Shamai, and A. Elia, "On interleaved, differentially encoded convolutional codes," IEEE Trans. Inform. Theory, vol. 45, pp. 2572-2581, Nov. 1999.
17. L.C. Perez, J. Seghers, and D.J. Costello, "A distance spectrum interpretation of turbo codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1698-1709, Nov. 1996.
18. H. Pfister and P.H. Siegel, "On the serial concatenation of rate-one codes through uniform interleavers," in Proc. 37th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Sept. 1999, pp. 260-269.
19. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching low-density parity check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
20. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
21. I. Sason and S. Shamai (Shitz), "Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum," IEEE Trans. Inform. Theory, vol. 46, pp. 24-47, Jan. 2000.
22. _, "On improved bounds on the decoding error probability of block codes over interleaved fading channels, with application to turbo-like codes," IEEE Trans. Inform. Theory, vol. 47, pp. 2275-2299, Sept. 2001.
23. I. Sason, E. Telatar, and R. Urbanke, "The asymptotic input-output weight distribution of convolutional codes," in Proc. 38th Ann. Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 2000, pp. 276-286.
24. S. Shamai and I. Sason, "Variations on Gallager's bounding techniques: Performance bounds for turbo codes in Gaussian and fading channels," in Proc. 2nd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sept. 2000, pp. 27-34.
25. E. Telatar and R. Urbanke, "On the ensemble performance of turbo codes," in Proc. IEEE Int. Symp. Information Theory (ISIT '97), Ulm, Germany, June 1997, p. 105.