Computer Science – Information Theory
Scientific paper
2008-10-02
Computer Science
Information Theory
Accepted for publication at Globecom Communications Conference 2008
Scientific paper
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.
Jafarian Amin
Vishwanath Sriram
No associations
LandOfFree
On the Capacity of One-sided Two user Gaussian Fading Broadcast Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Capacity of One-sided Two user Gaussian Fading Broadcast Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Capacity of One-sided Two user Gaussian Fading Broadcast Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-493171