Achievable Rates and Upper bounds for the Interference Relay Channel

Details Achievable Rates and Upper bounds for the Interference Relay Channel Achievable Rates and Upper bounds for the Interference Relay Channel

2010-08-13

arxiv.org/abs/1008.2266v1

Computer Science

Information Theory

5 pages, 5 figures, to appear in proceedings of Asilomar Conference on Signals, Systems, and Computers 2010

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Achievable Rates and Upper bounds for the Interference Relay Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Achievable Rates and Upper bounds for the Interference Relay Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Achievable Rates and Upper bounds for the Interference Relay Channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-503014