An Octonary Huffman Decoding Method and Its Application to MPEG-4

Huffman D A. A method for the construction of minimumredundancy codes[J].Proceedings of IRE.1952, 40(10):1098-1101[2]Jain A K. Image data compression: An overview[J].Proc. IEEE.1981, 69(3):349-389[3]Bell T C, Cleary J G, and Witten I H. Text Compression.New Jersey: Prentice-Hall, 1990: 102-108.[4]Schwartz E S and Kallick B. Generating a canonical prefixencoding[J].Communications of the ACM.1964, 7(3):166-169[5]Chung K L and Wu J G. Level-compressed Huffman decoding[J].IEEE Trans. on Communications.1999, 47(10):1455-1457[6]Tanka H. Data structure of Huffman codes and itsapplication to efficient encoding and decoding[J].IEEETransactions on Information Theory.1987, 33(1):154-156[7]Ho S and Law P. Efficient hardware decoding method formodified huffman code[J].Electronics Letters.1991, 27(10):855-856[8]Nekritch Y. Decoding of canonical Huffman codes withlook-up tables. Proceedings of Data Compression Conference,Snowbird, UT, USA, 2000: 566-567.[9]Hashemian R. Condensed table of Huffman coding, a newapproach to efficient decoding[J].IEEE Trans. onCommunications.2004, 52(1):6-8[10]Lee J S, Jeong J H, and Chang T G. An efficient method ofHuffman decoding for MPEG-2 AAC and its performanceanalysis[J].IEEE Trans. on Speech and Audio Processing.2005,13(6):1206-1209[11]Hashemian R. Design and hardware implementation of amemory efficient Huffman decoding[J].IEEE Trans. onConsumer Electronics.1994, 40(3):345-352[12]Hashemian R. Memory efficient and high speed searchHuffman coding[J].IEEE Trans. on Communications.1995,43(10):2576-2581[13]Aggarwal M and Narayan A. Efficient Huffman decoding.International Conference on Image Processing, Vancouver,BC, 2000: 936-939.[14]International Standard ISO/IEC 14496-2 (MPEG-4).Information Technology-Coding of Audio-Visual Objects-Part 2: Visual. 2002.[15]ISO/IEC JTC1/SC29/WG11 N4668. Overview of MPEG-4Standard. 2002.[16]Texas Instrument. TMS320C6000 CPU and Instruction SetReference Guide. 1999.