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

一种新的用于电子词典的数据压缩算法
引用本文:何志兰,崔杜武. 一种新的用于电子词典的数据压缩算法[J]. 计算机工程, 2005, 31(21): 176-178
作者姓名:何志兰  崔杜武
作者单位:西安理工大学计算机学院,西安,710048
摘    要:电子词典西文只有26个大小写字母,而汉字成百上千,利用此数据特点提出分别对中文和西文采用不同的压缩算法,此算法是对传统电子词典采用Huffman编码,将中文和西文不加区分混合进行压缩编码,对所存在缺陷进行改进。使电子词典的压缩率和压缩速度大大提高,同时在保证压缩率相等的情况下,使编码均匀分布减少预分配内存空间和增强抗误码的能力。最后通过实例比较了两种压缩的效率,说明新压缩方案的正确性和可行性。

关 键 词:电子词典 最小深度Huffman树 编码 压缩
文章编号:1000-3428(2005)21-0176-02
收稿时间:2004-09-13
修稿时间:2004-09-13

A New Algorithm of Data Compression for Electronic Dictionary
HE Zhilan,CUI Duwu. A New Algorithm of Data Compression for Electronic Dictionary[J]. Computer Engineering, 2005, 31(21): 176-178
Authors:HE Zhilan  CUI Duwu
Abstract:A new algorithm of data compression for electronic dictionary is introduced, separately compresses the Chinese characters and letters according to property of electronic dictionary whose characters have 26 capital and lowercase letters with being hundreds and thousands of Chinese characters, against the deficiencies of the current methods. The new algorithm is improved the rate and the speed of compression, and the symmetrical encoding also decrease memory allotted beforehand and bit error rate with the identical rate of compression. Finally, in the paper discusses the instances of two algorithms of data compressions, the correctness and feasibility of the new one are fully proved.
Keywords:Electronic dictionary   Minimal huffman tree   Encoding   Compression
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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