an adaptive, memory-efficient and fast algorithm for huffman decoding and its implementation
This paper proposes an adaptive algorithm for Huffman decoding and its implementation based on Single-side Growing Huffman Coding approach which provides a memory efficient and highspeed decoding algorithm. The search time of the proposed algorithm for finding a symbol is [ CL /4] where CL is the code length of the corresponding symbol. This algorithm is applied for MP3 decoding. The result shows that the proposed algorithm is applicable to all applications using Huffman decoding.
huffman decoding huffman code table (hct) huffman tree (ht)