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 1994 | public
Book Section - Chapter Open

Rates of convergence in adaptive universal vector quantization


We consider the problem of adaptive universal quantization. By adaptive quantization we mean quantization for which the delay associated with encoding the jth sample in a sequence of length n is bounded for all n>j. We demonstrate the existence of an adaptive universal quantization algorithm for which any weighted sum of the rate and the expected mean square error converges almost surely and in expectation as O(√(log log n/log n)) to the corresponding weighted sum of the rate and the distortion-rate function at that rate.

Additional Information

© Copyright 1994 IEEE. Reprinted with permission. This material is based upon work partially supported by an AT&T Ph.D. Scholarship, by a grant from the Center for Telecommunications at Stanford, and by an NSF Graduate Fellowship.


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

Additional details

August 22, 2023
October 16, 2023