Power analysis of the Huffman decoding tree

A power analysis of the Huffman decoding tree for variable length decoding is presented. Leakage power is shown to be the primary component for large table sizes, while dynamic power has a role in smaller table sizes. Area increases nearly linearly with increasing table size, regardless of the probabilities of the symbols for a given table size, while the delay depends more on the probabilities. Although delay of the tree can be larger than other table lookup types, it is acceptable for mobile devices in order to reduce power.