Optimal mapping for 2-bit high speed Huffman compression
M.A. Bassiouni, Amar Mukherjee · 2002
The efficiency of Huffman compression in communications networks can be significantly enhanced by a scheme called multibit decoding. The scheme is based on the concept of k-bit trees which are used to decode up to k bits at a time. An optimal solution for the mapping of 2-bit trees into memory is presented. The 2-bit mapping is storage efficient; and offers an attractive way to obtain significant improvement in the speed of Huffman decoding.>