Effros, M. and Chou, P. A. and Gray, R. M. (1994) Rates of convergence in adaptive universal vector quantization. In: IEEE International Symposium on Information Theory (ISIT '94), Trondheim, Norway, 27 June - 1 July 1994. IEEE , Piscataway, NJ, p. 456. ISBN 0-7803-2015-8 http://resolver.caltech.edu/CaltechAUTHORS:EFFisit94a
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:EFFisit94a
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.
|Item Type:||Book Section|
|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.|
|Subject Keywords:||adaptive signal processing; coding errors; convergence of numerical methods; error statistics; rate distortion theory; sequential codes; vector quantization; source coding theory; universal source coding|
|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