Balancing decoding speed and memory usage for Huffman codes using quaternary tree

In this paper, we focus on the use of quaternary tree instead of binary tree to speed up the decoding time for Huffman codes. It is usually difficult to achieve a balance between speed and memory usage using variable-length binary Huffman code. Quaternary tree is used here to produce optimal codeword that speeds up the way of searching. We analyzed the performance of our algorithms with the Huffman-based techniques in terms of decoding speed and compression ratio. The proposed decoding algorithm outperforms the Huffman-based techniques in terms of speed while the compression performance remains almost same.