摘要
串表压缩(Lempel Ziv Welch,LZW)算法在词条存储过程中会重复存储已存储内容,在编码过程中造成内存浪费,而Huffman算法会占用CPU大量时间,为了克服这2种算法的缺点,提出了一种LZW-Huffman混合算法,在该算法的LZW编码阶段,采用二叉树结构存储词条,且对词条出现次数进行统计,再根据LZW压缩结果进行Huffman编码.经过测试分析,该混合算法能够节省LZW编码过程中的内存资源,压缩效果优于原始算法.
The LZW algorithm stores the stored contents repeatedly in the entry storage process, which wastes memory in encoding process, and the Huffman algorithm takes up a lot of CPU time. In order to overcome the shortcomings of the said two algorithms, a hybrid LZW-Huffman algorithm is proposed in this paper. In the LZW encoding phase of the algorithm, binary tree structure is used to store entries, meanwhile the number of entries is counted, and then Huffman encoding is done according to the result of LZW compression. After testing and analysis, the hybrid algorithm can save memory resources in LZW encoding process, and the compression effect is better than the previous algorithm.
作者
崔方送
CUI Fang-song(The Information Center of Anhui Huangmei Opera Art Vocational College, Anqing Anhui 246052, China)
出处
《兰州工业学院学报》
2019年第2期54-56,共3页
Journal of Lanzhou Institute of Technology
基金
2017年安徽省高校自然科学研究重点项目(KJ2017A915)
2016年安徽省高等教育创新发展行动计划(RW_11_s34)
