A note on optimal multidimensional companders (Corresp.)

Authors:
J. Bucklew
Affiliations:
-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

Optimal companding vector quantization for circularly symmetric sources

Information Sciences: an International Journal
Learning a multi-dimensional companding function for lossy source coding

Neural Networks
Geometric piecewise uniform lattice vector quantization of the memoryless Gaussian source

Information Sciences: an International Journal

Quantified Score

Hi-index	754.84

Visualization

Abstract

Companding is a widely used method of implementing nonuniform quantizers. There are, however, problems in extending this technique to the multidimensional case. It is known, for example, that not all input probability densities can be quantized optimally in this fashion. In this note we characterize the class of probability density functions that can be optimally quantized with a multidimensional companding-type implementation.