Two-Way Source Coding With a Helper

Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We characterize the region of achievable rates and distortions when the Markov relation (Helper)-(User 1)-(User 2) holds. The main insight of th...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 56; no. 6; pp. 2905 - 2919
Main Authors: Permuter, Haim H, Steinberg, Yossef, Weissman, Tsachy
Format: Journal Article
Language:English
Published: New York IEEE 01.06.2010
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Decoders
Decoding
Distortion
Encoders
Encoding
Error analysis
Gaussian
Information processing
Information systems
Information theory
Markov analysis
Markov processes
Messages
Normal distribution
Optimization
Peer to peer computing
Protocols
Rate-distortion
Source coding
Theory
two-way rate distortion
undirected graphs
verification of Markov relations
Wyner-Ziv source coding
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We characterize the region of achievable rates and distortions when the Markov relation (Helper)-(User 1)-(User 2) holds. The main insight of the result is that in order to achieve the optimal rate, the helper may use a binning scheme, as in Wyner-Ziv, where the side information at the decoder is the ¿further¿ user, namely, User 2. We derive these regions explicitly for the Gaussian sources with square error distortion, analyze a tradeoff between the rate from the helper and the rate from the source, and examine a special case where the helper has the freedom to send different messages, at different rates, to the encoder and the decoder. The converse proofs use a technique for verifying Markov relations via undirected graphs.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2010.2046238