Low-delay distributed source coding for time-varying sources with unknown statistics

We consider a system in which two nodes take correlated measurements of a random source with time-varying and unknown statistics. The observations of the source at the first node are to be losslessly replicated with a given probability of outage at the second node, which receives data from the first node over a constant-rate channel. We develop a system and associated strategies for joint distributed source coding (encoding and decoding) and transmission control in order to achieve low end-to-end delay. Slepian-Wolf coding in its traditional form cannot be applied in our scenario, since the encoder requires the joint statistics of the observations and the associated decoding delay is very high. We analytically evaluate the performance of our strategies and show that the delay achieved by them are order optimal, as the conditional entropy of the source approaches to the channel rate. We also evaluate the performance of our algorithms based on real-world experiments using two cameras recording videos of a scene at different angles. Having realized our schemes, we demonstrated that, even with a very low-complexity quantizer, a compression ratio of approximately 50% is achievable for lossless replication at the decoder, at an average delay of a few seconds.

[1]  Aline Roumy,et al.  Source coding with side information at the decoder: Models with uncertainty, performance bounds, and practical coding schemes , 2012, 2012 International Symposium on Information Theory and its Applications.

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

[3]  Tomohiko Uyematsu,et al.  Universal Slepian-Wolf source codes using low-density parity-check matrices , 2010, 2010 IEEE International Symposium on Information Theory.

[4]  Ryutaroh Matsumoto Problems in application of LDPC codes to information reconciliation in quantum key distribution protocols , 2009, ArXiv.

[5]  Sidharth Jaggi,et al.  Universal linked multiple access source codes , 2002, Proceedings IEEE International Symposium on Information Theory,.

[6]  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..

[7]  F. Chung,et al.  Complex Graphs and Networks , 2006 .

[8]  Zixiang Xiong,et al.  Distributed source coding for sensor networks , 2004, IEEE Signal Processing Magazine.

[9]  Kannan Ramchandran,et al.  PRISM: A new robust video coding architecture based on distributed compression principles , 2002 .

[10]  Bernd Girod,et al.  Distributed Video Coding , 2005, Proceedings of the IEEE.

[11]  Atilla Eryilmaz,et al.  Heavy-traffic-optimal scheduling with regular service guarantees in wireless networks , 2013, MobiHoc '13.

[12]  Zixiang Xiong,et al.  On code design for the Slepian-Wolf problem and lossless multiterminal networks , 2006, IEEE Transactions on Information Theory.

[13]  R. Srikant,et al.  Asymptotically tight steady-state queue length bounds implied by drift conditions , 2011, Queueing Syst. Theory Appl..

[14]  Zixiang Xiong,et al.  Compression of binary sources with side information at the decoder using LDPC codes , 2002, IEEE Communications Letters.

[15]  Cheng Chang,et al.  Streaming source coding with delay , 2007 .

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

[17]  Zixiang Xiong,et al.  Design of Slepian-Wolf codes by channel code partitioning , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

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