摘要
介绍了一种改进的Huffman数据压缩算法。针对Huffman算法的不足,首先对编码溢出进行了改进,通过线性链表存储编码,第二个改进是采用堆排序算法,这种方法可以减少对内存读写的次数,提高系统的响应速度。论文最后采用3个JPG文件对Huffman*和经典的Huffman进行了对比分析,实验表明改进算法的耗时与经典算法相比要少的多。
A data compression algorithm named Huffman based on Huffman is presented in this paper.The improvements can be generalized two aspects.The fist is about the overflow of code,which is linear link,and the second improvement is a heap sort algorithm,which needs a few times in reading main memory and advances the responsed speed.Finally,we use three documents of JPG to show the promising experimental results compared with the classical Huffman algorithm.It proves the compression algorithm is less than the classical algorithm.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第2期73-74,共2页
Computer Engineering and Applications
基金
江苏省哲学社会科学基金资助项目。
