实现快速霍夫曼解码算法

2007 7th International Conference on ASIC Pub Date : 2007-10-01 DOI:10.1109/ICASIC.2007.4415744

Ya-Jun He, Duoli Zhang, Bin Shen, Luofeng Geng

{"title":"实现快速霍夫曼解码算法","authors":"Ya-Jun He, Duoli Zhang, Bin Shen, Luofeng Geng","doi":"10.1109/ICASIC.2007.4415744","DOIUrl":null,"url":null,"abstract":"An efficient Huffman decoding method is presented in this paper. This new method first partitions a Huffman tree into subtrees. Then some look-up tables are used to represent these subtrees and the symbols of some subtrees are decoded by direct combinational logic. It is shown that by employing this technique decoding operations become significantly faster, and the memory consumption also becomes much smaller compared to the normal Huffman decoding.","PeriodicalId":120984,"journal":{"name":"2007 7th International Conference on ASIC","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Implementation of fast Huffman decoding algorithm\",\"authors\":\"Ya-Jun He, Duoli Zhang, Bin Shen, Luofeng Geng\",\"doi\":\"10.1109/ICASIC.2007.4415744\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An efficient Huffman decoding method is presented in this paper. This new method first partitions a Huffman tree into subtrees. Then some look-up tables are used to represent these subtrees and the symbols of some subtrees are decoded by direct combinational logic. It is shown that by employing this technique decoding operations become significantly faster, and the memory consumption also becomes much smaller compared to the normal Huffman decoding.\",\"PeriodicalId\":120984,\"journal\":{\"name\":\"2007 7th International Conference on ASIC\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 7th International Conference on ASIC\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASIC.2007.4415744\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 7th International Conference on ASIC","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASIC.2007.4415744","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文提出了一种高效的霍夫曼解码方法。这种新方法首先将霍夫曼树划分为子树。然后用一些查询表来表示这些子树，并用直接组合逻辑对子树的符号进行解码。结果表明，采用这种技术的解码操作速度大大提高，并且与正常的霍夫曼解码相比，内存消耗也大大减少。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Implementation of fast Huffman decoding algorithm

An efficient Huffman decoding method is presented in this paper. This new method first partitions a Huffman tree into subtrees. Then some look-up tables are used to represent these subtrees and the symbols of some subtrees are decoded by direct combinational logic. It is shown that by employing this technique decoding operations become significantly faster, and the memory consumption also becomes much smaller compared to the normal Huffman decoding.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 7th International Conference on ASIC

自引率

0.00%

发文量