arXiv · 0704.1873
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Yi Cao, Biao Chen. 2007-04-14. An Achievable Rate Region for Interference Channels with Conferencing. https://arxiv.org/abs/0704.1873
Cite the original work for its findings. Save a collection to share your selection of sources.