摘要
在传真通信中需要对数据进行压缩后再发送。一维改进的Huffman码(MHC)是在传真通信中使用较多的一种压缩编码。MHC的译码算法和快速译码算法都是通过构造译码树实现译码,但将译码树的码表应用到线性地址空间上时,都存在一定程度冲突,从而会对译码速度产生影响。文中通过对MHC快速译码算法的分析,提出了一种新的译码树构造方法,实现了在线性地址空间上对译码树的构造,并解决了原方法中的冲突问题。
In fax communication, the data should be compressed before transmission. Modified Huffman Code is a commonly used compression code in fax communication. MHC decoding algorithm and fast MHC decoding algorithm are implemented by constructing a decoding tree, some collisions still exist when these algorithms are applied on linear address space and thus the efficiency of decoding would be reduced. This paper proposes a new method for constructing MHC decoding tree by analyzing the fast MHC decoding algorithm, thus to realize the construction of MHC decoding tree on linear address space and solve the collision problem in original method.
出处
《通信技术》
2009年第7期28-30,共3页
Communications Technology
基金
国家自然科学基金资助(无线通信自重构容错NOC研究)项目(90607008)
