Multi-Functional Compression with Side Information
Name
Feizi-2009-Multi-Functional Compression with Side Information.pdf
Size
163.17 KB
Format
Adobe PDF
Checksum (MD5)
29c81938161b2761d517577395b44980
Author(s)
Feizi-Khankandi, Soheil
Medard, Muriel
Date Issued
March 2010
Journal
IEEE Global Telecommunications Conference, 2009. GLOBECOM 2009.
Publisher
Institute of Electrical and Electronics Engineers
Citation
Feizi, S., and M. Medard. “Multi-Functional Compression with Side Information.” Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE. 2009. 1-5.
Version
Final published version
Abstract
In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able to compute some deterministic functions f[subscript 1] (X,Y[subscript 1]), ..., f[subscript m](X,Y[subscript m]), where Y[subscript i], 1 ? i ? m, are available at the receiver as side information. In, Wyner and Ziv considered this problem for the special case of m = 1 and f[subscript 1](X, Y[subscript 1]) = X and derived a rate-distortion function. Yamamoto extended this result in to the case of having one general function f[subscript 1] (X,Y[subscript 1]) . Both of these results were in terms of an auxiliary random variable. For the case of zero distortion, in, Orlitsky and Roche gave an interpretation of this variable in terms of properties of the characteristic graph which led to a particular coding scheme. This result was extended in by providing an achievable scheme based on colorings of the characteristic graph. In a recent work, reference has considered this problem for a general tree network where intermediate nodes are allowed to perform some computations. These previous works only considered the case where the receiver only wants to compute one function (m = 1). Here, we want to consider the case in which the receiver wants to compute several functions with different side information random variables and zero distortion. Our results do not depend on the fact that all functions are desired in one receiver and one can apply them to the case of having several receivers with different desired functions (i.e., functions are separable). We define a new concept named the multi-functional graph entropy which is an extension of the graph entropy defined by Korner in. We show that the minimum achievable rate for this problem is equal to the conditional multi-functional graph entropy of random variable X given side informations. We also propose a coding scheme based on graph colorings to achieve this rate.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/GLOCOM.2009.5426284
