Reliable channel regions for good binary codes transmitted over parallel channels

IEEE Transactions on Information Theory

Volumn 52, Issue 4, 2006, Pages 1405-1424

  Liu, Ruoheng ^a   Spasojević, Predrag ^a   Soljanin, Emina ^b  

^a The State University of New Jersey   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Block fading channel; Coding theorems; Hybrid automatic repeat request (HARQ); Maximum likelihood (ML) decoding; Parallel channels; Repeat accumulate (RA) codes; Turbo codes

Indexed keywords

COMPUTER SIMULATION; MATHEMATICAL MODELS; PROBABILITY; RAYLEIGH FADING; SIGNAL TO NOISE RATIO; TURBO CODES;

BINARY LINEAR CODE; BLOCK-FADING CHANNEL; CODING THEOREMS; HYBRID AUTOMATIC REPEAT REQUEST (HARQ); MAXIMUM-LIKELIHOOD (ML) DECODING; PARALLEL CHANNELS; REPEAT-ACCUMULATE (RA) CODES;

COMMUNICATION CHANNELS (INFORMATION THEORY);

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

References (39)

1. D. J. C. Mackay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
2. L. H. Ozarow, S. Shamai (Shitz), and A. D. Wyner, "Information theoretic considerations for cellular mobile radio," IEEE Trans. Veh. Technol., vol. 43, no. 3, pp. 359-378, May 1994.
3. E. Biglieri, J. Proakis, and S. Shamai (Shitz), "Fading channels: Information-theoretic and communications aspects," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 1895-1911, Oct. 1998.
4. G. Caire and D. Tuninetti, "The throughput of hybrid-ARQ protocols for the Gaussion collision channel," IEEE Trans. Inf. Theory, vol. 47, no. 4, pp. 1971-1988, Jul. 2001.
5. E. Soljanin, R. Liu, and P. Spasojević, "Hybrid ARQ with random transmission assignments," in Proc. DIMACS Workshop on Network Information Theory, Piscataway, NJ, Mar. 2003, pp. 321-334.
6. R. McEliece and W. E. Stark, "Channels with block interference," IEEE Trans. Inf. Theory, vol. IT-30, no. 1, pp. 44-53, Jan. 1984.
7. M. Chiani, "Error probability for block codes over channels with block interference," IEEE Trans. Inf. Theory, vol. 44, no. 7, pp. 2998-3008, Nov. 1998.
8. E. Malkamäki and H. Leib, "Coded diversity on block-fading channels," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 771-781, Mar. 1999.
9. R. Knopp and P. A. Humblet, "On coding for block fading channels," IEEE Trans. Inf. Theory, vol. 46, no. 1, pp. 189-205, Jan. 2000.
10. G. Caire, G. Taricco, and E. Biglieri, "Optimum power control over fading channels," IEEE Trans. Inf. Theory, vol. 45, no. 4, pp. 1468-1489, Jul. 1998.
11. A. Stefanov and E. Erkip, "Cooperative coding for wireless networks," in Proc. IEEE Conf. Mobile and Wireless Communications Networks 2002, Stockholm, Sweden, Sep. 2002, pp. 90-93.
12. R. Liu, P. Spasojević, and E. Soljanin, "User cooperation with punctured turbo codes," in Proc. 2003 Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2003, pp. 1690-1699.
13. D. Divsalar, "A Simple Tight Bound on Error Probability of Block Codes with Application to Turbo Codes," Jet Propulsion Lab, CIT, Pasadena, CA, Tech. Rep. TMO 42-139, 1999.
14. S. Aji, H. Jin, A. Khandekar, R. J. McEliece, and D. J. C. Mackay, "BSC thresholds for code ensembles based on 'typical pairs' decoding," in Proc. IMA Workshop on Codes, Systems and Graphical Models, New York, Aug. 1999, pp. 195-210.
15. T. Richardson and R. Urbanke, "Thresholds for turbo codes," in Proc. IEEE Int. Symp. Information Theory 2000, Sorrento, Italy, Jun. 2000, p. 317.
16. H. Jin and R. J. McEliece, "Coding theorems for turbo code ensembles," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1451-1461, Jun. 2002.
17. L. Bazzi, T. Richardson, and R. Urbanke, "Exact thresholds and optimal codes for the binary symmetric channel and Gallagers decoding algorithm A," IEEE Trans. Inf. Theory, vol. 50, no. 9, pp. 2010-2021, Sep. 2004.
18. I. Sason and S. Shamai (Shitz), "On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes," IEEE Trans. Inf. Theory, vol. 47, no. 6, pp. 2275-2299, Sep. 2001.
19. R. Liu, P. Spasojević, and E. Soljanin, "Punctured turbo code ensembles," in Proc. IEEE Information Theory Workshop 2003, Paris, France, Mar./Apr. 2003, pp. 249-252.
20. R. Liu, P. Spasojević, and E. Soljanin, "On the role of puncturing in hybrid ARQ schemes," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 449.
21. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. IEEE Int. Conf. Communications, Geneva, Switzerland, May 1993, pp. 1064-1070.
22. D. Divsalar, H. Jin, and R. McEliece, "Coding theorems for 'turbo-like' codes," in Proc. 1998 Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sep. 1998, pp. 201-210.
23. R. Liu, P. Spasojević, and E. Soljanin, "On the weight spectrum of good linear binary codes," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4369-4373, Dec. 2005.
24. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
25. 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.
26. M. Breiling, "A logarithmic upper bound on the minimum distance of turbo codes," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1692-1710, Aug. 2004.
27. D. Truhachev, M. Lentmaier, and K. S. Zigangirov, "Some results concerning design and decoding of turbo-codes," Probl. Pered. Inform., vol. 37, pp. 190-205, Jul./Sep. 2001.
28. L. Bazzi, M. Mahdian, and D. Spielman, "The minimum distance of turbo-like codes," IEEE Trans. Inf. Theory. [Online]. Available: http://math.ntit.edu/spielman, submitted for publication.
29. J. Boutros and G. Zémor, "Interleavers for turbo codes that yield a minimum distance growing with blocklength," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 55.
30. S. Shamai (Shitz) and I. Sason, "Variations on the Gallager bounds, connections, and applications," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3029-3051, Dec. 2002.
31. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
32. N. Shulman and M. Feder, "Random coding techniques for nonrandom codes," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 2101-2104, Sep. 1999.
33. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
34. I. Sason, I. E. Telatar, and R. Urbanke, "On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3052-3061, Dec. 2002.
35. G. Miller and D. Burshtein, "Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2696-2710, Nov. 2001.
36. H. Jin and R. McEliece, "RA codes achieve AWGN channel capacity," in Proc. 1999 Conf. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-13), Honolulu, HI, Nov. 1999, pp. 10-18.
37. R. Liu, P. Spasojević, and E. Soljanin, "A throughput analysis of incremental redundancy hybrid ARQ schemes with turbo codes," in Proc. Conf. Information Sciences and Systems, Princeton, NJ, Mar. 17-19, 2004, pp. 726-731.
38. D. Divsalar and F. Pollara, "Weight Distributions for Turbo Codes using Random and Nonrandom Permutations," Jet Propulsion Lab, CIT, Pasadena, CA, Tech. Rep. TMO 42-122, 1995.
39. Physical Layer Standard for cdma2000 Spread Spectrum Systems (Revision C), 3GPP2 Std. C.S0002-C, 2004.