Skip to Main Content
An efficient Huffman decoding method is presented in this paper. This new method first partitions a Huffman tree into subtrees by a set of regular bit-patterns. Then, some look-up tables are used to represent these subtrees. Using this method, a Huffman tree can be represented compactly and the decoding of codewords can be performed quickly by the matching of regular bit-patterns.