Computation over Multiple-access Channels
The problem of reliably reconstructing a function of sources over a multiple-access channel (MAC) is considered. It is shown that there is no source-channel separation theorem even when the individual sources are independent. Joint source-channel strategies are developed that are optimal when the structure of the channel probability transition matrix and the function are appropriately matched. Even when the channel and function are mismatched, these computation codes often outperform separation-based strategies. Achievable distortions are given for the distributed refinement of the sum of Gaussian sources over a Gaussian multiple-access channel with a joint source-channel lattice code. Finally, computation codes are used to determine the multicast capacity of finite-field multiple-access networks, thus linking them to network coding.
Keywords: Distributed computation , joint source–channel coding , lattice codes , linear codes , multiple-access channel (MAC) , network coding , separation theorem, Computer networks , Design engineering , Distributed computing , Fasteners , Information theory , Joining processes , Lattices , Linear code , Network coding , Variable speed drives
Record created on 2012-06-04, modified on 2016-08-09