pith. sign in

arxiv: 1812.11584 · v2 · pith:2VBH5M3Enew · submitted 2018-12-30 · 💻 cs.IT · math.IT

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

classification 💻 cs.IT math.IT
keywords problembinaryproposedschemesuccessiveundercodescoding
0
0 comments X
read the original abstract

The $L$-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 $(2L-1)$-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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.