A Fast Encoding Algorithm for Vector Quantization Based on Weighted Variance Inequality and Hadamard Transform
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.
VQ codeword search HTS variance
Linbo Xie Bang Huang
Key Laboratory of Advanced Process Control for Light Industry,Ministry of Education Institute of System Engineering,Jiangnan University Wuxi,China
国际会议
上海
英文
324-327
2011-03-11（万方平台首次上网日期，不代表论文的发表时间）