Low memory and MIPS efficient technique for decoding Huffman codes using multi-stage, multi-bits lookup at different levels

摘要

Present herein is a low memory and MIPS efficient technique for decoding Huffman codes using multi-stage, multi-bits lookup at different levels. A binary tree is cut at levels depending on the quotient of the number of existing nodes and the number of possible nodes.