Universal Decoding for Asynchronous Slepian-Wolf Encoding

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.

[1]  S. Sarvotham,et al.  Variable-Rate Universal Slepian-Wolf Coding with Feedback , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..

[2]  Neri Merhav Universal Decoding Using a Noisy Codebook , 2018, IEEE Transactions on Information Theory.

[3]  Jacob Ziv,et al.  Universal decoding for finite-state channels , 1985, IEEE Trans. Inf. Theory.

[4]  Neri Merhav Universal decoding for source-channel coding with side information , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[5]  Imre Csiszár Linear codes for sources and source networks: Error exponents, universal coding , 1982, IEEE Trans. Inf. Theory.

[6]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[7]  Imre Csiszár,et al.  Towards a general theory of source networks , 1980, IEEE Trans. Inf. Theory.

[8]  Dominique de Caen,et al.  A lower bound on the probability of a union , 1997, Discret. Math..

[9]  R. Urbanke,et al.  Asynchronous Slepian-Wolf coding via source-splitting , 1997, Proceedings of IEEE International Symposium on Information Theory.

[10]  Chao Tian,et al.  LDPC code design for asynchronous Slepian-Wolf coding , 2010, IEEE Transactions on Communications.

[11]  Neri Merhav Universal Decoding for Asynchronous Slepian-Wolf Encoding , 2021, IEEE Transactions on Information Theory.

[12]  Stark C. Draper Universal Incremental Slepian-Wolf Coding , 2004 .

[13]  Te Sun Han,et al.  Universal coding for the Slepian-Wolf data compression system and the strong converse theorem , 1994, IEEE Trans. Inf. Theory.

[14]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[15]  Tomohiko Uyematsu,et al.  Coding Theorems for Asynchronous Slepian–Wolf Coding Systems , 2019, IEEE Transactions on Information Theory.

[16]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[17]  John C. Kieffer,et al.  Some Universal Noiseless Multiterminal Source Coding Theorems , 1980, Inf. Control..

[18]  Frans M. J. Willems Totally asynchronous Slepian-Wolf data compression , 1988, IEEE Trans. Inf. Theory.

[19]  Jun Chen,et al.  On Universal Variable-Rate Slepian-Wolf Coding , 2008, 2008 IEEE International Conference on Communications.