Joint Coordination-Channel Coding for Strong Coordination over Noisy Channels Based on Polar Codes
arXiv:1710.03210 · doi:10.1109/ALLERTON.2017.8262789
Abstract
We construct a joint coordination-channel polar coding scheme for strong coordination of actions between two agents and , 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 . 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.
arXiv comment8 pages, 6 figures. Accepted in the 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2017
References in corpus (9)
- Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
- Source Polarization
- Coordination Capacity
- Distributed Channel Synthesis
- On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener
- Polar Codes For Broadcast Channels
- Hybrid Codes Needed for Coordination over the Point-to-Point Channel
- Polar Coding for Empirical Coordination of Signals and Actions over Noisy Channels
- Strong Coordination over Noisy Channels: Is Separation Sufficient?