期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 57, 期 9, 页码 6180-6195出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2011.2161916
关键词
Distributed source coding; function computation; interactive coding; rate-distortion region; Slepian-Wolf coding; two-way coding; Wyner-Ziv coding
资金
- U.S. National Science Foundation (NSF) [CCF-0546598, CCF-0915389]
- Division of Computing and Communication Foundations
- Direct For Computer & Info Scie & Enginr [0915389] Funding Source: National Science Foundation
A two-terminal interactive distributed source coding problem with alternating messages for function computation at both locations is studied. For any number of messages, a computable characterization of the rate region is provided in terms of single-letter information measures. While interaction is useless in terms of the minimum sum-rate for lossless source reproduction at one or both locations, the gains can be arbitrarily large for function computation even when the sources are independent. For a class of sources and functions, interaction is shown to be useless, even with infinite messages, when a function has to be computed at only one location, but is shown to be useful, if functions have to be computed at both locations. For computing the Boolean AND function of two independent Bernoulli sources at both locations, an achievable infinite-message sum-rate with infinitesimal-rate messages is derived in terms of a 2-D definite integral and a rate-allocation curve. The benefit of interaction is highlighted in multiterminal function computation problem through examples. For networks with a star topology, multiple rounds of interactive coding is shown to decrease the scaling law of the total network rate by an order of magnitude as the network grows.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据