Novel binary tree Huffman decoding algorithm and field programmable gate array implementation for terrestrial-digital multimedia broadcasting mobile handheld

Novel binary tree Huffman decoding algorithm and field programmable gate array implementation for terrestrial-digital multimedia broadcasting mobile handheld

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Science, Measurement & Technology — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Recent mobile devices, which adopted Eureka-147, terrestrial-digital multimedia broadcasting (T-DMB) systems, are developed as integrated circuit. As a result, the space of memory expands hardly on mobile handheld. Therefore most mobile handheld must operate a lot of application on limited memory. To solve the problem, most of the mobile devices use some kind of compression algorithms to overcome the memory shortage. Among such algorithms, Huffman algorithm is most widely used. In this study, the authors present a novel binary tree expression of the Huffman decoding algorithm which reduces the memory use approximately by 50% and increases the decoding speed up to 30%. The authors experiment the decoding speed on an evaluation kit (SMDK 6400), which is a T-DMB mobile handheld with an advanced risk machine processor. Later to enhance the decoding speed, the authors present an optimum Huffman decoder based on hardware implementation.


    1. 1)
    2. 2)
      • Wang, P.-C., Yang, Y.-R., Lee, C.-L., Change, H.-Y.: `A memory-efficient Huffman decoding algorithm', 19thInt Conf on, Advanced Information Networking and Applications, AINA 2005, March 2005, 2, p. 475–479.
    3. 3)
      • Aspar, Z., Mohd Yusof, Z., Suleiman, I.: `Parallel Huffman decoder with an optimize look up table option on FPGA', TENCON 2000. Proc. of TESCON, September 2000, 1, p. 73–76.
    4. 4)
      • Rigler, S., Bishop, W., Kennings, A.: `FPGA-based lossless data compression using Huffman and LZ77 algorithms', Electrical and Computer Engineering, CCECE 2007. Canadian Conf., April 2007, p. 1235–1238.
    5. 5)
      • Ezhilarasan, M., Thambidurai, P., Praveena, K., Srinivasan, S., Sumathi, N.: `A new entropy encoding technique for multimedia data compression', Int. Conf. on Computational Intelligence and Multimedia Applications, December 2007, 4, p. 157–161.
    6. 6)
      • Huffman, D.A.: `A method for the construction of minimum redundancy codes', Proc. IRE40, 1952, p. 1098–1101.
    7. 7)
      • R.W. Hamming . (1986) Coding and information theory.
    8. 8)
      • K.L. Chung , J.G. Wu . Level-compressed Huffman decoding. IEEE Trans. Commun. , 10 , 1445 - 1447
    9. 9)
      • Parhi, K.K.: `High-speed Huffman decoder architectures', Signals, Systems and Computer, 1991. Conf. Record of the 25th Asilomar Conf., November 1991, 1, p. 64–68.
    10. 10)
    11. 11)
      • T. Jeong , B. Hieu , S. Beak . Memory efficient multimedia Huffman decoding method and apparatus for adapting Huffman table based on symbol from probability table. South Korea Patent File No.10-1030726
    12. 12)
      • Chang, S.-F., Messerschmitt, D.G.: `VLSI designs for high-speed Huffman decoder', Proc. IEEE Int. Conf. on Computer Design: VLSI in computers and Processors, ICCD’91, October 1991, p. 500–503.
    13. 13)

Related content

This is a required field
Please enter a valid email address