.png){kind=icon}
.png){kind=icon}
Return
Analysis and Code Design for the Binary CEO Problem Under Logarithmic Loss
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2018.2863377.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Binary CEO problem
logarithmic loss (log-loss)
test channel model
compound LDGM-LDPC codes
soft CEO decoder
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
View more organizations