By Topic

Dynamic window search and probability dominated algorithm for fast vector quantization encoding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Wu Yung-Gi ; Dept. of Comput. Sci. & Inf. Eng., Leader Univ., Tainan, Taiwan

Summary form only given. Vector quantization (VQ), which has been widely applied in speech and video coding, provides an efficient technique for signal compression due to its excellent rate-distortion performance. A fast encoding method to speed up the closest codeword algorithm was proposed by accounting for the occurrence of each codeword for every input vector before practical encoding. Simulation results demonstrate that the little processing and memory cost significantly reduces the search time while marinating the same encoding quality as that of the full search algorithm. It was found that the proposed algorithm outperforms all existing VQ encoding algorithms.

Published in:

Data Compression Conference, 2003. Proceedings. DCC 2003

Date of Conference:

25-27 March 2003