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… Expand
Gaussian interference networks: sum capacity in the low-interference regime and new outer bounds on the capacity region
TLDR
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 Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels
TLDR
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
On the capacity region of the two-user Interference Channel
  • R. K. Farsani
  • Computer Science, Mathematics
  • 2014 IEEE International Symposium on Information Theory
  • 2014
TLDR
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. Expand
On the sum-capacity with successive decoding in interference channels
TLDR
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. Expand
The Capacity of Mixed and One-Sided Gaussian Interference Channels
TLDR
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. Expand
Upper bounds on the sum capacity of the K-user Gaussian interference channel
  • Junyoung Nam
  • Mathematics, Computer Science
  • 2015 IEEE International Symposium on Information Theory (ISIT)
  • 2015
TLDR
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. Expand
On the Maximum Achievable Sum-Rate With Successive Decoding in Interference Channels
TLDR
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. Expand
On the Capacity of the K-User Cyclic Gaussian Interference Channel
  • Lei Zhou, Wei Yu
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 2013
TLDR
It is shown that the Etkin-Tse-Wang power-splitting strategy also achieves the capacity region of the K-user cyclic interference channel to within a constant gap in the weak interference regime. Expand
New Outer Bounds on the Capacity of the Two-User Gaussian Interference Channel
TLDR
A new upper-bounding technique that utilizes noisy observation of interfering signals as auxiliary random variables in order to derive new capacity bounds is proposed and a conditional version of the worst additive noise lemma is introduced. Expand
Optimum transmission strategies for the Gaussian one-to-many interference network
TLDR
The Gaussian one-to-many interference network is obtained as a special case of a general interference network, where only one transmitter generates interference in the network, and sum-rate is used as the criterion of optimality for evaluating the strategies. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 35 REFERENCES
Gaussian interference networks: sum capacity in the low-interference regime and new outer bounds on the capacity region
TLDR
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 Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels
TLDR
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
Capacity Bounds for the Gaussian Interference Channel
TLDR
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. Expand
Bounds on the capacity region of a class of interference channels
  • E. Telatar, D. Tse
  • Mathematics, Computer Science
  • 2007 IEEE International Symposium on Information Theory
  • 2007
TLDR
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
Gaussian Interference Channel Capacity to Within One Bit
TLDR
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. Expand
Sum capacity of the Gaussian interference channel in the low interference regime
TLDR
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. Expand
On achievable rate regions for the Gaussian interference channel
  • I. Sason
  • Computer Science
  • IEEE Transactions on Information Theory
  • 2004
TLDR
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. Expand
Outer bounds on the capacity of Gaussian interference channels
  • G. Kramer
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 2004
TLDR
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
The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
TLDR
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. Expand
New outer bounds on the capacity region of Gaussian interference channels
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 achievedExpand
...
1
2
3
4
...