Two-way successively refined joint source-channel coding

Consider a source, {X/sub i/,Y/sub i/}/sub i=1//sup /spl infin//, producing independent copies of a pair of jointly distributed random variables (RVs). The {X/sub i/} part of the process is observed at some location, say A, and is supposed to be reproduced at a different location, say B, where the {...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 52; no. 4; pp. 1483 - 1494
Main Authors: Maor, A., Merhav, N.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.04.2006
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Applied sciences
Bidirectional control
Channel capacity
Channels
Codecs
Coding
Coding, codes
Computer networks
Decoding
Distortion
Exact sciences and technology
Exchanging
Information, signal and communications theory
Interactive
joint source-channel coding
Memoryless systems
Optimization
Performance analysis
Position (location)
Random variables
Reproduction
Signal and communications theory
Source coding
successive refinement
Telecommunications and information theory
Theorems
TV broadcasting
two-way communication
Wireless networks
joint source-channel coding
Bidirectional link
Channel capacity
Source coding
successive refinement
Refinement method
Two channel system
two-way communication
Lossy medium
Iterative method
Joint source channel coding
Interactive system
Memoryless channel
Localization
Random variable
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 a source, {X/sub i/,Y/sub i/}/sub i=1//sup /spl infin//, producing independent copies of a pair of jointly distributed random variables (RVs). The {X/sub i/} part of the process is observed at some location, say A, and is supposed to be reproduced at a different location, say B, where the {Y/sub i/} part of the process is observed. Similarly, {Y/sub i/} should be reproduced at location A. The communication between the two locations is carried out across two memoryless channels in K iterative bi-directional rounds. In each round, the source components are reconstructed at the other locations based on the information exchanged in all previous rounds and the source component known at that location, and it is desired to find the amount of information that should be exchanged between the two locations in each round, so that the distortions incurred (in each round) will not exceed given thresholds. Our setting extends the results of Steinberg and Merhav as well as Kaspi, combining the notion of successive refinement with this of two-way interactive communication. We first derive a single-letter characterization of achievable rates for a pure source-coding problem with successive refinement. Then, for a joint source-channel coding setting, we prove a separation theorem, asserting that in the limit of long blocks, no optimality is lost by first applying lossy (two-way) successive-refinement source coding, regardless of the channels, and then applying good channel codes to each one of the resulting bitstreams, regardless of the source.
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.2006.871047