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

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.

Nangir Mahdi, Asvadi Reza, Chen Jun, Ahmadian-Attari Mahmoud, Matsumoto Tad

A1 Journal article – refereed

M. Nangir, R. Asvadi, J. Chen, M. Ahmadian-Attari and T. Matsumoto, "Successive Wyner-Ziv Coding for the Binary CEO Problem Under Logarithmic Loss," in IEEE Transactions on Communications, vol. 67, no. 11, pp. 7512-7525, Nov. 2019. doi: 10.1109/TCOMM.2019.2937932

https://doi.org/10.1109/TCOMM.2019.2937932 http://urn.fi/urn:nbn:fi-fe2019121146690