Error exponent gegions for Gaussian broadcast and multiple-access channels

IEEE Transactions on Information Theory

Volumn 54, Issue 7, 2008, Pages 2919-2942

  Weng, Lihua ^a   Pradhan, Sandeep S ^b   Anastasopoulos, Achilleas ^b  

^a MSTAR SEMICONDUCTOR INC   (Taiwan)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Error exponent; Error exponent region (EER); Gaussian broadcast channel; Gaussian multiple access channel (MAC); Maximum likelihood decoding (ML)

Indexed keywords

COMMUNICATION; COMMUNICATION CHANNELS (INFORMATION THEORY); COMMUNICATION SYSTEMS; GAUSSIAN DISTRIBUTION; INFORMATION THEORY; PROBABILITY; RADIO BROADCASTING; TRELLIS CODES; VECTORS;

(0 , 1) VECTORS; APPLIED (CO); CODE WORDS; ERROR EXPONENTS; ERROR PROBABILITIES; EXISTING SYSTEMS; GAUSSIAN; GENERAL (CO); INDIVIDUAL (PSS 544-7); MULTIPLE ACCESS CHANNEL (MAC); OUTER BOUNDS; PERFORMANCE LIMITS; PERFORMANCE TRADE-OFF; PRACTICAL SCHEMES; QUALITY OF SERVICE (QOS); SINGLE-USER (SU); UNEQUAL ERROR PROTECTION (UEP);

QUALITY OF SERVICE;

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

References (32)

1. V. K. Garg, IS-95 CDMA and Cdma2000. Englewood Cliffs, NJ: Prentice-Hall, 2000.
2. M. R. Karim and M. Sarraf, W-CDMA and Cdma2000 for 3G Mobile Networks New York: McGraw-Hill, 2002.
3. L. F. Wei, "Coded modulation with unequal error protection," IEEE Trans. Commun., vol. 41, no. 10, pp. 1439-1449, Oct. 1993.
4. S. Gadkari and K. Rose, "Time-division versus superposition coded modulation schemes for unequal error protection," IEEE Trans. Commun., vol. 47, no. 3, pp. 370-379, Mar. 1999.
5. A. Feinstein, "Error bounds in noisy channels without memory," IEEE Trans. Inf. Theory, vol. IT-1, no. 2, pp. 13-14, Sep. 1955.
6. P. Elias, "Coding for noisy channels," IRE Conv. Rec., no. 4, pp. 37-46, 1955.
7. C. E. Shannon, "Probability of error for optimal codes in a Gaussian channel," Bell Syst. Tech. J., vol. 38, pp. 611-656, 1959.
8. R. M. Fano, Transmission of Information: A Statistical Theory of Communication. Cambridge, MA: MIT Press, 1961.
9. R. L. Dobrushin, "Asymptotic bounds of the probability of error for the transmission of messages over a discrete memoryless channel with a symmetric transition probability matrix," Teor. Veroyatnost. i Primenen, vol. 7, pp. 283-311, 1962.
10. R. G. Gallager, "A simple derivation of the coding theorem and some applications," IEEE Trans. Inf. Theory, vol. IT-11, no. 1, pp. 3-18, Jan. 1965.
11. C. E. Shannon, R. G. Gallager, and E. R. Berlekamp, "Lower bounds to error probability for coding on discrete memoryless channels," Inf. Contr., vol. 10, pt. I, pp. 65-103, 1967.
12. T. M. Cover, "Broadcast channels," IEEE Trans. Inf. Theory, vol. IT-18, no. 1, pp. 2-14, Jan. 1972.
13. R. Ahlswede, "Multi-way communication channels," in Proc. Int. Symp. Information Theory, Tsahkadsor, Armenian S.S.R., 1971.
14. H. Liao, "Multiple Access Channels," Ph.D. dissertation, Univ. Hawaii, Honolulu, HI, 1972.
15. J. Korner and A. Sgarro, "Universal attainable error exponents for broadcast channels with degraded message sets," IEEE Trans. Inf. Theory, vol. IT-26, no. 6, pp. 670-679, Nov. 1980.
16. S. N. Diggavi, N. Al-Dhahir, and A. R. Calderbank, "Diversity-embedded space-time codes," in Proc. Globecom Conf., San Francisco, CA, Dec. 2003.
17. S. N. Diggavi, N. Al-Dhahir, and A. R. Calderbank, "Diversity embedding in multiple antenna communications," in Proc. DIMACS Workshop Network Information Theory, New Brunswick, NJ, Sep. 2004, pp. 285-302.
18. G. A. Kabatyanskii and V. I. Levenshtein, "Bounds for packings on a sphere and in the space," Probl. Pered. Inf., vol. 14, no. 1, pp. 3-25, 1978.
19. A. E. Ashikhmin, A. Barg, and S. N. Litsyn, "A new upper bound on the reliability funcion of the Gaussian channel," IEEE Trans. Inf. Theory, vol. 46, no. 6, pp. 1945-1961, Sep. 2000.
20. D. Slepian and J. K. Wolf, "A coding theorem for multiple access channels with correlated sources," Bell Syst. Tech. J., vol. 52, pp. 1037-1076, 1973.
21. E. A. Arutyunyan, "Lower bound for the error probability of multiple-access channels," Probl. Pered. Inf., vol. 11, no. 2, pp. 23-36, Apr. 1975.
22. A. G. Dyachkov, "Random constant composition codes for multiple access channels," Probl. Contr. and Inf. Theory, vol. 13, pp. 357-369, 1984.
23. R. G. Gallager, "A perspective on multiaccess channels," IEEE Trans. Inf. Theory, vol. IT-31, no. 2, pp. 124-142, Mar. 1985.
24. J. Pokorny and H. Wallmeier, "Random coding bound and codes produced by permutations for the multiple access channel," IEEE Trans. Inf. Theory, vol. IT-31, no. 6, pp. 741-750, Nov. 1985.
25. Y. Liu and B. L. Hughes, "A new universal random coding bound for the multiple access channel," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 376-386, Mar. 1996.
26. T. Guess and M. K. Varanasi, "Error exponents for maximum-likelihood and successive decoder for the Gaussian CDMA channel," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1683-1691, Jul. 2000.
27. P. P. Bergmans, "A simple converse for braodcast channels with additive white Gaussian noise," IEEE Trans. Inf. Theory, vol. 20, no. 2, pp. 279-280, Mar. 1974.
28. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
29. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
30. H. Sato, "An outer bound on the capacity region of broadcast channels," IEEE Trans. Inf. Theory, vol. IT-24, no. 3, pp. 374-377, May 1978.
31. R. E. Blahut, Principles and Practice of Information Theory. New York: Addison-Wesley, 1987.
32. R. A. Rankin, "The closest packing of spherical caps in n dimensions," Proc. Glasgow Math. Assoc., vol. 2, pp. 139-144, 1955.