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

DOI10.1109/TIT.2008.2009793MaRDI QIDQ4975728zbMATH OpenOpenAlexFDO

Authors Xiaohu Shang, Gerhard Kramer, Biao Chen

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0712.1987

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

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 coefficients and power constraints satisfy a simple condition 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 concrete (finite signal-to-noise ratio) 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.

Cited in

(6)

• Wasserstein Continuity of Entropy and Outer Bounds for Interference Channels
• Noisy-Interference Sum-Rate Capacity for Vector Gaussian Interference Channels
• A new achievable rate region for the interference channel
• Analysis of Deterministic Binary Interference Channels Via a General Outer Bound
• Noisy-Interference Sum-Rate Capacity of Parallel Gaussian Interference Channels
• Power control for battery-limited energy harvesting communications

This page was built for publication: A New Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975728)