An Achievable Rate Region for Interference Channels with Conferencing

Abstract

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.

5 pages, 2 figures, accepted by ISIT'07

Cited by in corpus (5)

• Interference Channels with One Cognitive Transmitter
• On the Achievable Rate-Regions for State-Dependent Gaussian Interference Channel
• Partial Decode-Forward Binning Schemes for the Causal Cognitive Relay Channels
• Interference Channel with State Information
• Achievable Rate Regions for Discrete Memoryless Interference Channel with State Information