Coding Theorems for Asynchronous Slepian-Wolf Coding Systems
Coding Theorems for Asynchronous Slepian-Wolf Coding Systems
复制标题
异步 Slepian-Wolf 编码系统的编码定理
DOI：
10.1109/tit.2020.2974736
复制
发表时间：
2020
影响因子：
2.5
通讯作者：
Tomohiko Uyematsu
中科院分区：
文献类型：
--
作者：
Tetsunao Matsuta;Tomohiko Uyematsu
Slepian-Wolf（SW）编码系统是具有两个编码器和一个解码器的信源编码系统，其中这些编码器独立地将来自两个相关信源的信源序列编码成码字，并且解码器从码字重构两个信源序列。在本文中，我们考虑SW编码系统是异步的情况，即，每个编码器以某个未知延迟对源序列进行采样。我们假设延迟是未知的，但编码器和解码器已知可能延迟的最大值和最小值。我们还假设源是离散平稳无记忆的，并且源的概率质量函数（PMF）是未知的，但系统知道它属于某个PMF集合。对于这种异步SW编码系统，我们澄清了可实现的速率区域，这是一组编码器的速率对，使得解码错误概率为零，块长度趋于无穷大。我们发现，这个区域并不总是与同步SW编码系统，其中每个编码器的采样源序列没有任何延迟。
The Slepian-Wolf (SW) coding system is a source coding system with two encoders and a decoder, where these encoders independently encode source sequences from two correlated sources into codewords, and the decoder reconstructs both source sequences from the codewords. In this paper, we consider the situation in which the SW coding system is asynchronous, i.e., each encoder samples a source sequence with some unknown delay. We assume that delays are unknown but maximum and minimum values of possible delays are known to encoders and the decoder. We also assume that sources are discrete stationary memoryless and the probability mass function (PMF) of the sources is unknown but the system knows that it belongs to a certain set of PMFs. For this asynchronous SW coding system, we clarify the achievable rate region which is the set of rate pairs of encoders such that the decoding error probability vanishes as the blocklength tends to infinity. We show that this region does not always coincide with that of the synchronous SW coding system in which each encoder samples a source sequence without any delay.