An Adaptive Huffman Decoding Algorithm for MP3 Decoder

This paper proposes a novel array data structure to represent Huffman code table and an adaptive algorithm for Huffman decoding based on Single-side Growing Huffman Coding approach which provides a memory efficient and high-speed decoding algorithm. The search time of the proposed algorithm for finding a symbol is the ceiling of (CL/4) where CL is the code length of the corresponding symbol. The implementation of the proposed algorithm is applied for MP3 decoding and the experimental result shows that our algorithm is applicable to all Huffman decoding applications.