Capacity Bounds for a Class of Interference Relay Channels

DOI10.1109/TIT.2015.2428249MaRDI QIDQ2977367zbMATH OpenFDO

Authors Germán Bassi, Pablo Piantanida, Sheng Yang

Publication date 28 April 2017

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

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

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Abstract: The capacity of a class of Interference Relay Channels (IRC) -the Injective Semideterministic IRC where the relay can only observe one of the sources- is investigated. We first derive a novel outer bound and two inner bounds which are based on a careful use of each of the available cooperative strategies together with the adequate interference decoding technique. The outer bound extends Telatar and Tse's work while the inner bounds contain several known results in the literature as special cases. Our main result is the characterization of the capacity region of the Gaussian class of IRCs studied within a fixed number of bits per dimension -constant gap. The proof relies on the use of the different cooperative strategies in specific SNR regimes due to the complexity of the schemes. As a matter of fact, this issue reveals the complex nature of the Gaussian IRC where the combination of a single coding scheme for the Gaussian relay and interference channel may not lead to a good coding scheme for this problem, even when the focus is only on capacity to within a constant gap over all possible fading statistics.

Cited in

(7)

• Approximate Capacity of a Class of Gaussian Interference-Relay Networks
• Capacity bounds and mapping design for binary symmetric relay channels
• Two-Way Interference Channel Capacity: How to Have the Cake and Eat It Too
• Symmetric Capacity of the Gaussian Interference Channel With an Out-of-Band Relay to Within 1.15 Bits
• Capacity Limits for Binary Codes in the Presence of Interference
• Interference Channel With a Causal Relay Under Strong and Very Strong Interference
• Analysis of Deterministic Binary Interference Channels Via a General Outer Bound

This page was built for publication: Capacity Bounds for a Class of Interference Relay Channels

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