DocumentCode :
2018993
Title :
An Achievable Rate Region for Interference Channels with Conferencing
Author :
Yi Cao ; Biao Chen
Author_Institution :
Syracuse Univ., Syracuse
fYear :
2007
fDate :
24-29 June 2007
Firstpage :
1251
Lastpage :
1255
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´s 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.
Keywords :
Gaussian channels; Markov processes; block codes; broadcast channels; channel capacity; interference (signal); radio transmitters; random codes; teleconferencing; Gaussian vector broadcast channel; achievable rate region; block Markov encoding; capacity channel; degraded relay channel; dirty paper coding; discrete memoryless interference channel; random binning; superposition coding; transmitter conferencing; Broadcasting; Capacity planning; Channel capacity; Decoding; Degradation; Interference channels; Relays; Transmitters; dirty paper coding; interference channels; random binning; superposition block Markov encoding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location :
Nice
Print_ISBN :
978-1-4244-1397-3
Type :
conf
DOI :
10.1109/ISIT.2007.4557126
Filename :
4557126
Link To Document :
بازگشت