K user fading broadcast channels with CSI at the receivers

For an arbitrary number of users, we examine the capacity region of fading broadcast channels with channel state known at the receivers but unknown at the transmitter. Generalizing prior work for two-user broadcast channels, we find the capacity region of the layered erasure broadcast channel. We show that weighted sum rate maximization assigns each signal level to the user that derives maximum weighted expected rate from that level. The outer bound is based on a channel enhancement that creates a sequence of degraded component channels in the order of decreasing user weights. This same approach is then used to find an outer bound to the capacity region of the fading Gaussian broadcast channels.

[1]  Lizhong Zheng,et al.  Multilevel Broadcast Networks , 2007, 2007 IEEE International Symposium on Information Theory.

[2]  Shlomo Shamai,et al.  On two-user fading gaussian broadcast channels with perfect channel state information at the receivers , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[3]  R. Yates,et al.  Reverse stripping soft decision decoding for general Gaussian fading broadcast channel , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

[4]  David Tse,et al.  Optimal power allocation over parallel Gaussian broadcast channels , 1997, Proceedings of IEEE International Symposium on Information Theory.

[5]  Shlomo Shamai,et al.  The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel , 2006, IEEE Transactions on Information Theory.

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

[7]  Andrea J. Goldsmith,et al.  Capacity and optimal resource allocation for fading broadcast channels - Part I: Ergodic capacity , 2001, IEEE Trans. Inf. Theory.

[8]  Thomas M. Cover,et al.  Broadcast channels , 1972, IEEE Trans. Inf. Theory.

[9]  Sanjay Shakkottai,et al.  On Network Coding for Interference Networks , 2006, 2006 IEEE International Symposium on Information Theory.

[10]  Patrick P. Bergmans,et al.  Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.

[11]  Robert G. Gallager,et al.  Capacity and coding for degraded broadcast channels , 1974 .

[12]  Sriram Vishwanath,et al.  On the Capacity of One-Sided Two User Gaussian Fading Broadcast Channels , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[13]  Suhas N. Diggavi,et al.  A Deterministic Approach to Wireless Relay Networks , 2007, ArXiv.

[14]  Roy D. Yates,et al.  Fading broadcast channels with state information at the receivers , 2009, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[15]  Lizhong Zheng,et al.  Coding along Hermite polynomials for Gaussian noise channels , 2009, 2009 IEEE International Symposium on Information Theory.

[16]  Shlomo Shamai,et al.  Mutual information and minimum mean-square error in Gaussian channels , 2004, IEEE Transactions on Information Theory.