A Balanced Binary Search Tree for Huffman Decoding 


Vol. 30,  No. 5, pp. 382-390, May  2005


PDF
  Abstract

Huffman codes are widely used for image and video data transmission. As the increase of real-time data, a lot of studies on effective decoding algorithms and architectures have been done. In this paper, we proposed a balanced binary search tree for Huffman decoding and compared the performance of the proposed architecture with that of previous works. Based on definitions of the comparison of codewords with different lengths, the proposed architecture constructs a balanced binary tree which does not include empty internal nodes, and hence it is very efficient in the memory requirement. Performance evaluation results using actual image data show that the proposed architecture requires small number of table entries, and the decoding time is 1, 5, and 2.41 memory accesses in minimum, maximum, and average, respectively.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Kim, Y. Jung, C. Yim, H. Lim, "A Balanced Binary Search Tree for Huffman Decoding," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 5, pp. 382-390, 2005. DOI: .

[ACM Style]

Hyeran Kim, Yeojin Jung, Changhun Yim, and Hyesook Lim. 2005. A Balanced Binary Search Tree for Huffman Decoding. The Journal of Korean Institute of Communications and Information Sciences, 30, 5, (2005), 382-390. DOI: .

[KICS Style]

Hyeran Kim, Yeojin Jung, Changhun Yim, Hyesook Lim, "A Balanced Binary Search Tree for Huffman Decoding," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 5, pp. 382-390, 5. 2005.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880