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

基于自适应搜索范围及顺序的快速矢量量化编码算法
引用本文:陆哲明,潘正祥,孙圣和. 基于自适应搜索范围及顺序的快速矢量量化编码算法[J]. 电子学报, 2000, 28(8): 91-93
作者姓名:陆哲明  潘正祥  孙圣和
作者单位:1. 哈尔滨工业大学自动化测试与控制系,黑龙江哈尔滨 150001;2. 高雄科学技术学院电子工程系,台湾高雄
摘    要:本文提出了一种新颖的快速矢量量化编码算法.该算法在编码前预先计算每个码字的四个特征量,然后根据各特征量的升序排列分别对码字进行排序以生成四个排序码书.在编码过程中,对于不同的输入矢量,自适应产生不同的动态码字搜索范围及顺序而排除大部分码字.测试结果表明,本文算法只需搜索3%到8%码字而获得与穷尽搜索算法相近的编码质量,实际编码时间减少约93%.

关 键 词:矢量量化  快速编码  
收稿时间:1999-06-25

A Fast Vector Quantization Encoding Algorithm Based on Adaptive Searching Range and Sequence
LU Zhe-ming,PAN Jeng-shyang,SUN Sheng-he. A Fast Vector Quantization Encoding Algorithm Based on Adaptive Searching Range and Sequence[J]. Acta Electronica Sinica, 2000, 28(8): 91-93
Authors:LU Zhe-ming  PAN Jeng-shyang  SUN Sheng-he
Affiliation:1. Dept.of Automatic Test and Control,Harbin Institute of Technology,Harbin 150001,China;2. Dept.of Electronic Engineering,Kaohsiung Institute of Technology,Kaohsiung,Taiwan
Abstract:A novel fast encoding algorithm is presented for vector quantization.Before encoding,four characteristic values are first computed for each codeword,then four ordered codebooks are obtained according to the ascending order of four characteristic values respectively.During the encoding process,the adaptive searching range and sequence are obtained for each input vector in order to reject a lot of unmatched codewords.The test result shows that this algorithm enables us to search merely 3% to 8% of the codewords to encode an input vector while preserving its coding performance very close to that of the full search method,and the reduction of encoding time is about 93% against full search method.
Keywords:vector quantization  fast encoding
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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