Published 1994 | Version public
Book Section - Chapter Open

One-pass adaptive universal vector quantization

Abstract

The authors introduce a one-pass adaptive universal quantization technique for real, bounded alphabet, stationary sources. The algorithm is set on line without any prior knowledge of the statistics of the sources which it might encounter and asymptotically achieves ideal performance on all sources that it sees. The system consists of an encoder and a decoder. At increasing intervals, the encoder refines its codebook using knowledge about incoming data symbols. This codebook is then described to the decoder in the form of updates on the previous codebook. The accuracy to which the codebook is described increases as the number of symbols seen, and thus the accuracy to which the codebook is known, grows.

Additional Information

© Copyright 1994 IEEE. Reprinted with permission. This material is based upon work partially supported by the National Science Foundation under an NSF graduate fellowship, by a grant from the Center for Telecommunications at Stanford, and by an AT&T Ph.D. scholarship.

Files

EFFicassp94.pdf

Files (469.8 kB)

Name Size Download all
md5:d1eadc8e8d0fa6a23090f474bfa276a7
469.8 kB Preview Download

Additional details

Identifiers

Eprint ID
7338
Resolver ID
CaltechAUTHORS:EFFicassp94

Dates

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