会议专题

An Improved Codeword Search Algorithm Based on Subvector Features

An improved fast codeword search algorithm based on subvector features is presented in this paper. First divide every input vector into two subvectors with the same dimension. Then compute the sum and variance of every input vector and its two subvectors in turn, get a series of space division inequalities which are used as the elimination criterions. The result of the simulation shows that in the same coding quality compared with full search algorithm, the proposed algorithm has better data in the average number of distance calculations compared with several classic algorithms.

VQ Codeword Ssearch Subvectors

Xie Linbo Yang wei Huang bang

Key Laboratory of Advanced Process Control for Light Industry, Institude of Systems Engineering, Jiangnan University,Wuxi, Jiangsu, 214122, China

国际会议

2011 Fourth International Conference on Intelligent Computation Technology and Automation(2011年第四届智能计算技术与自动化国际会议 ICICTA 2011)

深圳

英文

443-446

2011-03-28(万方平台首次上网日期,不代表论文的发表时间)