By Topic

A fast encoding algorithm for vector quantization based on weighted variance inequality and Hadamard transform

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

2 Author(s)
Linbo Xie ; Key Lab. of Adv. Process Control for Light Ind., Jiangnan Univ., Wuxi, China ; Bang Huang

Vector quantization is one of high performance and popular methods for data compression. But it is extremely time consuming during the encoding process. In this paper, a fast encoding algorithm for vector quantization is proposed to save the computation time. This algorithm uses two characteristics of a vector, Hadamard transform (HT) and variance. The methods using one of these features was already proposed, they handles these features separately. Here, the proposed algorithm put forward a new inequality which utilizes these features simultaneously to rejects more codewords which are impossible to be the nearest codeword in the distortion computations stage. This method produces the same output as conventional full search algorithm. The simulation results show that the effectiveness of the proposed algorithm is outstanding.

Published in:

Computer Research and Development (ICCRD), 2011 3rd International Conference on  (Volume:4 )

Date of Conference:

11-13 March 2011