An Adaptive Huffman Decoding Algorithm for MP3 Decoder Hoang-Anh Pham, Van-Hieu Bui, Anh-Vu Dinh-Duc, IEEE International Symposium on Electronic Design, pp. 153-157, 2010 Presenter :Yu-Cheng Cheng Outline • Introduction • The Adaptive Algorithm • Conclusion Introduction • Huffman coding is a method that compresses and encodes a given set of data by using a variable-length code table. • This paper proposes a novel array data structure to represent Huffman code table. The Adaptive Algorithm TABLE 1. An example of Huffman code table (HCT) The Adaptive Algorithm Figure 1. Huffman tree corresponding to HCT in TABLE I The Adaptive Algorithm Figure 2. The HT-clusters corresponding to the HT in Figure 1 The Adaptive Algorithm Figure 4. Entry Format of the LUT Figure 3. The Super-Tree corresponding to the HT-clusters in Figure 2 The Adaptive Algorithm TABLE II LUTS and SYTS of HT-clusters The Adaptive Algorithm TABLE III. Cluster Height Table TABLE II. LUTS and SYTS of HT-clusters The Adaptive Algorithm Example: The encoded data represented in bit-stream 000000001000001101101 Conclusion • The proposed algorithm provides a memory efficient and high-speed Huffman decoding. The search time to identify a symbol is [CL/4].