Effros, Michelle and Schulman, Leonard J. (2005) Rapid near-optimal VQ design with a deterministic data net. In: IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June - 2 July 2004. IEEE , Los Alamitos, CA, p. 299. ISBN 0-7803-8280-3 http://resolver.caltech.edu/CaltechAUTHORS:EFFisit04
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:EFFisit04
We present a new algorithm for fixed-rate vector quantizer (VQ) design with deterministic data net. The algorithm also performs efficient VQ design for simply characterized continuous distributions. The algorithm also serves as an approximation algorithm for the d-dimensional fixed-rate operational distortion-rate function, extends to a variety of network VQ problems. The algorithm generalizes to give /spl epsiv/-approximation algorithms for many network VQ design problems. A few examples are multiresolution VQ (MRVQ), multiple description VQ (MDVQ), side information VQ (SIVQ), Broadcast VQ (BCVQ), joint source-channel VQ (JSCVQ) and remote source VQ (RSVQ).
|Item Type:||Book Section|
|Additional Information:||© Copyright 2004 IEEE. Reprinted with permission. M. Effros is partially supported by NSF CCR-0220039 and Caltech’s Lee Center for Advanced Networking. L.J. Schulman is partially supported by NSF CCR-0049092, the Charles Lee Powell Foundation, and a visiting membership at MSRI.|
|Subject Keywords:||approximation theory; combined source-channel coding; vector quantization; source code design; source coding theory; network information theory|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||01 Feb 2007|
|Last Modified:||26 Dec 2012 09:31|
Repository Staff Only: item control page