摘要
分析Gersho提出的关于降低矢量量化中编码的计算复杂度两个算法,指出其适用的范围和不足。
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.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
1999年第7期83-88,共6页
Systems Engineering-Theory & Practice
关键词
信源编码
矢量量化
Voronoi区域
单纯形算法
source coding
vector quantizers
Voronoi cell
linear programming
simplex algorithm