Achievable Rates and Upper bounds for the Interference Relay Channel

2010/08/13 by Chaaban, Anas, Sezgin, Aydin
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1008.2266

Abstract

The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than previously known bounds under some conditions. Moreover, a transmit strategy for this setup is proposed. This strategy utilizes the following elements: Block Markov encoding combined with a Han-Kobayashi scheme at the sources, decode and forward at the relay, and Willems' backward decoding at the receivers. This scheme is shown to achieve within a finite gap our upper bounds in certain cases.

Related

• Gaussian Z-Interference Channel with a Relay Link: Achievability Region and Asymptotic Sum Capacity
• An Achievable Rate Region for Interference Channels with Conferencing
• The Gaussian Interference Relay Channel: Improved Achievable Rates and Sum Rate Upperbounds Using a Potent Relay
• A New Achievable Scheme for Interference Relay Channels
• Symmetric Capacity of the Gaussian Interference Channel with an Out-of-Band Relay to within 1.15 Bits