Analysis and Code Design for the Binary CEO Problem Under Logarithmic Loss

作     者：Nangir, Mahdi Asvadi, Reza Ahmadian-Attari, Mahmoud Chen, Jun 

作者机构：KN Toosi Univ Technol Fac Elect Engn Tehran *** Iran Shahid Beheshti Univ Fac Elect Engn Tehran *** Iran McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4K1 Canada 

出 版 物：《IEEE TRANSACTIONS ON COMMUNICATIONS》 (IEEE通讯汇刊)

年 卷 期：2018年第66卷第12期

页      面：6003-6014页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 08[工学] 

主　　题：Binary CEO problem logarithmic loss (log-loss) test channel model compound LDGM-LDPC codes soft CEO decoder 

摘      要：In this paper, we propose an efficient coding scheme for the binary Chief Executive Officer (CEO) problem under logarithmic loss criterion. Courtade and Weissman obtained the exact rate-distortion bound for a two-link binary CEO problem under this criterion. We find optimal parameters of the binary symmetric test-channel model for the encoder of each link by using the given bound. Furthermore, an efficient coding scheme based on compound low-density generator matrix (LDGM)-low-density parity-check (LDPC) codes is presented to achieve the theoretical rates. In the proposed encoding scheme, a binary quantizer using LDGM codes and a syndrome generator using LDPC codes are applied. The proposed decoder employs a sum-product algorithm and a soft estimator to produce an approximate a posteriori distribution of the source bits given the data received through both links. Our numerical examples verify a close performance of the proposed coding scheme to the theoretical bound in several cases.