Successive Wyner-Ziv Coding for the Binary CEO Problem under Log-Loss
Information Theory
2018-03-08 v1 math.IT
Abstract
An -link binary CEO problem is considered in this paper. We present a practical encoding and decoding scheme for this problem employing the graph-based codes. A successive coding scheme is proposed for converting an -link binary CEO problem to the single binary Wyner-Ziv (WZ) problems. By using the compound LDGM-LDPC codes, the theoretical bound of each binary WZ is asymptotically achievable. Our proposed decoder successively decodes the received data by employing the well-known Sum-Product (SP) algorithm and leverages them to reconstruct the source. The sum-rate distortion performance of our proposed coding scheme is compared with the theoretical bounds under the logarithmic loss (log-loss) criterion.
Cite
@article{arxiv.1803.02605,
title = {Successive Wyner-Ziv Coding for the Binary CEO Problem under Log-Loss},
author = {Mahdi Nangir and Reza Asvadi and Mahmoud Ahmadian-Attari and Jun Chen},
journal= {arXiv preprint arXiv:1803.02605},
year = {2018}
}