Home/ Questions/Q 637195
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-13T20:35:51+00:00

I have implementated a simple compressor using pure huffman code under Windows.But I do

  • 0

I have implementated a simple compressor using pure huffman code under Windows.But I do not know much about how to decode the compressed file quickly,my bad algorithm is:

Enumerate all the huffman code in the code table then compare it with the bits in the compressed file.It turns out horrible result:decompressing 3MB file would need 6 hours.

Could you provide a much more efficient algorithm?Should I use Hash or something?

Update:
I have implementated the decoder with state table,based on my friend Lin’s advice.I think this method should be better than travesal huffman tree,3MB within 6s.

thanks.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    One way to optimise the binary-tree approach is to use a lookup table. You arrange the table so that you can look up a particular encoded bit-pattern directly, allowing for the maximum possible bit-width of any code.

    Since most codes don’t use the full maximum width, they are included at multiple locations in the table – one location for each combination of the unused bits. The table indicates how many bits to discard from the input as well as the decoded output.

    If the longest code is too long, so the table is impractical, a compromise is to use a tree of smaller fixed-width-subscript lookups. For example, you can use a 256-item table to handle a byte. If the input code is more than 8 bits, the table entry indicates that decoding is incomplete and directs you to a table that handles the next up-to 8 bits. Larger tables trade memory for speed – 256 items is probably too small.

    I believe this general approach is called "prefix tables", and is what BobMcGees quoted code is doing. A likely difference is that some compression algorithms require the prefix table to be updated during decompression – this is not needed for simple Huffman. IIRC, I first saw it in a book about bitmapped graphics file formats which included GIF, some time before the patent panic.

    It should be easy to precalculate either a full lookup table, a hashtable equivalent, or a tree-of-small-tables from a binary tree model. The binary tree is still the key representation (mental model) of how the code works – this lookup table is just an optimised way to implement it.

    • 0