Distributed Function Computation in Asymmetric Communication Scenarios

Details Distributed Function Computation in Asymmetric Communication Scenarios Distributed Function Computation in Asymmetric Communication Scenarios

2009-07-10

arxiv.org/abs/0907.1721v1

Computer Science

Information Theory

10 pages, 6 figures, 2 tables

Scientific paper

We consider the distributed function computation problem in asymmetric communication scenarios, where the sink computes some deterministic function of the data split among N correlated informants. The distributed function computation problem is addressed as a generalization of distributed source coding (DSC) problem. We are mainly interested in minimizing the number of informant bits required, in the worst-case, to allow the sink to exactly compute the function. We provide a constructive solution for this in terms of an interactive communication protocol and prove its optimality. The proposed protocol also allows us to compute the worst-case achievable rate-region for the computation of any function. We define two classes of functions: lossy and lossless. We show that, in general, the lossy functions can be computed at the sink with fewer number of informant bits than the DSC problem, while computation of the lossless functions requires as many informant bits as the DSC problem.

Affiliated with

Also associated with

No associations

Rating

Distributed Function Computation in Asymmetric Communication Scenarios does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distributed Function Computation in Asymmetric Communication Scenarios, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Function Computation in Asymmetric Communication Scenarios will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-163971