By Topic

Erasure Multiple Descriptions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ahmed, Ebad ; Sch. of Electr. & Comput. Eng., Cornell Univ., Ithaca, NY, USA ; Wagner, A.B.

A binary erasure version of -channel multiple descriptions (MD) with symmetric descriptions (i.e., the rates of the descriptions are equal and the distortion constraint depends only on the number of messages received) is considered. No excess rate for every out of descriptions, i.e., any messages have sum rate , where is Shannon's rate-distortion function for erasure distortion and is the distortion constraint to be met, is investigated. The goal is to characterize the achievable distortions . Reconstruction fidelity is measured using two criteria: a worst-case criterion which computes distortion by maximizing the per-letter distortion over all source sequences, and an average-case criterion which computes distortion by averaging the per-letter distortion over all source sequences. Achievability schemes are presented, based on systematic maximum distance separable codes for worst-case distortion and random binning for average-case distortion, and optimality results are proved for the corresponding distortion regions. The erasure MD setup is then used to propose a layered coding framework for multiple descriptions, which is then applied to vector Gaussian MD and shown to be optimal for symmetric scalar Gaussian MD with two levels of receivers and no excess rate at the central receiver.

Published in:

Information Theory, IEEE Transactions on  (Volume:58 ,  Issue: 3 )