pith. sign in

arxiv: 1008.2266 · v1 · pith:KFXHEVZRnew · submitted 2010-08-13 · 💻 cs.IT · math.IT

Achievable Rates and Upper bounds for the Interference Relay Channel

classification 💻 cs.IT math.IT
keywords boundsupperrelayachievablechannelinterferenceschemesetup
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.