基于子矢量技术的矢量量化码字快速搜索算法  

Fast codeword search algorithm for vector quantization based on subvector technique

作　　者：陈善学[1] 徐皓淋[1] 

机构地区：[1]重庆邮电大学通信与信息工程学院,重庆400065

出　　处：《重庆邮电大学学报（自然科学版）》2010年第3期302-306,共5页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)

基　　金：国家自然科学基金(60602057);重庆市教委基金项目(KJ070511)~~

摘　　要：针对矢量量化编码过程中,码书搜索计算量较大的问题,提出一种基于子矢量技术的矢量量化码字快速搜索算法。算法使用小波变换后的系数合理构造矢量,在码字搜索过程中将输入矢量和码字划分为几个互不重合的子矢量,利用各个子矢量的2范数建立码字排除不等式,最终实现快速排除不匹配码字的目的。实验结果表明,该算法比EEENNS（equal-average equal-variance equal-norm nearest neiohbor search）算法在失真计算次数和计算复杂度上分别减少了51%~63%和25%~40%,相比Pan的算法减少了28%~41%的失真计算次数和31%~44%的计算量,而比Chen的算法则减少了8%~22%的失真计算次数和11%~19%的计算量。Against the problems of large computational complexity for vector quantization,a fast codeword search algorithm for vector quantization based on subvector technique was introduced.The vectors could be effectively constructed by using the wavelet transforms.During the search process for code,with the subvector and L2-norm of a vector,some eliminating inequalities were constructed.So more unnecessary codeword were eliminated without the full distance calculation.From the experimental results,compared with the equal-average equal-variance equal-norm nearest neiohbor search（EEENNS） algorithm,the proposed algorithm reduces the number of distortion calculations by 51% to 63% and reduces the computational complexity by 25% to 40%.Compared with the Pan＇s algorithm,the proposed algorithm reduces the number of distortion calculations by 28% to 41% and reduces the computational complexity by 31% to 44%.More specifically,compared with the Chen＇s algorithm,the proposed algorithm reduces the number of distortion calculations by 8% to 22% and reduces the computational complexity by 11% to 19%.

关 键 词：矢量量化 码字搜索 子矢量 小波变换 

分 类 号：TN919.31[电子电信—通信与信息系统]