On the Capacity of One-sided Two user Gaussian Fading Broadcast Channels

2008/10/02 by Amin Jafarian, Sriram Vishwanath, Jafarian, Amin +1 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced MIMO Systems Optimization #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.0810.0503

Accepted for publication at Globecom Communications Conference 2008

openalex publication_date 2008/10/02 · arxiv created 2009/01/01 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we investigate upper and lower bounds on the capacity of two-user fading broadcast channels where one of the users has a constant (non-fading) channel. We use the Costa entropy power inequality (EPI) along with an optimization framework to derive upper bounds on the sum-capacity and superposition coding to obtain lower bounds on the sum-rate for this channel. For this fading broadcast channel where one channel is constant, we find that the upper and lower bounds meet under special cases, and in general, we show that the achievable sum-rate comes within a constant of the outer bound.

Cited by

• Capacity Bounds for Wireless Ergodic Fading Broadcast Channels with Partial CSIT

Related

• The Two-User Gaussian Fading Broadcast Channel
• On the Capacity of Multiple Access and Broadcast Fading Channels with Full Channel State Information at Low SNR
• Capacity Bounds for the Gaussian Interference Channel
• New Outer Bounds on the Capacity Region of Gaussian Interference Channels
• The capacity region of a product of two unmatched Gaussian broadcast channels with three particular messages and a common message