Binary dirty MAC with common state information

Anatoly Khina*, Tal Philosof, Uri Erez, Ram Zamir

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The general two-user memoryless multiple-access channel, with common channel state information known to the encoders, has no single-letter solution which explicitly characterizes its capacity region. In this paper a binary "dirty" multiple-access channel (MAC) with "common interference", when the interference sequence is known to both encoders, is considered. We determine its sum-capacity, which equals to the capacity when full-cooperation between transmitters is allowed, contrary to the Gaussian case. We further derive an achievable rate region for this channel, by adopting the "onion-peeling" strategies which achieve the capacity region of the "clean" binary MAC. We show that the gap between the capacity region of the clean MAC and the achievable rate region of dirty MAC stems from the loss of the point-to-point binary dirty channel relative to the corresponding clean channel.

Original languageEnglish
Title of host publication2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010
Pages496-500
Number of pages5
DOIs
StatePublished - 2010
Event2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010 - Eilat, Israel
Duration: 17 Nov 201020 Nov 2010

Publication series

Name2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010

Conference

Conference2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010
Country/TerritoryIsrael
CityEilat
Period17/11/1020/11/10

Fingerprint

Dive into the research topics of 'Binary dirty MAC with common state information'. Together they form a unique fingerprint.

Cite this