Fast adaptive search algorithm for vector quantization by progressive codebook arrangement

https://doi.org/10.1016/0167-8655(92)90111-CGet rights and content

Abstract

The present paper suggests a simple and efficient search method for Vector Quantization. It exploits both the high correlation between contiguous frames and the source signal statistics by rearranging dynamically the codebook. Simulation results indicate a reduction of up to 90 percent of computational operations in comparison with the conventional full search method.

References (7)

  • C.D. Bei et al.

    An improvement of the minimum distorsion encoding algorithm for vector quantization

    IEEE Trans. Comm.

    (1985)
  • K.K. Paliwal et al.

    Effect of ordering the codebook on the efficiency of the partial distance search algorithm for vector quantization

    IEEE Trans. Comm.

    (1989)
  • S.H. Chen et al.

    Fast search algorithm for VQ-based recognition of isolated words

There are more references available in the full text version of this article.

Cited by (0)

View full text
Copyright © 1992 Published by Elsevier B.V.