2 research outputs found
Comparison Between the Joint and Successive Decoding Schemes for the Binary CEO Problem
A comparison between the joint and the successive decoding schemes for a
two-link case binary Chief Executive Officer (CEO) problem is presented. We
utilize the logarithmic loss as the criterion for measuring and comparing the
total distortion of the decoding techniques. The binary symmetric channel (BSC)
is considered as the test-channel model, which provides a theoretical
rate-distortion bound. Simulation results show that the joint decoding scheme
provides smaller compression rate and distortion values compared to the
successive decoding scheme. On the other hand the successive decoding method
has lower complexity; therefore, it is efficient for the cases with higher
number of links.Comment: 5 pages, accepted in ICEE 202
Analysis and Code Design for the Binary CEO Problem under Logarithmic Loss
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 the optimal test-channel model and its
parameters for the encoder of each link by using the given bound. Furthermore,
an efficient encoding scheme based on compound LDGM-LDPC codes is presented to
achieve the theoretical rates. In the proposed encoding scheme, a binary
quantizer using LDGM codes and a syndrome-decoding employing LDPC codes are
applied. An iterative decoding is also presented as a fusion center to
reconstruct the observation bits. The proposed decoder consists of a
sum-product algorithm with a side information from other decoder and a soft
estimator. The output of the CEO decoder is the probability of source bits
conditional to the received sequences of both links. This method outperforms
the majority-based estimation of the source bits utilized in the prior studies
of the binary CEO problem. Our numerical examples verify a close performance of
the proposed coding scheme to the theoretical bound in several cases.Comment: 28 page