By Topic

Gaussian Interference Channel Capacity to Within One Bit: the General Case

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Etkin, R.H. ; Hewlett-Packard Labs., Palo Alto ; Tse, D.N.C. ; Hua Wang

The characterization of the capacity region of the two-user Gaussian interference channel has been an open problem 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 extend our results of [1] to general (i.e. possibly asymmetric) channels for the complete capacity region. 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. Using our results, we provide a natural generalization of the point-to-point classical notion of degrees of freedom to interference-limited scenarios.

Published in:

Information Theory, 2007. ISIT 2007. IEEE International Symposium on

Date of Conference:

24-29 June 2007