Published January 10, 2005
| public
Book Section - Chapter
Open
Rapid near-optimal VQ design with a deterministic data net
- Creators
- Effros, Michelle
-
Schulman, Leonard J.
Abstract
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
EFFisit04.pdf
Files
(250.9 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:643b53ec8a4f4510b577a1933578650a
|
250.9 kB | Preview Download |
Additional details
- Eprint ID
- 7339
- Resolver ID
- CaltechAUTHORS:EFFisit04
- Created
-
2007-02-01Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field