Successively Structured Gaussian Two-terminal Source Coding

Abstract

Multiterminal source coding refers to separate encoding and joint decoding of multiple correlated sources. Joint decoding requires all the messages to be decoded simultaneously which is exponentially more complex than a sequence of single-message decodings. Inspired by previous work on successive coding, we apply the successive Wyner-Ziv coding, which is inherently a low complexity approach of obtaining a prescribed distortion, to the two-terminal source coding scheme. First, we consider 1-helper problem where one source provides partial side information to the decoder to help the reconstruction of the main source. Our results show that the successive coding strategy is an optimal strategy in the sense of achieving the rate-distortion function. By developing connections between source encoding and data fusion steps, it is shown that the whole rate-distortion region for the 2-terminal source coding problem is achievable using the successive coding strategy. Comparing the performance of the sequential coding with the performance of the successive coding, we show that there is no sum-rate loss when the side information is not available at the encoder. This result is of special interest in some applications such as video coding where there are processing and storage constraints at the encoder. Finally, we provide an achievable rate-distortion region for the m-terminal source coding.

GREAT-CEO: larGe scale distRibuted dEcision mAking Techniques for Wireless Chief Executive Officer Problems

“…Therefore, the error floor remains the same even with different p values (p = 0.9, 0.8, 0.7). On the contrary, when SNR falls † For the case N > 2, the VI is performed in a pairwise manner between all the HIs of the corresponding forwarding nodes, according to (11) and (12). For every single HI, the updated extrinsic LLRs from all the other HIs are then combined and fed into the HI of interest as a priori LLRs.…”

“…Successive coding strategy for Gaussian CEO problem is considered in [10], [11]. So far, for the quadratic Gaussian CEO problem, where the source u is represented by a memoryless Gaussian codebook and suffers from in- dependent and identically distributed (i.i.d) Gaussian noise W i , i = 1, 2, · · · , N, the distortion rate region has already been identified by [12].…”

Distributed Successive Refinement of Multiview Images Using Broadcast Advantage

“…However, as it does not fully exploit the joint information due to the first step encoding, the minimum sum-rate is sometimes worse than DSC2. Recently, [15] proposed a successive decoding scheme for the distributed source coding problem (no link between encoders). They prove that successive decoding following a linear fusion achieves the rate-distortion region of DSC2 for the quadratic Gaussian case.…”

Distributed successive approximation coding using broadcast advantage: The two-encoder case

“…However, it does not fully exploit the joint information due to the first step encoding, therefore the minimum sum-rate is sometimes worse than DSC2. Recently, [13] proposed a successive decoding scheme for the distributed source coding problem (no link between encoders). It is proved that successive decoding following a linear fusion could achieve the rate-distortion region of DSC2 for the quadratic Gaussian case.…”