Zero-error function computation through a bidirectional relay
We consider zero error function computation in a three node wireless network. Nodes A and
B observe X and Y respectively, and want to compute a function f (X, Y) with zero error. To
achieve this, nodes A and B send messages to a relay node C at rates RA and RB
respectively. The relay C then broadcasts a message to A and B at rate RC to help them
compute f (X, Y) with zero error. We allow block coding, and study the region of rate-triples
(RA, RB, RC) that are feasible. The rate region is characterized in terms of graph coloring of …
B observe X and Y respectively, and want to compute a function f (X, Y) with zero error. To
achieve this, nodes A and B send messages to a relay node C at rates RA and RB
respectively. The relay C then broadcasts a message to A and B at rate RC to help them
compute f (X, Y) with zero error. We allow block coding, and study the region of rate-triples
(RA, RB, RC) that are feasible. The rate region is characterized in terms of graph coloring of …
We consider zero error function computation in a three node wireless network. Nodes A and B observe X and Y respectively, and want to compute a function f(X, Y ) with zero error. To achieve this, nodes A and B send messages to a relay node C at rates R A and R B respectively. The relay C then broadcasts a message to A and B at rate R C to help them compute f(X, Y ) with zero error. We allow block coding, and study the region of rate-triples (R A , R B , R C ) that are feasible. The rate region is characterized in terms of graph coloring of some suitably defined probabilistic graphs. We give single letter inner and outer bounds which meet for some simple examples. We provide a sufficient condition on the joint distribution p XY under which the relay can also compute f(X, Y ) if A and B can compute it with zero error.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果