Fast encoding algorithms for tree-structured vector quantization

摘要

To overcome extensive compuatations of searching codewords in the encoding process of vector quanitization (VQ), several fast coding approaches has been proposed. As far as we know, the tree-structured search method is the fastest, in this paper, we further develop the encoding algorithm with fast search (EAWFS0 and encoding algorithm with fast comparison (EAWFC) to speed up the encoding process of tree-structured vector quantization (TSVQ). These two approaches are also applicable to pruned tree-structured vector quantization (PTSVQ).