A numerical Huffman decoder

Abstract

We formulate the Huffman decoding as a root-solving problem so that powerful numerical techniques such as the Newton method and the bisection method are employed for solution. The sectioning technique that narrows the searching scope for solution is further proposed for increasing the decoding speed. The numerical decoder is fast and memory efficient; it is also simple to realize and suitable for integrated circuit implementation.