K-user Interference Channels: General Outer Bound and Sum-capacity for Certain Gaussian Channels
arXiv:1102.3235 · doi:10.1109/ISIT.2011.6033716
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.
arXiv commentSubmitted to the 2011 IEEE International Symposium on Information Theory (ISIT 2011)
References in corpus (7)
- A New Outer Bound and the Noisy-Interference Sum-Rate Capacity for Gaussian Interference Channels
- The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
- Interference Alignment and the Degrees of Freedom for the K User Interference Channel
- New inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results
- On the Sum Capacity of A Class of Cyclically Symmetric Deterministic Interference Channels
- Generalized Degrees of Freedom of the Symmetric Gaussian User Interference Channel
- Outer Bounds for the Interference Channel with a Cognitive Relay
Cited by in corpus (5)
- On the Symmetric Feedback Capacity of the K-user Cyclic Z-Interference Channel
- MMSE of "Bad" Codes
- Capacity Bounds for the -User Gaussian Interference Channel
- Interference as Noise: Friend or Foe?
- Channel Conditions for the Optimality of Interference Decoding Schemes for K-user Gaussian Interference Channels