论文标题
用于异步SLEPIAN-WOLF编码的通用解码
Universal Decoding for Asynchronous Slepian-Wolf Encoding
论文作者
论文摘要
我们考虑使用单独的编码器和一个关节解码器（即Slepian-Wolf（S-W）编码）的两个相关无内存源的（几乎）无损源编码的问题。在我们的环境中，编码和解码是异步的，即两个源之间存在一定的相对延迟。源参数和相对延迟都不是编码器和解码器的知识。由于我们假设两个编码器都实现标准随机套件，无论如何都不需要这种知识，因此这项工作的重点放在解码器上。我们的主要贡献在于提出一个通用解码器，即独立于未知的源参数和相对延迟，同时又是渐近地与最佳最大最大值A后验概率（MAP）解码器一样好。
We consider the problem of (almost) lossless source coding of two correlated memoryless sources using separate encoders and a joint decoder, that is, Slepian-Wolf (S-W) coding. In our setting, the encoding and decoding are asynchronous, i.e., there is a certain relative delay between the two sources. Neither the source parameters nor the relative delay are known to the encoders and the decoder. Since we assume that both encoders implement standard random binning, which does not require such knowledge anyway, the focus of this work is on the decoder. Our main contribution is in proposing a universal decoder, that independent of the unknown source parameters and the relative delay, and at the same time, is asymptotically as good as the optimal maximum a posteriori probability (MAP) decoder in the sense of the random coding error exponent achieved.Consequently, the achievable rate region is also the same as if the source parameters and the delay were known to the decoder.
