分析Ｇｅｒｓｈｏ提出的关于降低矢量量化中编码的计算复杂度两个算法，指出其适用的范围和不足，并进一步提出有效确定Ｖｏｒｏｎｏｉ区域的快速算法

In order to deduce the complexities of both the realization and coding algorithm for a given quantizer, Gersho 1 suggested two algorithms for computing nonredundant and adjacent codes of a Voronoi cell. After analyzing, we find that these algorithms are not very satisfying because they are involved in integer programming or probabilistic trial. In this paper, we present a new efficient algorithm for the corresponding problem.