A fast search technique for multistage vector quantization based on the introduction of tree-structure to each stage

In this paper we describe a method to reduce the search complexity required to locate the codevectors during encoding in multistage vector quantization (MSVQ). The core idea is to add a series of codebooks so as to support a tree-structure at each stage. By searching with the tree-structure, substantial complexity reduction can be achieved. The codebook design algorithm, search technique and experimental results are provided, which are compared to traditional techniques to show the advantages of the proposed method.