1. 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 ,2005
Presenter :Yu-Cheng Cheng

2. Outline
Introduction
Decoding Algorithm
Conclusion

3. 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.

4. Decoding Algorithm
Table 1. An Example of Huffman Encoding.

5. Decoding Algorithm
Figure 1. The interval representation of codewords in Table 1.

6. Decoding Algorithm
Table 2. Interval Representation of Symbols in Table 1.

7. Decoding Algorithm Example: input code ‘01010’
Table 3. Contiguous Interval Representation of Symbols in Table 1.

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

9. Decoding Algorithm
Figure 4. Multiple Interval Arrays.

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