改进的Huffman编码及其应用  

Modified Huffman Code and Its Applications

作　　者：武善玉[1] 晏振鸣 

机构地区：[1]广东茂名学院计算机系,广东茂名525000 [2]中国联通湖北分公司运行维护部,湖北武汉437000

出　　处：《通信技术》2009年第1期309-311,共3页Communications Technology

摘　　要：该文探讨了JPEG压缩技术,重点针对Huffman编码中最优二叉树的"形态"不唯一问题,提出一种基于"简单原则"的新方法。经过这种方法改进的Huffman编码,使得JPEG中相应的值或字符的Huffman编码是唯一的。与传统的Huffman算法及近年来国内外文献中提出的改进算法相比,该方法编码步骤和相关操作更简洁,因而更利于程序的实现和移植。最后给出一个实例,表明此方法的实用性。This paper discusses JPEG digital compression. Based on SIMPLE principle, a new method to encode the optimal binary tree is given. This new modified method makes unique the Huffman code of corresponding value or character in JPEG. As compared with traditional Huffman algorithm and the modified algorithms proposed by literatrues in recent years both at home and abroad, this new modified algorithm is simple and direct in coding process and related operations, and thus is more suitable for realization and transplant of the program. Finally, an example is given, which indicate that this new method is of practical value.

关 键 词：HUFFMAN编码 JPEG 简单原则 

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