Compacted codeword Huffman decoding method for MPEG-2 AAC decoder

Abstract

This paper proposes a new MPEG-2 AAC Huffman decoding algorithm which is designed to find multiple symbols in a single search. The analysis and experimental results show that the computational complexity of the proposed method is lower by more than 46% when compared with those of the up-to-date methods.