Search

This paper presents outerbounds for the two-user Gaussian fading broadcast channel. These outerbounds are based on Costa's entropy power inequality (Costa-EPI) and are formulated mathematically as a feasibility problem. For classes of the two-user Gaussian fading broadcast channel where the outerbound is found to have a feasible solution, we find conditions under which a suitable inner and outer bound meet. For all such cases, this paper provides a partial characterization of the capacity region of the Gaussian two-user fading broadcast channel., Comment: Also submitted to ISIT 2011

In this paper, we consider the 3-receiver broadcast channel with one common and two confidential messages. One of the confidential messages is sent to the first and second receivers and kept secret from the third receiver (eavesdropper). The other confidential message is sent to the first receiver and kept secret from the second and third receivers (eavesdroppers). The common message is decoded by all receivers. We study some special cases of the model and determine their secrecy capacity regions.

In this paper, we establish the capacity region of a new class of deterministic K-receiver broadcast channels with degraded message sets, where the output Y i , i ∈ {1, …, K}, is a deterministic function of the channel input X and user i requires messages (M 1 , … M i ). In this class of deterministic broadcast channels, the outputs Y 1 → Y 2 → Y 3 … → Y K form a Markov chain for a sufficient class of input probability distributions p (x) ∈ P. The main idea of the coding strategy is to allow user i to decode not only its own messages (M 1 , …, M i ), but also part of the messages (M i+1 , …, M K ) intended for user j ∈ {i + 1, i + 2, …, K}. We then show that the achievable rate region attains the capacity region of this new class of deterministic K-receiver broadcast channels.