Outer bounds on the capacity of Gaussian interference channels
Kramer, G.
Bell Labs., Lucent Technol., Murray Hill, NJ, USA;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: March 2004
Volume: 50,
Issue: 3
On page(s): 581- 586
ISSN: 0018-9448
INSPEC Accession Number: 8004081
Digital Object Identifier: 10.1109/TIT.2004.825249
Current Version Published: 2004-03-15
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
