An efficient method of Huffman decoding for MPEG-2 AAC and its performance analysis
- Authors
- Lee, JS; Jeong, JH; Chang, TG
- Issue Date
- Nov-2005
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- binary tree search; Huffman decoder; MPEG-2 AAC
- Citation
- IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING, v.13, no.6, pp 1206 - 1209
- Pages
- 4
- Journal Title
- IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING
- Volume
- 13
- Number
- 6
- Start Page
- 1206
- End Page
- 1209
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/24490
- DOI
- 10.1109/TSA.2005.852989
- ISSN
- 1063-6676
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of ICT Engineering > School of Electrical and Electronics Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/24490)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.