Efficient Huffman Decoding with Table Lookup

We describe an efficient algorithm for Huffman decoding using table lookup. The algorithm is optimized for ROM-based Huffman decoding. It is a two-step process of prefix template matching followed by a direct table access. We propose an efficient algorithm for choosing the prefix templates according to different optimization criteria. Also, we propose different implementations for the prefix template procedure.