A fast searching technique for multistage residual vector quantizers
- 1 July 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 1 (7) , 114-116
- https://doi.org/10.1109/97.311807
Abstract
The encoding procedure for multistage residual vector quantizers consists of searching a tree to find the codeword that best matches the input. Many techniques have been proposed for searching such trees, ranging from the slow and faithful to the fast and inaccurate. The present authors introduce a simple method, which they call dynamic M-search, that is both fast and effective for searching the residual vector quantization tree. The new method is applied to image coding, performance results are presented, and advantages are shown over conventional M-search.Keywords
This publication has 8 references indexed in Scilit:
- Large block RVQ with multipath searchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An improved sequential search multistage vector quantizerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Joint codebook design for summation product-code vector quantizersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Finite-State Residual Vector QuantizationJournal of Visual Communication and Image Representation, 1994
- Vector quantizers with direct sum codebooksIEEE Transactions on Information Theory, 1993
- Entropy-constrained residual vector quantizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- Vector Quantization and Signal CompressionPublished by Springer Nature ,1992
- Breadth-first trellis decoding with adaptive effortIEEE Transactions on Communications, 1990