Skip to main content
Article thumbnail
Location of Repository

K-user Interference Channels: General Outer Bound and Sum-capacity for Certain Gaussian Channels

By Daniela Tuninetti

Abstract

This paper derives an outer bound on the capacity region of a general memoryless interference channel with an arbitrary number of users. The derivation follows from a generalization of the techniques developed by Kramer and by Etkin et al for the Gaussian two-user channel. The derived bound is the first known outer bound valid for any memoryless channel. In Gaussian noise, classes of channels for which the proposed bound gives the sum-rate capacity are identified, including degraded channels and a class of Z-channels.Comment: Submitted to the 2011 IEEE International Symposium on Information Theory (ISIT 2011

Topics: Computer Science - Information Theory
Year: 2011
DOI identifier: 10.1109/ISIT.2011.6033716
OAI identifier: oai:arXiv.org:1102.3235
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1102.3235 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.