Fast VQ Encoding Using Subvector Technique

摘要：

In order to speed up the VQ encoding process, it is beneficial to firstly estimate how large the Euclidean distance is between the input vector and a candidate codeword by using appropriate low dimensional features of a vector instead of an immediate Euclidean distance computation. The sum, the partial sums and the partial variances of a vector are used together as the appropriate features in this paper. Utilizing these features between the input vector and a candidate codeword, we obtain some inequalities of eliminating unnecessary codewords. First the inequality based on the sum is used for terminating the searching process. Then, using other inequalities based on subvector sum and variance, more unnecessary codewords are eliminated. During the search process for code, the proposed algorithm can reject a lot of codewords, while introducing no extra distortion compared to the conventional full search algorithm. Experimental results show that the reduction of computation is outstanding in the computational complexity and the number of distortion calculations against full search method.

关键词： Data compression fast codeword search subvector vector quantization.

作者: Chen ShanXue Li FangWei Zhu WeiLe

作者单位: 1Electronic Engineering College, University of Electronic Science and Technology of China, Chengdu, Communication and Information Engineering College, ChongQing University of Posts and Telecommunicati Electronic Engineering College, University of Electronic Science and Technology of China, Chengdu, C

会议类型: 国际会议

会议名称: 第三届IEEE无线通讯、网络技术暨移动计算国际会议

会议地点: 上海

会议语种:英文

在线出版日期: 2007-09-21（万方平台首次上网日期，不代表论文的发表时间）