Fast Huffman decoding algorithm by multiple-bit length search scheme for MPEG-2/4 AAC

Han Chang Ho, Sheau Fang Lei

研究成果: Conference contribution

1 引文 斯高帕斯(Scopus)

摘要

Huffman coding is essential to the MPEG-2/4 Advanced Audio Coding (AAC) standard. The process of Huffman decoding requires a long delay because much computational time is consumed by an excessive number of searches for decoded symbols. In this paper, a fast Huffman decoding algorithm is proposed that reduces the number of searches required. The algorithm uses a search scheme in which a 5-bit length is used for each search basis to decode symbols. Experimental results show that a 5-bit search scheme can be hit with a probability of 70% to decode the symbols. Thus, the proposed method can reduce the number of search iterations, reducing the processing delay and increasing the processing efficiency for Huffman decoding. Compared with other algorithms for Huffman decoding, the proposed algorithm can reLce the number of search iterations by 35% to 73%, and the number of instructions by 32% to 60%.

原文English
主出版物標題ISCAS 2010 - 2010 IEEE International Symposium on Circuits and Systems
主出版物子標題Nano-Bio Circuit Fabrics and Systems
頁面2844-2847
頁數4
DOIs
出版狀態Published - 2010 八月 31
事件2010 IEEE International Symposium on Circuits and Systems: Nano-Bio Circuit Fabrics and Systems, ISCAS 2010 - Paris, France
持續時間: 2010 五月 302010 六月 2

出版系列

名字ISCAS 2010 - 2010 IEEE International Symposium on Circuits and Systems: Nano-Bio Circuit Fabrics and Systems

Other

Other2010 IEEE International Symposium on Circuits and Systems: Nano-Bio Circuit Fabrics and Systems, ISCAS 2010
國家/地區France
城市Paris
期間10-05-3010-06-02

All Science Journal Classification (ASJC) codes

  • 硬體和架構
  • 電氣與電子工程

指紋

深入研究「Fast Huffman decoding algorithm by multiple-bit length search scheme for MPEG-2/4 AAC」主題。共同形成了獨特的指紋。

引用此