基于改进哈夫曼编码的数据压缩方法研究  

Research of Data Compression Method Based on the Improved Huffman Code Algorithm

作　　者：张红军[1] 徐超[1] 

机构地区：[1]安阳师范学院人文管理学院,河南安阳455000

出　　处：《唐山师范学院学报》2014年第5期40-43,共4页Journal of Tangshan Normal University

摘　　要：作为一种无损压缩编码方法,哈夫曼编码在数据压缩中具有重要的应用。经典的哈夫曼编码是在构造哈夫曼的基础上自下而上进行的,通过分析哈夫曼算法的思想,给出了一种改进的哈夫曼数据压缩算法。该算法利用队列结构,从哈夫曼的根节点出发,向叶子节点进行编码,在编码过程中仅将哈夫曼树的每个叶子节点进行一次扫描便可以得到各个叶子节点的哈夫曼编码。实验表明,改进算法不仅压缩率高于以往算法,而且保证了最终生成的压缩文件的安全性。As a non-losing compressing coding algorithm, Huffman coding has many important application to the current data compression field.The classic algorithm to get Huffman coding is from bottom to top on the basis of the Huffman tree. This paper gives an improved Huffman algorithm of data compression by the analysis of the Huffman algorithm, in which algorithm go from the root node to leaf nodes of the Huffman tree by using the queue structure.In the coding process, every leaf node is only scanned once before getting the Huffman coding.The experimental result shows the fact that the improved algorithm not only the compression ratio is higher than classic algorithm, but also ensure the security and confidentiality of the resulting compressed.

关 键 词：哈夫曼编码 哈夫曼算法 改进 数据压缩 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]