Multiple Access Channel Simulation

نویسندگان

چکیده

We study the problem of simulating a two-user multiple-access channel (MAC) over multiple access network noiseless links. Two encoders observe independent and identically distributed (i.i.d.) copies source random variable each, while decoder observes i.i.d. side-information variable. There are rate-limited communication links between each encoder decoder, there is pairwise shared randomness all three possible pairs nodes. The has to output approximately another jointly with two sources side information. interested in rate tuples which permit this simulation. This setting can be thought as multi-terminal generalization point-to-point simulation studied by Bennett et al. (2002) Cuff (2013). When absent, reduces special case MAC using Haddadpour establish that presence strictly improve requirements. first show inner bound derived from (2013) tight when at conditionally given decoder. result recovers existing results on function computation such networks. then explicitly compute regions for an example both without demonstrate its rates. Inner outer bounds general also obtained.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Channel Division Multiple Access

Ultra-WideBand (UWB) has been recently presented as a promising radio technology due to the large bandwidth available. This feature enables point to point high data rates at short range as well as high temporal resolution with long channel impulse reponses (CIR). In this paper, we present an original multiple access scheme called Channel Division Multiple Access (ChDMA), where we use the CIR as...

متن کامل

Channel-Hopping Multiple Access

The medium-access control (MAC) protocols for wireless networks proposed or implemented to date based on collision-avoidance handshakes between sender and receiver either require carrier sensing or the assignment of unique codes to nodes to ensure that intended receivers hear data packets without interference from hidden sources. We present and analyze a protocol that we call channel-hopping mu...

متن کامل

Interleaver-Division Multiple Access on the OR Multiple Access Channel

The OR channel provides an unusual opportunity where single-user decoding permits operation at about 70% of the full multiple-access channel sum capacity. The interleaverdivision multiple access technique applied in this paper can approach that performance with turbo and LDPC solutions. The current paper focuses on very low latency codes with simple Viterbi decoding, intended for very high spee...

متن کامل

The Poisson Multiple-Access Channel

The Poisson multiple access channel (MAC) models many-to-one optical communication through an optical fiber or in free space. For this model we compute the capacity region for the two-user case as a function of the allowed peak power. Focusing on the maximum throughput we generalize our results to the case where the users are subjected to an additional average power constraint and to the many u...

متن کامل

Asynchronous multiple-access channel capacity

The capacity region for the discrete memoryless multipleaccess channel without time synchronization at the transmitters and receivers is shown to be the same as the known capacity region for the ordinary multiple-access channel. The proof utilizes time sharing of two optimal codes for the ordinary multiple-access channel and uses maximum likeliiood decoding over shifts of the hypothesized trans...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2022

ISSN: ['0018-9448', '1557-9654']

DOI: https://doi.org/10.1109/tit.2022.3184643