Gaussian interference networks: sum capacity in the low-interference regime and new outer bounds on the capacity region

Authors:
V. Sreekanth Annapureddy;Venugopal V. Veeravalli
Affiliations:
Coordinated Science Laboratory and the Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL;Coordinated Science Laboratory and the Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 12
Cited 13

Feedback can at most double gaussian multiple access channel capacity

IEEE Transactions on Information Theory
Elements of information theory

Elements of information theory
Mathematics of Information and Coding

Mathematics of Information and Coding
Convex Optimization

Convex Optimization
Capacity bounds for the Gaussian interference channel

IEEE Transactions on Information Theory
A new outer bound and the noisy-interference sum-rate capacity for Gaussian interference channels

IEEE Transactions on Information Theory
The worst additive noise under a covariance constraint

IEEE Transactions on Information Theory
Outer bounds on the capacity of Gaussian interference channels

IEEE Transactions on Information Theory
On achievable rate regions for the Gaussian interference channel

IEEE Transactions on Information Theory
An Extremal Inequality Motivated by Multiterminal Information-Theoretic Problems

IEEE Transactions on Information Theory
On The Han–Kobayashi Region for theInterference Channel

IEEE Transactions on Information Theory
Gaussian Interference Channel Capacity to Within One Bit

IEEE Transactions on Information Theory

A new outer bound and the noisy-interference sum-rate capacity for Gaussian interference channels

IEEE Transactions on Information Theory
Noisy-interference sum-rate capacity of parallel Gaussian interference channels

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On the sum capacity of a class of cyclically symmetric deterministic interference channels

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
The degrees-of-freedom of the K-user Gaussian interference channel is discontinuous at rational channel coefficients

IEEE Transactions on Information Theory
Interference alignment via random codes and the capacity of a class of deterministic interference channels

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
K-user fading interference channels: the ergodic very strong case

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Capacity bounds for two-hop interference networks

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
On the optimality of beamforming for multi-user MISO interference channels with single-user detection

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Monotonic optimization framework for the two-user MISO interference channel

IEEE Transactions on Communications
Rate enhancement for the Gaussian Z-interference channel with transmitter cooperation

IEEE Communications Letters
Capacity regions and sum-rate capacities of vector Gaussian interference channels

IEEE Transactions on Information Theory
Rate allocation for cooperative orthogonal-division channels with dirty-paper coding

IEEE Transactions on Communications
On Gaussian multiple access channels with interference: achievable rates and upper bounds

MACOM'11 Proceedings of the 4th international conference on Multiple access communications

Quantified Score

Hi-index	755.02

Visualization

Abstract

Establishing the capacity region of a Gaussian interference network is an open problem in information theory. Recent progress on this problem has led to the characterization of the capacity region of a general two-user Gaussian interference channel within one bit. In this paper, we develop new, improved outer bounds on the capacity region. Using these bounds, we show that treating interference as noise achieves the sum capacity of the two-user Gaussian interference channel in a low-interference regime, where the interference parameters are below certain thresholds. We then generalize our techniques and results to Gaussian interference networks with more than two users. In particular, we demonstrate that the total interference threshold, below which treating interference as noise achieves the sum capacity, increases with the number of users.