首页 | 本学科首页   官方微博 | 高级检索  
     

等和值块扩展最近邻矢量量化码字搜索算法
引用本文:王冬芳,余宁梅,张如亮,杨媛.等和值块扩展最近邻矢量量化码字搜索算法[J].计算机工程与应用,2006,42(29):36-38.
作者姓名:王冬芳  余宁梅  张如亮  杨媛
作者单位:西安理工大学电子工程系,西安,710048
基金项目:国家自然科学基金;西安理工大学校科研和教改项目
摘    要:论文提出一种等和值块扩展最近邻矢量量化码字搜索算法。该算法将码书按和值大小排序分块,并将每一块中间或中间附近的码字的和值作为本码书块的特征和值。编码时,查找与输入矢量和值距离最近的码书块并作为初始匹配码书块。然后在该码书块附近上下扩展搜索相邻码书块中距输入矢量最近的码字。该算法具有无复杂运算的特点,易于VLSI技术实现。仿真结果表明,该算法是一种有效的码字搜索算法。

关 键 词:矢量量化  码字搜索  快速编码
文章编号:1002-8331(2006)29-0036-03
收稿时间:2006-05
修稿时间:2006-05

Equal-Sum Block-Extending Nearest Neighbor Search Algorithm
WANG Dong-fang,YU Ning-mei,ZHANG Ru-liang,YANG Yuan.Equal-Sum Block-Extending Nearest Neighbor Search Algorithm[J].Computer Engineering and Applications,2006,42(29):36-38.
Authors:WANG Dong-fang  YU Ning-mei  ZHANG Ru-liang  YANG Yuan
Abstract:A fast vector quantization encoding algorithm,equal-sum block-extending nearest neighbor search algorithm, is presented in this paper.Before the search process,all codewords in the codebook are sorted in the ascending order of their sum,and the codebook is divided into blocks in average.The sum of the mid codeword in each block is regarded as eigenvalue of this block.During the search process,the authors firstly search the block whose eigenvalue is nearest to the sum of the input vector,and initialize the current block to be the closest one.And secondly,we can find out a nearest codeword to the input vector using up-down search mechanism in the blocks near the initial best-matching block.This algorithm without complex operations is easy to be implemented using VLSI technology.Experimental results demonstrate that the proposed algorithm is effective.
Keywords:vector quantization  codeword search  fast encoding
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号