连续全知的实用方法
A Practical Approach for Successive Omniscience
摘要：
我们在本文中研究的系统包含一组用户，观察一个离散的无记忆的多个源，并通过无噪声信道进行通信，目的是实现全知，所有用户恢复整个多个源的状态。我们采用连续全知（SO）的概念，即，让某个用户子集的局部全知先于整个系统的全局全知获得，并考虑如何以连续的方式有效地获得全知的问题。基于现有的结果SO，我们提出了一个CompSetSO算法确定一个互补的集合，一个用户子集，其中的本地全知可以首先达到不增加和率，通信的总数，为全球全知。我们还推导出一个充分条件的用户子集是互补的，使运行CompSetSO算法只需要一个下界，而不是确切的值，最小的总和率达到全球全知。CompSetSO算法在多项式时间内返回互补用户子集。我们通过例子展示了如何递归地应用CompSetSO算法，使全局全知可以通过多阶段的SO。
英文摘要：
The system that we study in this paper contains a set of users that observe a discrete memoryless multiple source and communicate via noise-free channels with the aim of attaining omniscience, the state that all users recover the entire multiple source. We adopt the concept of successive omniscience (SO), i.e., letting the local omniscience in some user subset be attained before the global omniscience in the entire system, and consider the problem of how to efficiently attain omniscience in a successive manner. Based on the existing results on SO, we propose a CompSetSO algorithm for determining a complimentary set, a user subset in which the local omniscience can be attained first without increasing the sum-rate, the total number of communications, for the global omniscience. We also derive a sufficient condition for a user subset to be complimentary so that running the CompSetSO algorithm only requires a lower bound, instead of the exact value, of the minimum sum-rate for attaining global omniscience. The CompSetSO algorithm returns a complimentary user subset in polynomial time. We show by example how to recursively apply the CompSetSO algorithm so that the global omniscience can be attained by multi-stages of SO.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
