Joint coordination-channel coding for strong coordination over noisy channels based on polar codes
Joint coordination-channel coding for strong coordination over noisy channels based on polar codes
复制标题
基于极化码的联合协调信道编码，用于在噪声信道上进行强协调
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Badri N. Vellambi
中科院分区：
文献类型：
--
作者：
Sarah A. Obead;J. Kliewer;Badri N. Vellambi
我们构建了一个联合协调信道极坐标编码方案，用于两个代理X和Y之间的强协调动作，它们通过离散无记忆信道（DMC）进行通信，使得动作的联合分布遵循规定的概率分布。我们表明，极化码能够实现我们先前建立的强噪声协调能力区域的内界，从而为随机编码证明提供了一个建设性的替代方案。我们的极化编码方案还提供了一个建设性的解决方案，其中的DMC和共享的随机性一起模拟另一个DMC的信道仿真问题。特别地，我们提出的解决方案能够利用DMC的随机性来减少在代理Y处生成动作序列所需的局部随机性的量。通过利用我们早期的随机编码结果这个问题，我们得出结论，建议的联合协调信道编码方案严格优于一个单独的计划，可实现的通信速率为相同数量的注入到两个系统的随机性。
We construct a joint coordination-channel polar coding scheme for strong coordination of actions between two agents X and Y, which communicate over a discrete memoryless channel (DMC) such that the joint distribution of actions follows a prescribed probability distribution. We show that polar codes are able to achieve our previously established inner bound to the strong noisy coordination capacity region and thus provide a constructive alternative to a random coding proof. Our polar coding scheme also offers a constructive solution to a channel simulation problem where a DMC and shared randomness are together employed to simulate another DMC. In particular, our proposed solution is able to utilize the randomness of the DMC to reduce the amount of local randomness required to generate the sequence of actions at agent Y. By leveraging our earlier random coding results for this problem, we conclude that the proposed joint coordination-channel coding scheme strictly outperforms a separate scheme in terms of achievable communication rate for the same amount of injected randomness into both systems.