# Gaussian Interference Networks: Sum Capacity in the Low-Interference Regime and New Outer Bounds on the Capacity Region

@article{Annapureddy2009GaussianIN, title={Gaussian Interference Networks: Sum Capacity in the Low-Interference Regime and New Outer Bounds on the Capacity Region}, author={V. Sreekanth Annapureddy and Venugopal V. Veeravalli}, journal={IEEE Transactions on Information Theory}, year={2009}, volume={55}, pages={3032-3050} }

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…

## 455 Citations

### A New Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels

- Computer ScienceIEEE Transactions on Information Theory
- 2009

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.e., treating the interference as noise incurs no loss in performance.

### On the capacity region of the two-user Interference Channel

- Computer Science2014 IEEE International Symposium on Information Theory
- 2014

A novel outer bound on the capacity region is given and it is shown that this outer bound is optimal in the strong interference regime and some new capacity theorems are proved.

### On the sum-capacity with successive decoding in interference channels

- Computer Science2011 IEEE International Symposium on Information Theory Proceedings
- 2011

If the number of messages of either user is fewer than the minimum number required to achieve the constrained sum-capacity, the maximum achievable sum-rate drops to that with interference treated as noise.

### On the sum capacity of the Gaussian x channel in the mixed interference regime

- Computer Science2015 IEEE International Symposium on Information Theory (ISIT)
- 2015

The genie-aided sum capacity upper bounds derived show that the gap between sum capacity and the sum rate of the multiple access transmission scheme is small for a significant part of the mixed interference region.

### New Sum-Rate Capacity Results for Multi-User Interference Channels

- Computer Science2019 IEEE International Symposium on Information Theory (ISIT)
- 2019

Novel techniques requiring subtle sequential applications of the Csiszar-Korner identity are developed to establish efficient single-letter outer bounds on the sum-rate capacity of interference networks.

### The Capacity of Mixed and One-Sided Gaussian Interference Channels

- Computer ScienceArXiv
- 2015

It is proved that the outer bound corresponding to the mixed interference regime, in which one of the receivers is subject to strong interference while the other one suffers from weak interference, is tight in a broad range of this regime.

### Upper bounds on the sum capacity of the K-user Gaussian interference channel

- Computer Science2015 IEEE International Symposium on Information Theory (ISIT)
- 2015

New upper bounds on the capacity of the K-user GIC with complex channel gains are derived to provide a more accurate and concrete perspective on capacity behaviors at finite SNR.

### Optimum transmission strategies for the Gaussian many-to-one interference network

- Computer Science2014 IEEE International Conference on Communications (ICC)
- 2014

This work formulate three transmission strategies for the Gaussian many-to-one interference network, which involve using Gaussian codebooks and treating interference from a subset of the transmitters as noise, and uses sum-rate as the criterion of optimality for evaluating the strategies.

### On the Maximum Achievable Sum-Rate With Successive Decoding in Interference Channels

- Computer ScienceIEEE Transactions on Information Theory
- 2012

If the number of messages of either of the two users is fewer than the minimum number required to achieve the constrained sum-capacity, the maximum achievable sum-rate drops to that with interference treated as noise.

### On the symmetric capacity of the K-user symmetric cyclic Gaussian interference channel

- Computer Science2010 44th Annual Conference on Information Sciences and Systems (CISS)
- 2010

This result shows that both the Etkin, Tse and Wang's upper bound and their one-bit achievability result on the symmetric rate continue to hold for the symmetry rate of the K-user symmetric cyclic channel using the same Han-Kobayashi strategy.

## References

SHOWING 1-10 OF 28 REFERENCES

### A New Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels

- Computer ScienceIEEE Transactions on Information Theory
- 2009

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.e., treating the interference as noise incurs no loss in performance.

### Capacity Bounds for the Gaussian Interference Channel

- Computer ScienceIEEE Transactions on Information Theory
- 2009

It is proved that the full Han-Kobayashi achievable rate region using Gaussian codebooks is equivalent to that of the one-sided Gaussian IC for a particular range of channel parameters.

### Bounds on the capacity region of a class of interference channels

- Computer Science2007 IEEE International Symposium on Information Theory
- 2007

A new outer bound to the capacity region of a certain class of interference channels is proved, and the gap between it and the Han-Kobayashi inner bound is quantified.

### Gaussian Interference Channel Capacity to Within One Bit

- Computer ScienceIEEE Transactions on Information Theory
- 2008

This work shows that the existing outer bounds can in fact be arbitrarily loose in some parameter ranges, and by deriving new outer bounds, it is shown that a very simple and explicit Han-Kobayashi type scheme can achieve to within a single bit per second per hertz of the capacity for all values of the channel parameters.

### Sum capacity of the Gaussian interference channel in the low interference regime

- Computer Science2008 Information Theory and Applications Workshop
- 2008

Using new upper bounds on the sum capacity of the two-user Gaussian interference channel, it is shown that treating interference as noise achieves the sumcapacity if the interference levels are below certain thresholds.

### On achievable rate regions for the Gaussian interference channel

- Computer ScienceIEEE Transactions on Information Theory
- 2004

A lower bound on the sum-capacity (i.e., the maximal achievable total rate) is derived, and it is shown to have superiority over the maximal total rate which is achieved by the TDM/FDM approach with moderate interference.

### Outer bounds on the capacity of Gaussian interference channels

- Computer ScienceIEEE Transactions on Information Theory
- 2004

Two outer bounds on the capacity region of the two-user Gaussian interference channel (IFC) are derived to let a genie give each receiver just enough information to decode both messages and possesses certain optimality properties for weak interference.

### The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels

- Computer ScienceIEEE Transactions on Information Theory
- 2010

A central theme emerges: the use of lattice codes for alignment of interfering signals on the signal level in the Gaussian interference channel to within a constant number of bits.

### New outer bounds on the capacity region of Gaussian interference channels

- Computer Science2008 IEEE International Symposium on Information Theory
- 2008

An outer bound on the capacity region of the two-user Gaussian interference channel is derived. The bound shows that for low power and small crosstalk coefficients the sum-rate capacity is achieved…

### On Network Interference Management

- Computer ScienceIEEE Transactions on Information Theory
- 2010

This work identifies the maximal degree-of-freedom region of the former network and shows that multilevel superposition coding by the long-range transmitter performs optimally and a simple power control strategy achieves a region that is within one bit of the capacity region, under certain channel conditions.