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

Xiaohu Shang, Gerhard Kramer, Biao Chen

Research output: Contribution to journalArticlepeer-review

295 Scopus citations

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.e., 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.

Original languageEnglish (US)
Pages (from-to)689-699
Number of pages11
JournalIEEE Transactions on Information Theory
Volume55
Issue number2
DOIs
StatePublished - 2009

Keywords

  • Capacity
  • Gaussian noise
  • Interference

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint

Dive into the research topics of 'A new outer bound and the noisy-interference sum-rate capacity for Gaussian interference channels'. Together they form a unique fingerprint.

Cite this