A Random Variable Substitution Lemma With Applications to Multiple Description Coding

2009/09/17 by Jia Wang, Jun Chen, Wang, Jia +8 · 1 citation
Computer Science · Mathematics · #Advanced Data Compression Techniques #Algorithms and Data Compression #Error Correcting Code Techniques #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.0909.3135

arxiv created 2009/09/17 · arxiv updated 2009/12/01

Abstract

We establish a random variable substitution lemma and use it to investigate the role of refinement layer in multiple description coding, which clarifies the relationship among several existing achievable multiple description rate-distortion regions. Specifically, it is shown that the El Gamal-Cover (EGC) region is equivalent to the EGC* region (an antecedent version of the EGC region) while the Venkataramani-Kramer-Goyal (VKG) region (when specialized to the 2-description case) is equivalent to the Zhang-Berger (ZB) region. Moreover, we prove that for multiple description coding with individual and hierarchical distortion constraints, the number of layers in the VKG scheme can be significantly reduced when only certain weighted sum rates are concerned. The role of refinement layer in scalable coding (a special case of multiple description coding) is also studied.

Cited by

• A Strictly Improved Achievable Region for Multiple Descriptions Using Combinatorial Message Sharing

Related

• An Achievable Rate-Distortion Region for the Multiple Descriptions Problem
• The Sum Rate of Vector Gaussian Multiple Description Coding with Tree-Structured Covariance Distortion Constraints
• Combinatorial Message Sharing and a New Achievable Region for Multiple Descriptions
• On the Role of Common Codewords in Quadratic Gaussian Multiple Descriptions Coding
• Multiuser Successive Refinement and Multiple Description Coding