矢量量化快速码字搜索算法中，为了有效地减小搜索范围，必须对原始码书按一定的准则进行重新排序。对现存的两类快速码字搜索算法进行了总结，其中一类是码书按1维顺序关系排序，另一类是码书按2维相邻关系排序。通过实验给出了两类算法的搜索范围和编码时间，并进行了比较和分析，进而提出了在实际编码时如何更好地使用这两种排序关系的准则。

In order to reduce search space efficiently, the codebook must be rearranged in the fast codeword search algorithms of vector quantization. Two kinds of algorithms are summarized in this paper. One is the codebook sorted by 1D characteristic value; the other is the codebook mapped into 2D adjacent ripples. Comparisons and analysis are conducted for these two kinds of fast algorithms in terms of the search space and encoding time. The criteria about how to use these two rearrangement method reasonably is also given in this paper.