论文标题
顺序通道合成
Sequential Channel Synthesis
论文作者
论文摘要
在过去的十年中，通道合成问题已广泛研究。在本文中，我们考虑编码器和解码器以顺序工作的顺序版本。在对目标关节分布的温和假设下，我们为点对点情况提供了解决方案的完整（单字母）表征，这表明逐符号映射通常不是最佳的，但如果我们对编码器和解码器做出一些其他假设，则确实是最佳的。我们还将此结果扩展到广播方案和交互式通信方案。我们在广播环境中提供界限，并在互动通信案例中对目标关节分布的温和条件下对解决方案的完整表征。我们的证明是基于Rényi熵方法。
The channel synthesis problem has been widely investigated over the last decade. In this paper, we consider the sequential version in which the encoder and the decoder work in a sequential way. Under a mild assumption on the target joint distribution we provide a complete (single-letter) characterization of the solution for the point-to-point case, which shows that the canonical symbol-by-symbol mapping is not optimal in general, but is indeed optimal if we make some additional assumptions on the encoder and decoder. We also extend this result to the broadcast scenario and the interactive communication scenario. We provide bounds in the broadcast setting and a complete characterization of the solution under a mild condition on the target joint distribution in the interactive communication case. Our proofs are based on a Rényi entropy method.
