An efficient method of Huffman decoding for MPEG-2 AAC and its performance analysis

An efficient method of Huffman decoding for MPEG-2 AAC and its performance analysis Jae-Sik Lee Jong-Hoon Jeong Tae-Gyu Chang Sch. of Electr. & Electron. Eng., Chung-Ang Univ. Seoul, South Korea; This paper appears in: Speech and Audio Processing, IEEE Transactions on Publication Date: Nov. 2005 Volume: 13, Issue: 6 On page(s): 1206- 1209 ISSN: 1063-6676 INSPEC Accession Number: 8622572 Digital Object Identifier: 10.1109/TSA.2005.852989 Posted online: 2005-10-17 08:45:36.0

Abstract This paper presents a new method for Huffman decoding specially designed for the MPEG-2 AAC audio. The method significantly enhances the processing efficiency of the conventional Huffman decoding realized with the ordinary binary tree search method. A data structure of one-dimensional array is newly designed based on the numerical interpretation of the incoming bit stream and its utilization for the offset oriented nodes allocation. The Huffman tree implemented with the proposed data structure allows the direct computation of the branching location, eliminating the need for the pipeline-violating "compare and jump" instructions. The experimental results show the average performance enhancement of 67% and 285%, compared to those of the conventional binary tree search method and the sequential search method, respectively. The proposed method also shows slightly better processing efficiency, while requiring much less memory space, compared even with those up-to-date efficient search methods of Hashemian and its variants.