Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 10, 2005 | public
Book Section - Chapter Open

Rapid near-optimal VQ design with a deterministic data net


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).

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.


Files (250.9 kB)
Name Size Download all
250.9 kB Preview Download

Additional details

August 22, 2023
October 16, 2023