Distributed source coding using syndromes (DISCUS): design and construction

Abstract

We address the problem of distributed source coding, i.e. compression of correlated sources that are not co-located and/or cannot communicate with each other to minimize their joint description cost. In this work we tackle the related problem of compressing a source that is correlated with another source which is however available only at the decoder. In contrast to prior information-theoretic approaches, we introduce a new constructive and practical framework for tackling the problem based on the judicious incorporation of channel coding principles into this source coding problem. We dub our approach as DIstributed Source Coding Using Syndromes (DISCUS). We focus in this paper on trellis-structured consructions of the framework to illustrate its utility. Simulation results con rm the power of DISCUS, opening up a new and exciting constructive playing-ground for the distributed source coding problem. For the distributed coding of correlated i.i.d. Gaussian sources that are noisy versions of each other with \correlation-SNR" in the range of 12 to 20 dB, the DISCUS method attains gains of 7-15 dB in SNR over the Shannon-bound using \naive" independent coding of the sources.

A Survey on Analytical Modeling and Mitigation Techniques for the Energy Hole Problem in Corona-Based Wireless Sensor Network

“…[13] that classify many routing protocols for prolonging the network lifetime. To reduce data communication overhead, many methods such as data aggregation [14], data compression [15,16], and data prediction [5] have been proposed.…”

Wyner-Ziv video coding for wireless lightweight multimedia applications

“…In [15], Wyner pointed out the strong relation between random binning and channel coding, suggesting the use of linear channel codes as a practical solution for Slepian-Wolf coding. Wyner's methodology was recently used by Pradhan and Ramchandran [16], in the context of practical SlepianWolf code design based on conventional channel codes like block and trellis codes. In the particular case of binary symmetric correlation between the sources, Wyner's scheme can be extended to state-of-the-art binary linear codes, such as Turbo [5,17], and low-density parity-check (LDPC) codes [18], approaching the Slepian-Wolf limit.…”

“…Initial practical Wyner-Ziv code design focused on finding good nested codes among lattice [19] and trellisbased codes [16] for the quadratic Gaussian case. However, as the dimensionality increases, lattice source codes approach the source coding limit much faster than lattice channel codes approach capacity.…”

On the Minimization of Communication Energy Consumption of Correlated Sensor Nodes

“…The sequence Y represents data already available at the receiver S, where it is supposed that the sequence is correlated with X . In this paper, we assume that the node A has no explicit information about Y , and that Y can be modeled as being the result of passing X through a binary symmetric channel (BSC) with error probability p. Such a correlation model was also used in [5,11]. In our research, we define the correlation between X and Y as…”