Error Exponent Regions for Gaussian Broadcast and Multiple-Access Channels

In modern communication systems, different users have different requirements for quality of service (QoS). In this work, QoS refers to the average codeword error probability experienced by the users in the network. Although several practical schemes (collectively referred to as unequal error protection schemes) have been studied in the literature and are implemented in existing systems, the corresponding performance limits have not been studied in an information-theoretic framework. In this paper, an information-theoretic framework is considered to study communication systems which provide heterogeneous reliabilities for the users. This is done by defining individual probabilities of error for the users in the network and obtaining the fundamental tradeoffs of the corresponding error exponents. In particular, we quantify the reliability tradeoff by introducing the notion of error exponent region (EER), which specifies the set of error exponent vectors that are simultaneously achievable by the users for a fixed vector of users' rates. We show the existence of a tradeoff among the users' error exponents by deriving inner and outer bounds for the EER. Using this framework, a system can be realized, which can provide a tradeoff of reliabilities among the users for a fixed vector of users' rates. This adds a completely new dimension to the performance tradeoff in such networks, which is unique to multiterminal communication systems, and is beyond what is given by the conventional performance-versus-rate tradeoff in single-user systems. Although this is a very general concept and can be applied to any multiterminal communication system, in this paper we consider Gaussian broadcast and multiple-access channels (MACs).

[1]  János Körner,et al.  Universally attainable error exponents for broadcast channels with degraded message sets , 1980, IEEE Trans. Inf. Theory.

[2]  C. Shannon Probability of error for optimal codes in a Gaussian channel , 1959 .

[3]  Elwyn R. Berlekamp,et al.  Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II , 1967, Inf. Control..

[4]  Suhas N. Diggavi,et al.  Diversity Embedded Space–Time Codes , 2003, IEEE Transactions on Information Theory.

[5]  Richard E. Blahut,et al.  Principles and practice of information theory , 1987 .

[6]  Robert G. Gallager,et al.  A simple derivation of the coding theorem and some applications , 1965, IEEE Trans. Inf. Theory.

[7]  Robert G. Gallager,et al.  A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.

[8]  Kenneth Rose,et al.  Time-division versus superposition coded modulation schemes for unequal error protection , 1999, IEEE Trans. Commun..

[9]  Suhas N. Diggavi,et al.  Diversity Embedding in Multiple Antenna Communications , 2003, Advances in Network Information Theory.

[10]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[11]  Amiel Feinstein,et al.  Error bounds in noisy channels without memory , 1955, IRE Trans. Inf. Theory.

[12]  A. Sridharan Broadcast Channels , 2022 .

[13]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[14]  Brian L. Hughes,et al.  A new universal random coding bound for the multiple-access channel , 1996, IEEE Trans. Inf. Theory.

[15]  Hiroshi Sato,et al.  An outer bound to the capacity region of broadcast channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[16]  D. Slepian,et al.  A coding theorem for multiple access channels with correlated sources , 1973 .

[17]  Mohsen Sarraf,et al.  W-CDMA and cdma2000 for 3G Mobile Networks , 2002 .

[18]  Rudolf Ahlswede,et al.  Multi-way communication channels , 1973 .

[19]  Lee-Fang Wei,et al.  Coded modulation with unequal error protection , 1993, IEEE Trans. Commun..

[20]  N. Sloane,et al.  Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. I , 1993 .

[21]  Jacob Wolfowitz,et al.  Multiple Access Channels , 1978 .

[22]  Simon Litsyn,et al.  A new upper bound on the reliability function of the Gaussian channel , 2000, Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253).

[23]  Mahesh K. Varanasi,et al.  Error exponents for maximum-likelihood and successive decoders for the Gaussian CDMA channel , 2000, IEEE Trans. Inf. Theory.

[24]  Patrick P. Bergmans,et al.  A simple converse for broadcast channels with additive white Gaussian noise (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[25]  Hans-Martin Wallmeier,et al.  Random coding bound and codes produced by permutations for the multiple-access channel , 1985, IEEE Trans. Inf. Theory.

[27]  R. Rankin The Closest Packing of Spherical Caps in n Dimensions , 1955, Proceedings of the Glasgow Mathematical Association.