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

Authors:
Xiaohu Shang;Gerhard Kramer;Biao Chen
Affiliations:
Department of Electrical Engineering, Princeton University, Princeton, NJ and Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY;University of Southern California, Los Angeles, CA and Bell Labs, Alcatel-Lucent, Murray Hill, NJ;Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 10
Cited 23

Feedback can at most double gaussian multiple access channel capacity

IEEE Transactions on Information Theory
Review of Rate Regions for Interference Channels

IZS '06 Proceedings of the 2006 International Zurich Seminar on Communications
Capacity bounds for the Gaussian interference channel

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

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
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast 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

Capacity bounds for the Gaussian interference channel

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

IEEE Transactions on Information Theory
Source and channel coding for correlated sources over multiuser channels

IEEE Transactions on Information Theory
New sum-rate upper bound for the two-user Gaussian interference channel

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On the totally asynchronous interference channel with single-user receivers

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
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
On the degrees-of-freedom of the K -user Gaussian interference channel

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Interference channel aided by an infrastructure relay

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Interference in Large Wireless Networks

Foundations and Trends® in Networking
The degrees-of-freedom of the K-user Gaussian interference channel is discontinuous at rational channel coefficients

IEEE Transactions on Information Theory
Clustered local decoding for Wyner-type cellular models

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
Opportunities, constraints, and benefits of relaying in the presence of interference

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Crystallized rates region of the interference channel via correlated equilibrium with interference as noise

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Monotonic optimization framework for the two-user MISO interference channel

IEEE Transactions on Communications
MIMO Z-interference channels: capacity under strong and noisy interference

Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
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.20

Visualization

Abstract

A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this paper. Specifically, it is shown that if the channel crosstalk coefficient magnitudes lie below thresholds defined by the power constraints then single-user detection at each receiver is sum-rate optimal, i. treating the interference as noise incurs no loss in performance. This is the first capacity result for the Gaussian interference channel with weak to moderate interference. Furthermore, for certain mixed (weak and strong) interference scenarios, the new outer bounds give a corner point of the capacity region.