Fast Searching Algorithm for Vector Quantization Based on Subvector Technique

スポンサーリンク

概要

• 論文の詳細を見る

• A fast algorithm to speed up the search process of vector quantization encoding is presented. Using the sum and the partial norms of a vector, some eliminating inequalities are constructeded. First the inequality based on the sum is used for determining the bounds of searching candidate codeword. Then, using an inequality based on subvector norm and another inequality combining the partial distance with subvector norm, more unnecessary codewords are eliminated without the full distance calculation. 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 proposed algorithm outperforms the existing state-of-the-art search algorithms in reducing the computational complexity and the number of distortion calculation.

• 2008-07-01

著者

• Zhang Tianqi

  Communication And Information Engineering College Chongqing University Of Posts And Telecommunicatio

• Zhu Weile

  Electronic Engineering College University Of Electronic Science And Technology Of China

• CHEN ShanXue

  Electronic Engineering College, University of Electronic Science and Technology of China

• LI FangWei

  Communication and Information Engineering College, ChongQing University of Posts and Telecommunicati

• Li Fangwei

  Communication And Information Engineering College Chongqing University Of Posts And Telecommunicatio

• Chen Shanxue

  Electronic Engineering College University Of Electronic Science And Technology Of China

関連論文

• Fast Searching Algorithm for Vector Quantization Based on Subvector Technique
• Initial Codebook Algorithm of Vector Quantizaton

スポンサーリンク