An Achievable Rate Region for Interference Channels with Conferencing

Details An Achievable Rate Region for Interference Channels with Conferencing An Achievable Rate Region for Interference Channels with Conferencing

2007-04-14

arxiv.org/abs/0704.1873v1

Computer Science

Information Theory

5 pages, 2 figures, accepted by ISIT'07

Scientific paper

In this paper, we propose an achievable rate region for discrete memoryless interference channels with conferencing at the transmitter side. We employ superposition block Markov encoding, combined with simultaneous superposition coding, dirty paper coding, and random binning to obtain the achievable rate region. We show that, under respective conditions, the proposed achievable region reduces to Han and Kobayashi achievable region for interference channels, the capacity region for degraded relay channels, and the capacity region for the Gaussian vector broadcast channel. Numerical examples for the Gaussian case are given.

Affiliated with

Also associated with

No associations

Rating

An Achievable Rate Region for Interference Channels with Conferencing 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 An Achievable Rate Region for Interference Channels with Conferencing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Achievable Rate Region for Interference Channels with Conferencing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-730413