Outer Bounds on the Capacity of Gaussian Interference Channels

Publication Type:Journal Article
Year of Publication:2004
Authors:G. Kramer
Journal:IEEE Transactions on Information Theory
Volume:50
Pagination:581–586
Date Published:March
ISSN:0018-9448
Keywords:communication, it, theory
Abstract:

Two outer bounds on the capacity region of the two-user Gaussian interference channel (IFC) are derived. The idea of the first bound is to let a genie give each receiver just enough information to decode both messages. This bound unifies and improves the best known outer bounds of Sato and Carleial. Furthermore, the bound extends to discrete memoryless IFCs and is shown to be equivalent to another bound of Carleial. The second bound follows directly from existing results of Costa and Sato and possesses certain optimality properties for weak interference.

URL:http://dx.doi.org/10.1109/TIT.2004.825249
DOI:10.1109/TIT.2004.825249
Scratchpads developed and conceived by (alphabetical): Ed Baker, Katherine Bouton Alice Heaton Dimitris Koureas, Laurence Livermore, Dave Roberts, Simon Rycroft, Ben Scott, Vince Smith