The serial concatenation of rate-1 codes through uniform random interleaves

IEEE Transactions on Information Theory

Volumn 49, Issue 6, 2003, Pages 1425-1438

  Pfister, Henry D ^a   Siegel, Paul H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Random coding; Rate 1 codes; Serial concatenation; Turbo codes; Uniform interleaver

Indexed keywords

BLOCK CODES; COMPUTER SIMULATION; DECODING; ITERATIVE METHODS; PROBABILITY; SIGNAL TO NOISE RATIO; TURBO CODES;

RANDOM CODING;

INFORMATION THEORY;

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

References (22)

1. D. Divsalar, H. Jin, and R. J. McEliece, "Coding theorems for 'turbo-like' codes," in Proc. 36th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sept. 1998, pp. 201-210.
2. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. IEEE Int. Conf. Communications, vol. 2, Geneva, Switzerland, May 1993, pp. 1064-1070.
3. 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.
4. T. Ericson, Bounds on the Size of a Code (Lecture Notes in Control and Information Sciences). Berlin, Heidelberg, Germany: Springer-Verlag, 1989, vol. 128, pp. 45-69.
5. M. Öberg and P. H. Siegel, "Performance analysis of turbo-equalized dicode partial-response channel," in Proc. 36th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sept. 1998, pp. 230-239.
6. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Analysis, design, and iterative decoding of double serially concatenated codes with interleaves," IEEE J. Select. Areas Commun., vol. 16, pp. 231-244, Feb. 1998.
7. H. D. Pfister and P. H. Siegel, "The serial concatenation of rate-1 codes through uniform random interleavers," in Proc. 37th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sept. 1999. pp. 260-269.
8. _, "Coding theorems for generalized repeat accumulate codes," in Proc. Int. Symp. Information Theory and Its Applications, vol. 1, Honolulu, HI, Nov. 2000, pp. 21-25.
9. H. Jin, "Analysis and design of turbo-like codes," Ph.D. dissertation, Calif. Inst. Technol., Pasadena, May 2001.
10. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
11. E. Seneta, Non-Negative Matrices: An Introduction to Theory and Applications, 2nd ed. New York: Wiley, 1981.
12. A. Papoulis, Probability, Random Variables, and Stochastic Processes, 3rd ed. New York: McGraw-Hill, 1991, ISBN 0-07-048477-5.
13. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
14. 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.
15. E. N. Gilbert, "A comparison of signalling alphabets," Bell Syst. Tech. J., vol. 31, pp. 504-522, May 1952.
16. J. N. Pierce, "Limit distribution of the minimum distance of random linear codes," IEEE Trans. Inform. Theory, vol. IT-13, pp. 595-599, Oct. 1967.
17. R. G. Gallager, "A simple derivation of the coding theorem and some applications," IEEE Trans. Inform. Theory, vol. IT-11, pp. 3-17, Jan. 1965.
18. N. Shulman and M. Feder, "Random coding techniques for nonrandom codes," IEEE Trans. Inform. Theory, vol. 45, pp. 2101-2104, Sept. 1999.
19. A. M. Viterbi and A. J. Viterbi, "Improved union bound on linear codes for the input-binary AWGN channel, with applications to turbo codes," in Proc. IEEE Int. Symp. Information Theory, Cambridge, MA, Aug. 1998, p. 29.
20. D. Divsalar and F. Pollara, "Turbo codes for PCS applications," in Proc. IEEE Int. Conf. Communications, Seattle, WA, June 1995, pp. 54-59.
21. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
22. H. D. Pfister, "On the capacity of finite state channels and the analysis of convolutional accumulate-m codes," Ph.D. dissertation, Univ. Calif., San Diego, La Jolla, 2003.