Multi-symbol Accessing Huffman Decoding Method for MPEG-2 AAC

An MPEG-2 AAC Huffman decoding method based on the fixed length compactedcodeword tables, where each codeword can contain multiple number of Huffman codes, was proposed. The proposed method enhances the searching efficiency by finding multiple symbols in a singlesearch, i.e., a direct memory reading of the compacted codeword table. The memory usage issignificantly saved by separately handling the Huffman codes that exceed the length of the compactedcodewords. The trade-off relation between the computational complexity and the amount of memoryusage was analytically derived to find the proper codeword length of the compacted codewords for thedesign of MPEG-2 AAC decoder. To validate the proposed algorithm, its performance wasexperimentally evaluated with an implemented MPEG-2 AAC decoder. The results showed that thecomputational complexity of the proposed method is reduced to 54% of that of the most up-to-datemethod. KCI Citation Count: 1