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

@article{Annapureddy2008SumCO, title={Sum capacity of the Gaussian interference channel in the low interference regime}, author={V. Annapureddy and V. Veeravalli}, journal={2008 Information Theory and Applications Workshop}, year={2008}, pages={422-427} }

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

#### 63 Citations

New outer bounds on the capacity region of Gaussian interference channels

- Physics, Computer Science
- 2008 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… Expand

On the sum capacity of a class of cyclically symmetric deterministic interference channels

- Mathematics, Computer Science
- 2009 IEEE International Symposium on Information Theory
- 2009

A K user-pair, cyclically symmetric, deterministic interference channel in which each receiver experiences interference only from its neighboring transmitters (Wyner model) is investigated. Expand

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

- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2009

New, improved outer bounds on the capacity region are developed and it is shown 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. Expand

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

- Computer Science
- IEEE Trans. Inf. Theory
- 2009

New, improved outer bounds on the capacity region are developed and it is shown 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. Expand

On the noisy interference regime of the MISO Gaussian interference channel

- Mathematics
- 2008 42nd Asilomar Conference on Signals, Systems and Computers
- 2008

In this work, we consider the two-user Gaussian MISO interference channel. We derive a criterion for sum-rate optimality of treating interference as noise at the receivers, which generalizes recent… Expand

Gaussian Z-interference channel with a relay link: Achievable rate region and asymptotic sum capacity

- Mathematics
- 2008 International Symposium on Information Theory and Its Applications
- 2008

This paper studies a Gaussian Z-interference channel with a rate-limited digital relay link from the interference-free receiver to the interfered receiver. An achievable rate region is derived based… Expand

On the secrecy rate of interference networks using structured codes

- Computer Science, Mathematics
- 2009 IEEE International Symposium on Information Theory
- 2009

This paper shows that structured transmission schemes are a good choice for secret communication over interference networks with an eavesdropper and shows that an equivocation sum-rate that is within two bits of the maximum possible legitimate communication sum- rate is achievable using lattice codes. Expand

Algebraic lattice alignment for K-user interference channels

- Mathematics
- 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
- 2009

This paper develops a new achievable region for the K-user symmetric interference channel using algebraic interference alignment. Our scheme uses lattice codebooks to transform the interference… Expand

On the capacity of a class of multi-user interference channels

- Computer Science
- 2011 International ITG Workshop on Smart Antennas
- 2011

It is shown that the interfering multicast network has strong interference for a larger set of channel parameters than what was previously obtained. Expand

Gaussian Z-Interference Channel With a Relay Link: Achievability Region and Asymptotic Sum Capacity

- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2012

A Gaussian Z-interference channel with a rate-limited digital relay link from one receiver to another and achievable rate regions are derived based on a combination of a Han-Kobayashi common-private power-splitting technique and a decode-and-forward strategy for interference subtraction at the other end. Expand

#### References

SHOWING 1-10 OF 26 REFERENCES

New outer bounds on the capacity region of Gaussian interference channels

- Physics, Computer Science
- 2008 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… Expand

The capacity of the Gaussian interference channel under strong interference

- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1981

The capacity region of a Gaussian interference channel with two separate messages is obtained for the case of moderately strong interference. It is shown that the region coincides with the one where… Expand

On the Gaussian interference channel

- Physics, Computer Science
- IEEE Trans. Inf. Theory
- 1985

The optimality is established of two extreme points in the achievable region of the general Gaussian interference channel and it is proved that the class of degradedGaussian interference channels is equivalent to theclass of Z (one-sided) interference channels. Expand

On the capacity of MIMO interference channels

- Physics, Computer Science
- 2008 46th Annual Allerton Conference on Communication, Control, and Computing
- 2008

The capacity region of a multiple-input-multiple-output interference channel (MIMO IC) in which the channel matrices are square and invertible is studied. The capacity region for strong interference… Expand

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

- Computer Science
- IEEE Trans. Inf. Theory
- 2009

New, improved outer bounds on the capacity region are developed and it is shown 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. Expand

A new achievable rate region for the interference channel

- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1981

A new achievable rate region for the general interference channel which extends previous results is presented and evaluated and the capacity of a class of Gaussian interference channels is established. Expand

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

- Physics, Computer Science
- IEEE 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. Expand

Bounds on the capacity region of a class of interference channels

- Mathematics, Computer Science
- 2007 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. Expand

Outer bounds on the capacity of Gaussian interference channels

- Mathematics, Computer Science
- IEEE 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. Expand

A case where interference does not reduce capacity (Corresp.)

- Computer Science
- IEEE Trans. Inf. Theory
- 1975

It is shown that, under certain conditions, two strongly interfering communication links with additive white Gaussian noise can achieve rates as high as would be achievable without this interference.