Multiple Access Channel Simulation

by   Gowtham R. Kurri, et al.

We study the problem of simulating a two-user multiple access channel over a multiple access network of noiseless links. Two encoders observe independent and identically distributed (i.i.d.) copies of a source random variable each, while a decoder observes i.i.d. copies of a side-information random variable. There are rate-limited noiseless communication links and independent pairwise shared randomness resources between each encoder and the decoder. The decoder has to output approximately i.i.d. copies of another random variable jointly distributed with the two sources and the side information. We are interested in the rate tuples which permit this simulation. This setting can be thought of as a multi-terminal generalization of the point-to-point channel simulation problem studied by Bennett et al. (2002) and Cuff (2013). General inner and outer bounds on the rate region are derived. For the specific case where the sources at the encoders are conditionally independent given the side-information at the decoder, we completely characterize the rate region. Our bounds recover the existing results on function computation over such multi-terminal networks. We then show through an example that an additional independent source of shared randomness between the encoders strictly improves the communication rate requirements, even if the additional randomness is not available to the decoder. Furthermore, we provide inner and outer bounds for this more general setting with independent pairwise shared randomness resources between all the three possible node pairs.



There are no comments yet.


page 1

page 2

page 3

page 4


Coordination Through Shared Randomness

We study a distributed sampling problem where a set of processors want t...

Secrecy Rates for a Channel With Two Senders and Two Receivers

Motivated in part by the problem of secure multicast distributed storage...

Exact Channel Synthesis

We consider the exact channel synthesis problem, which is the problem of...

Zero-Error Communication over Adversarial MACs

We consider zero-error communication over a two-transmitter deterministi...

Distributed Computation over MAC via Kolmogorov-Arnold Representation

Kolmogorov's representation theorem provides a framework for decomposing...

A Lower-bound for Variable-length Source Coding in LQG Feedback Control

In this letter, we consider a Linear Quadratic Gaussian (LQG) control sy...

Cooperative Resolvability and Secrecy in the Cribbing Multiple-Access Channel

We study channel resolvability for the discrete memoryless multiple-acce...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.