Comparative study and analysis of Windowed Huffman Coding with limited distinct symbols and its variants

Abstract

In this paper, a comparative study among Windowed Huffman Coding with limited distinct symbols and its variants i.e. Windowed Huffman algorithm with more than one window, Windowed Huffman coding with limited distinct symbols by least recently used symbol Removable and Windowed Huffman algorithm with more than one window and least recently used symbol removing are done. The compression ratios offered by these techniques for different types of files are computed and analyzed. Experimental results show that the performances in terms of compression ratios provided by Windowed Huffman coding with limited distinct symbols by least recently used symbol Removable are better than its other variants for almost all types of files. Key Words: Data compression, Huffman tree, Frequency Table (FT), Symbol Code Table (SCT), compression ratio