A structured fixed-rate vector quantizer derived from a variable-length scalar quantizer. I. Memoryless sources
- 1 May 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (3) , 851-867
- https://doi.org/10.1109/18.256493
Abstract
A low-complexity, fixed-rate structured vector quantizer for memoryless sources is described. This quantizer is referred to as the scalar-vector quantizer (SVQ), and the structure of its codebook is derived from a variable-length scalar quantizer. Design and implementation algorithms for this quantizer are developed and bounds on its performance are provided. Simulation results show that performance close to that of the optimal entropy-constrained scalar quantizer is possible with the fixed-rate quantizer. The SVQ is also robust against channel errors and outperforms both Lloyd-Max and entropy-constrained scalar quantizers for a wide range of channel error probabilitiesKeywords
This publication has 26 references indexed in Scilit:
- Trellis-based scalar-vector quantizer for memoryless sourcesIEEE Transactions on Information Theory, 1994
- Vector Quantization and Signal CompressionPublished by Springer Nature ,1992
- Fine-coarse vector quantizationIEEE Transactions on Signal Processing, 1991
- Trellis coded quantization of memoryless and Gauss-Markov sourcesIEEE Transactions on Communications, 1990
- A pyramid vector quantizerIEEE Transactions on Information Theory, 1986
- Product code vector quantizers for waveform and voice codingIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- Fast quantizing and decoding and algorithms for lattice quantizers and codesIEEE Transactions on Information Theory, 1982
- Minimum entropy quantizers and permutation codesIEEE Transactions on Information Theory, 1982
- Optimum quantizers and permutation codesIEEE Transactions on Information Theory, 1972
- Permutation codes for sourcesIEEE Transactions on Information Theory, 1972