Successive Wyner-Ziv Coding for the Binary CEO Problem Under Logarithmic Loss

The <inline-formula> <tex-math notation="LaTeX">$L$ </tex-math></inline-formula>-link binary Chief Executive Officer (CEO) problem under logarithmic loss is investigated in this paper. A quantization splitting technique is applied to convert the problem under consideration to a <inline-formula> <tex-math notation="LaTeX">$(2L-1)$ </tex-math></inline-formula>-step successive Wyner-Ziv (WZ) problem, for which a practical coding scheme is proposed. In the proposed scheme, Low-Density Generator-Matrix (LDGM) codes are used for binary quantization while Low-Density Parity-Check (LDPC) codes are used for syndrome generation; the decoder performs successive decoding based on the received syndromes and produces a soft reconstruction of the remote source. The simulation results indicate that the rate-distortion performance of the proposed scheme can approach the theoretical inner bound based on binary-symmetric test-channel models.

[1]  Toby Berger,et al.  Successive Coding in Multiuser Information Theory , 2007, IEEE Transactions on Information Theory.

[2]  Lav R. Varshney,et al.  The Non-Regular CEO Problem , 2015, IEEE Transactions on Information Theory.

[3]  Rüdiger L. Urbanke,et al.  A rate-splitting approach to the Gaussian multiple-access channel , 1996, IEEE Trans. Inf. Theory.

[4]  Jun Chen,et al.  Analysis and Code Design for the Binary CEO Problem Under Logarithmic Loss , 2018, IEEE Transactions on Communications.

[5]  Rüdiger L. Urbanke,et al.  How to achieve the capacity of asymmetric channels , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[6]  Cesk,et al.  MINIMIZING EMBEDDING IMPACT IN STEGANOGRAPHY USING LOW DENSITY CODES , 2007 .

[7]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[8]  Daniel Hillel Schonberg.  Practical distributed source coding and its application to the compression of encrypted data , 2007 .

[9]  Martin J. Wainwright,et al.  Low-Density Graph Codes That Are Optimal for Binning and Coding With Side Information , 2009, IEEE Transactions on Information Theory.

[10]  Jia Wang,et al.  On the Role of the Refinement Layer in Multiple Description Coding and Scalable Coding , 2011, IEEE Transactions on Information Theory.

[11]  Michael Gastpar,et al.  Remote Source Coding Under Gaussian Noise: Dueling Roles of Power and Entropy-Power , 2018, 2018 Information Theory and Applications Workshop (ITA).

[12]  Xin He,et al.  A Tutorial on Lossy Forwarding Cooperative Relaying , 2019, IEEE Communications Surveys & Tutorials.

[13]  Jun Chen,et al.  Successive Wyner-Ziv Coding for the Binary CEO Problem under Log-Loss , 2018, 2018 29th Biennial Symposium on Communications (BSC).

[14]  Zhen Zhang,et al.  On the CEO problem , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

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

[16]  Mahmoud Ahmadian-Attari,et al.  Binary Wyner-Ziv code design based on compound LDGM-LDPC structures , 2018, IET Commun..

[17]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[18]  Jun Chen,et al.  Vector Gaussian Two-Terminal Source Coding , 2013, IEEE Transactions on Information Theory.

[19]  Wei Yu,et al.  On the Optimal Fronthaul Compression and Decoding Strategies for Uplink Cloud Radio Access Networks , 2016, IEEE Transactions on Information Theory.

[20]  Yasutada Oohama,et al.  Rate-distortion theory for Gaussian multiterminal source coding systems with several side informations at the decoder , 2005, IEEE Transactions on Information Theory.

[21]  Jun Chen,et al.  Achieving the rate-distortion bound with low-density generator matrix codes , 2010, IEEE Transactions on Communications.

[22]  Martin J. Wainwright,et al.  Lossy Source Compression Using Low-Density Generator Matrix Codes: Analysis and Algorithms , 2010, IEEE Transactions on Information Theory.

[23]  Toby Berger,et al.  Successive Wyner–Ziv Coding Scheme and Its Application to the Quadratic Gaussian CEO Problem , 2006, IEEE Transactions on Information Theory.

[24]  Tsachy Weissman,et al.  Multiterminal Source Coding Under Logarithmic Loss , 2011, IEEE Transactions on Information Theory.

[25]  Emina Soljanin,et al.  Decentralized Coding Algorithms for Distributed Storage in Wireless Sensor Networks , 2010, IEEE Journal on Selected Areas in Communications.

[26]  Jessica J. Fridrich,et al.  Binary quantization using Belief Propagation with decimation over factor graphs of LDGM codes , 2007, ArXiv.

[27]  Michael Gastpar,et al.  Distributed Source Coding - Theory, Algorithms and Applications , 2009 .

[28]  Chao Tian,et al.  Multiple Description Quantization Via Gram–Schmidt Orthogonalization , 2005, IEEE Transactions on Information Theory.

[29]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[30]  Vinod M. Prabhakaran,et al.  Rate region of the quadratic Gaussian CEO problem , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[31]  Jun Chen,et al.  On vector Gaussian multiterminal source coding , 2014, 2012 IEEE Information Theory Workshop.

[32]  Lav R. Varshney,et al.  The CEO Problem With rth Power of Difference and Logarithmic Distortions , 2018, IEEE Transactions on Information Theory.

[33]  Toby Berger,et al.  The quadratic Gaussian CEO problem , 1997, IEEE Trans. Inf. Theory.

[34]  Jun Chen,et al.  On the Sum Rate of Gaussian Multiterminal Source Coding: New Proofs and Results , 2010, IEEE Transactions on Information Theory.

[35]  Toby Berger,et al.  An upper bound on the sum-rate distortion function and its corresponding rate allocation schemes for the CEO problem , 2004, IEEE Journal on Selected Areas in Communications.

[36]  Yasutada Oohama,et al.  The Rate-Distortion Function for the Quadratic Gaussian CEO Problem , 1998, IEEE Trans. Inf. Theory.

[37]  S. Hranilovic,et al.  Capacity and nonuniform signaling for discrete-time Poisson channels , 2013, IEEE/OSA Journal of Optical Communications and Networking.

[38]  Philip A. Whiting,et al.  Rate-splitting multiple access for discrete memoryless channels , 2001, IEEE Trans. Inf. Theory.

[39]  Jun Chen,et al.  The equivalence between slepian-wolf coding and channel coding under density evolution , 2009, IEEE Transactions on Communications.