Implementation of fast Huffman decoding algorithm

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.