DocumentCode
2570059
Title
Implementation of fast Huffman decoding algorithm
Author
He, Ya-Jun ; Zhang, Duo-li ; Shen, Bin ; Geng, Luo-Feng
Author_Institution
Hefei Univ. Of Technol., Hefei
fYear
2007
fDate
22-25 Oct. 2007
Firstpage
770
Lastpage
773
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.
Keywords
Huffman codes; decoding; table lookup; direct combinational logic; fast Huffman decoding algorithm; look-up tables; memory consumption; Algorithm design and analysis; Audio compression; Data compression; Decoding; Helium; Huffman coding; Image coding; Logic; Very large scale integration; Video compression; Data Compression; Huffman Decoding; Pattern Partition;
fLanguage
English
Publisher
ieee
Conference_Titel
ASIC, 2007. ASICON '07. 7th International Conference on
Conference_Location
Guilin
Print_ISBN
978-1-4244-1132-0
Electronic_ISBN
978-1-4244-1132-0
Type
conf
DOI
10.1109/ICASIC.2007.4415744
Filename
4415744
Link To Document