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 Trans. Inf. 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
On the sum capacity of the Gaussian x channel in the mixed interference regime
TLDR
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. Expand
New Sum-Rate Capacity Results for Multi-User Interference Channels
TLDR
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. Expand
Optimum transmission strategies for the Gaussian many-to-one interference network
TLDR
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. Expand
On the symmetric capacity of the K-user symmetric cyclic Gaussian interference channel
  • Lei Zhou, Wei Yu
  • Mathematics, Computer Science
  • 2010 44th Annual Conference on Information Sciences and Systems (CISS)
  • 2010
TLDR
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. Expand
Bounds on the capacity region of a class of Gaussian broadcast interference channels
  • Y. Liu, E. Erkip
  • Mathematics, Computer Science
  • 2013 IEEE International Symposium on Information Theory
  • 2013
In this paper, a class of Gaussian broadcast interference channels is investigated, where one of the two broadcast users is subject to the interference coming from a point-to-point transmission.Expand
On the sum capacity of the discrete memoryless interference channel with one-sided weak interference and mixed interference
  • Fangfang Zhu, B. Chen
  • Computer Science, Mathematics
  • 2012 IEEE International Symposium on Information Theory Proceedings
  • 2012
TLDR
The sum capacity of a class of discrete memoryless interference channels is determined and this class of channels is defined analogous to the Gaussian Z-interference channel with weak interference, which allows the construction of a capacity outer-bound using the capacity region of associated degraded broadcast channels. Expand
The Approximate Capacity Region of the Phase-Fading , Very Strong , KUser Gaussian Interference Channel
Consider the K-user Gaussian interference channel with static channel coefficients. Recent efforts have characterized the capacity region to within a constant gap for several important special cases,Expand
Sum Capacity of MIMO Interference Channels in the Low Interference Regime
TLDR
It is shown that the low interfered regime can be quite significant for MIMO interference channels, with the low interference threshold being at least as large as the sine of the angle between the direct and cross channel gain vectors for the MISO and SIMO cases. Expand
Sum capacity of K user Gaussian degraded interference channels
TLDR
The sum-capacity achieving scheme is shown to be a successive interference cancellation scheme, which generalizes a known result for two-user channels to K- user channels and derives sum- capacity in closed-form for the class of K-user Gaussian degraded interference channels. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 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
...