Published 1999 | Version public
Book Section - Chapter Open

Generalized multiple description vector quantization

Abstract

Packet-based data communication systems suffer from packet loss under high network traffic conditions. As a result, the receiver is often left with an incomplete description of the requested data. Multiple description source coding addresses the problem of minimizing the expected distortion caused by packet loss. An equivalent problem is that of source coding for data transmission over multiple channels where each channel has some probability of breaking down. Recent work in practical multiple description coding explores the design of multiple description scalar and vector quantizers for the case of two channels or packets. This paper presents a new practical algorithm, based on a ternary tree structure, for the design of both fixed- and variable-rate multiple description vector quantizers for an arbitrary number of channels. Experimental results achieved by codes designed with this algorithm show that they perform well under a wide range of packet loss scenarios.

Additional Information

© Copyright 2002 IEEE. Reprinted with permission. This material is based upon work supported by the Pickering Fellowship, NSF Grant No. MIP-9501977, the Intel Technology for Education 2000 program, and a grant from the Charles Lee Powell Foundation

Files

FLEdcc99.pdf

Files (200.4 kB)

Name Size Download all
md5:ec0d1a27bee711b6f0c1471c42965649
200.4 kB Preview Download

Additional details

Identifiers

Eprint ID
7426
Resolver ID
CaltechAUTHORS:FLEdcc99

Dates

Created
2007-02-13
Created from EPrint's datestamp field
Updated
2021-11-08
Created from EPrint's last_modified field