| 基于广义规范Huffman树的高效编解码算法 |
| |
| 引用本文： | 郭建光,张卫杰,杨健,安文韬,熊涛.基于广义规范Huffman树的高效编解码算法[J].清华大学学报(自然科学版),2009(1). |
| |
| 作者姓名： | 郭建光 张卫杰 杨健 安文韬 熊涛 |
| |
| 作者单位： | 清华大学电子工程系; |
| |
| 基金项目： | 横向协作项目(20084810031) |
| |
| 摘 要： | 为了减少编码时消耗的时间和空间,以便适应实时处理,提出了基于广义规范Huffman树的高效数据压缩算法。该算法利用层次和概率表顺序,保证编、解码的唯一性;利用移动排序替代搜索;建立索引表来简化排序操作;融入均衡编码的思想。同时,根据编码思想提出了相应的解码算法。通过实际数据验证,与传统的Huffman算法相比,该算法在时间和空间效率上有了一定提高,且使得码字更为均衡。
|
| 关 键 词： | 无损数据压缩 Huffman编码 广义规范Huffman树 均衡编码 |
Efficient coding and decoding algorithm based on generalized Huffman tree |
| |
| GUO Jianguang,ZHANG Weijie,YANG Jian,AN Wentao,XIONG Tao.Efficient coding and decoding algorithm based on generalized Huffman tree[J].Journal of Tsinghua University(Science and Technology),2009(1). |
| |
| Authors: | GUO Jianguang ZHANG Weijie YANG Jian AN Wentao XIONG Tao |
| |
| Institution: | Department of Electronic Engineering;Tsinghua University;Beijing 100084;China |
| |
| Abstract: | The traditional Huffman coding,a variable-length coding technique,is widely used for lossless data compression.A generalized Huffman tree coding algorithm was developed to reduce the time and memory for real-time processing.The layer and probability-table order were used to ensure the uniqueness of the coding and decoding.A shift sort was used instead of a search with an indexing table used to simplify the sort.A decoding algorithm is also given.Compared with the traditional Huffman coding technique used in... |
| |
| Keywords: | lossless data compression Huffman coding generalized Huffman tree balanced coding |
| 本文献已被 CNKI 等数据库收录！ |
|
