We show that the Gaussian multiple-access channel and the Gaussian broadcast channel are fundamentally related and are essentially duals of each other. The dual channels we consider have the same channel gains and the same noise power at all receivers. We show that the capacity region of a broadcast channel (both constant and fading) can be written in terms of the capacity region of the dual mu...

The fact that the results for 2-receiver broadcast channels (BCs) are not generalized to the 3-receiver ones is of information theoretical importance. In this paper we study two classes of discrete memoryless BCs with non-causal side information (SI), i.e. multilevel BC (MBC) and 3-receiver less noisy BC. First, we obtain an achievable rate region and a capacity outer bound for the MBC. Second,...

An achievable rate region for line networks with edge and node capacity constraints and broadcast channels (BCs) is derived. The region is shown to be the capacity region if the BCs are orthogonal, deterministic, physically degraded, or packet erasure with one-bit feedback. If the BCs are physically degraded with additive Gaussian noise then independent Gaussian inputs achieve capacity.

A Gaussian multiple access channel with common data is considered. Capacity region when there is no fading is known [1]. We give a characterization of the ergodic capacity region when there is fading, and both the transmitters and the receiver know the channel perfectly. Then, we provide an iterative method for the numerical computation of the ergodic capacity region.

The capacity region of the one-sided Gaussian interference channel is established in the weak interference regime. To characterize this region, a new representation of the HanKobayashi inner bound for the one-sided Gaussian interference channel is first given. Next, a new outer bound on the capacity region of this channel is introduced which is tight in the weak interference regime. This is the...