A memory efficient and fast huffman decoding algorithm

Abstract

To reduce the memory size and speed up the process of searching for a symbol in a Huffman tree, we propose a momory-efficient array data structure to represent the Huffman tree. Then, we present a fast Huffman decoding algorithm,which takes O(log,n) time and uses┌3n/2┐+┌ n/2logn┐+1 memory space, where n is the number of symbols in a Huffman tree.