Gaussian Interference Channel Capacity to Within One Bit

Details Gaussian Interference Channel Capacity to Within One Bit Gaussian Interference Channel Capacity to Within One Bit

2007-02-07

arxiv.org/abs/cs/0702045v2

Computer Science

Information Theory

Scientific paper

The capacity of the two-user Gaussian interference channel has been open for thirty years. The understanding on this problem has been limited. The best known achievable region is due to Han-Kobayashi but its characterization is very complicated. It is also not known how tight the existing outer bounds are. In this work, we show that the existing outer bounds can in fact be arbitrarily loose in some parameter ranges, and by deriving new outer bounds, we show that a simplified Han-Kobayashi type scheme can achieve to within a single bit the capacity for all values of the channel parameters. We also show that the scheme is asymptotically optimal at certain high SNR regimes. Using our results, we provide a natural generalization of the point-to-point classical notion of degrees of freedom to interference-limited scenarios.

Affiliated with

Also associated with

No associations

Rating

Gaussian Interference Channel Capacity to Within One Bit 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 Gaussian Interference Channel Capacity to Within One Bit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gaussian Interference Channel Capacity to Within One Bit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-432682