## On Universal Quantization by Randomized Uniform/Lattice Quantizers (1992)

Venue: | IEEE Trans. Inform. Theory |

Citations: | 48 - 15 self |

### BibTeX

@ARTICLE{Zamir92onuniversal,

author = {Ram Zamir and Meir Feder},

title = {On Universal Quantization by Randomized Uniform/Lattice Quantizers},

journal = {IEEE Trans. Inform. Theory},

year = {1992},

volume = {38},

pages = {428--436}

}

### Years of Citing Articles

### OpenURL

### Abstract

Uniform quantization with dither, or lattice quantization with dither in the vector case, followed by a universal lossless source encoder (entropy coder), is a simple procedure for universal coding with distortion of a source that may take continuously many values. The rate of this universal coding scheme is examined, and we derive a general expression for it. An upper bound for the redundancy of this scheme, defined as the difference between its rate and the minimal possible rate, given by the rate distortion function of the source, is derived. This bound holds for all distortion levels. Furthermore, we present a composite upper bound on the redundancy as a function of the quantizer resolution which leads to a tighter bound in the high rate (low distortion) case. Key Words: Uniform and Lattice Quantization, Randomized Quantization, Universal Coding, Rate-Distortion Performance Meir Feder was also supported by The Andrew W. Mellon Foundation, Woods Hole Oceanographic Institu...

### Citations

1476 | Information Theory and Reliable Communication - Gallager - 1968 |

730 | Compression of individual sequences via variable-rate coding - Ziv, Lempel - 1978 |

199 |
Asymptotically optimal block quantization
- Gersho
- 1979
(Show Context)
Citation Context ...derive these results by the upper bounds, tighter than (10) and (11), available for deterministic uniform and lattice quantizers, in cases which can be characterized as "high resolution", se=-=e [3] and [4]-=-. For a square error distortion measure the bounds on the redundancy that we came up with can be written as, ae K;n (ffl)s1 2 log 2eGK + 1 2 log P (X +N) P (X) (12) where the first term is the bound o... |

128 | The performance of universal encoding - Krichevsky, Trohov - 1981 |

104 |
Asymptotically efficient quantizing
- Gish, Pierce
- 1968
(Show Context)
Citation Context ...vate to derive these results by the upper bounds, tighter than (10) and (11), available for deterministic uniform and lattice quantizers, in cases which can be characterized as "high resolution&q=-=uot;, see [3]-=- and [4]. For a square error distortion measure the bounds on the redundancy that we came up with can be written as, ae K;n (ffl)s1 2 log 2eGK + 1 2 log P (X +N) P (X) (12) where the first term is the... |

56 |
Voronoi regions of lattices, second moments of polytopes, and quantization
- Conway, Sloane
- 1982
(Show Context)
Citation Context ...ice quantizer with dither, and a mean square error distortion measure, to yield the bound, 1 n H(QK j Z)s1 n H(Q n opt ) + 1 2 log 4eGK (5) 2 where GK is the generalized second moment of the lattice, =-=[6]-=-, i.e. GK = 1 K R V 0 kx \Gammasxk 2 dx i R V 0 dx j 1+2=K x;sx 2 R K (6) andsx is the centroid of the polytope V 0 . Note that G 1 = 1=12, and the minimum value of GK ! 1=2e as K ! 1, so that the min... |

52 |
On the structure of vector quantizers
- Gersho
- 1952
(Show Context)
Citation Context ...esolutions. 12 4 The Redundancy of the Randomized Quantizers at Various Distortion Levels Deterministic uniform and lattice quantizers have been investigated by Gish and Pierce [3], and by Gersho [4],=-=[11]-=-. Unlike our results for the randomized quantizer, the rate, or the entropy, of the deterministic quantizers has been calculated only in the high resolution, or low distortion case, and for sources wi... |

38 |
on universal quantization
- Ziv
- 1985
(Show Context)
Citation Context ...f n=K K-dimensional vectors, quantized independently. In both cases the entropy coder will then take into account the statistical properties of the entire n-dimensional vector. B. Previous Results In =-=[1]-=-,[2], the rate of these quantizers, in encoding a general n-dimensional source, was compared to the rate achieved by the optimal, entropy-constrained, vector quantizer (ECVQ). This optimal n-dimension... |

22 |
Entropy constrained vector quantization
- Chou, Lookabaugh, et al.
- 1989
(Show Context)
Citation Context ...ral n-dimensional source, was compared to the rate achieved by the optimal, entropy-constrained, vector quantizer (ECVQ). This optimal n-dimensional ECVQ can be designed, e.g., using the technique of =-=[5]-=-. It was shown, for example, that for a block of length n, emitted from any source, X, 1 n H (Q 1 (X + Z) \Gamma Z j Z) = 1 n H (Q 1 (X + Z) j Z)s1 n H i Q n opt (ffl; X) j + 1 2 log 4e 12 (4) where Q... |

6 | Universal lossless coding - Davisson |

5 |
On universal quantization with various distortion measures
- Gutman
- 1987
(Show Context)
Citation Context ...K K-dimensional vectors, quantized independently. In both cases the entropy coder will then take into account the statistical properties of the entire n-dimensional vector. B. Previous Results In [1],=-=[2]-=-, the rate of these quantizers, in encoding a general n-dimensional source, was compared to the rate achieved by the optimal, entropy-constrained, vector quantizer (ECVQ). This optimal n-dimensional E... |