A Fast and Memory Efficient Huffman Decoding Method for the MPEG-4 AAC Standard

Author

Junior, Gutemberg G S ; Lima, Mateus A M ; Filho, Walter O G ; Perkusich, Angelo ; Morais, Marcos R A ; Lima, Antonio Marcus N

Author_Institution

Embedded Syst. & Pervasive Comput. Lab., UFCG, Campina Grande

fYear

2008

fDate

9-13 Jan. 2008

Firstpage

1

Lastpage

2

Abstract

Huffman coding is an efficient coding technique that is largely used in applications that need a lossless data compression. We present in this paper a novel method for Huffman decoding that increases the performance and keeps the memory consumption low. The main idea is to add information about the number of bits necessary to search for the next possible symbol in the Huffman tree. The proposed method has been used in the implementation of an MPEG-4 AAC decoder, and has proven to be extremely fast to decode short symbols that are the ones with higher probability to occur in a bitstream.

Keywords

Huffman codes; audio coding; data compression; decoding; Huffman coding; Huffman decoding method; Huffman tree; MPEG-4 AAC audio standard; MPEG-4 AAC decoder; lossless data compression; memory efficient decoding method; Binary trees; Data compression; Decoding; Digital TV; Huffman coding; Image coding; MPEG 4 Standard; Mobile handsets; Streaming media; Video compression;

fLanguage

English

Publisher

ieee

Conference_Titel

Consumer Electronics, 2008. ICCE 2008. Digest of Technical Papers. International Conference on

Conference_Location

Las Vegas, NV

Print_ISBN

978-1-4244-1458-1

Electronic_ISBN

978-1-4244-1459-8

Type

conf

DOI

10.1109/ICCE.2008.4588096

Filename

4588096