A Memory-efficient Huffman Decoding Algorithm

Pi-Chung Wang, Yuan-Rung Yang, Chun-Liang Lee, Hung-Yi Chang,

19th International Conference on Advanced Information Networking and Applications,

pp. 475 - 479 ,2005

Presenter :Yu-Cheng Cheng

Outline

• Introduction

• Decoding Algorithm

• Conclusion

Introduction

• The Huffman code has been widely used

in text、 image and video compression.

• This paper first presents a new array data structure to represent the Huffman tree.

Decoding Algorithm

Table 1. An Example of Huffman Encoding.

Decoding Algorithm

Figure 1. The interval representation of codewords in Table 1.

Decoding Algorithm

Table 2. Interval Representation of Symbols in Table 1.

Decoding Algorithm

Example:

input code ‘01010’

Table 3. Contiguous Interval Representation of Symbols in Table 1.

Decoding Algorithm

Figure 3. The single-side growing Huffman tree of Fig. 1.

Decoding Algorithm

Figure 4. Multiple Interval Arrays.

Conclusion

• An improvement based on single-side growing Huffman tree is presented to further decrease the average lookup time.