Fast Data Compression Using Huffman-Based Tree Structure

Abstract

There is a high demand to improve the encoding and decoding speed of data compression among modern users. When a binary Huffman code is used, it requires more time to compress or decompress every single bit. The technique which is being proposed in this paper is a new Huffman-Based tree structure instead of a consistent binary tree to reduce decoding time complexity. Since the traversing time depends on the height of the tree, the proposed tree structure provides a smaller height than the height of the regular binary tree. The performance of the regular Huffman tree technique and proposed technique is evaluated in terms of the decoding time. According to the results analyzed, the proposed technique outperforms the current Binary tree technique in terms of decompression speed while the compression performance remains nearly the same.