Browse > Article
http://dx.doi.org/10.7471/ikeee.2018.22.3.850

A Study on Efficient Decoding of Huffman Codes  

Park, Sangho (Dept. of Information and Communication Engineering, Andong National University)
Publication Information
Journal of IKEEE / v.22, no.3, 2018 , pp. 850-853 More about this Journal
Abstract
In this paper, we propose a decoding method using a balanced binary tree and a canonical Huffman tree for efficient decoding of Huffman codes. The balanced binary tree scheme reduces the number of searches by lowering the height of the tree and binary search. However, constructing a tree based on the value of the code instead of frequency of symbol is a drawback of the balanced binary tree. In order to overcome these drawbacks, a balanced binary tree is reconstructed according to the occurrence probability of symbols at each level of the tree and binary search is performed for each level. We minimize the number of searches using a canonical Huffman tree to find level of code to avoid searching sequentially from the top level to bottom level.
Keywords
Entropy coding; Huffman decoding; Canonical tree; Balanced binary tree; Balanced binary trie;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Huffman, "A method for the construction of minimum redundancy codes," Proc. of the IRE, vol. 40, no. 90, pp. 1098-1101, 1952. DOI:110.1007/BF02839372   DOI
2 L. Larmore and D. Hirschberg, "Efficient decoding of prefix codes," Comm. of the ACM, vol. 33, pp. 449-459, 1990. DOI:10.1145/77556.77566   DOI
3 S. Park, "Efficient Huffman decoding using canonical Huffman tree," J. of KSCI, vol.12, no.4, pp. 111-117, 2007. (DOI없음)
4 H. Kim, Y. Jung, C. Yim, and H. Lim, "A balanced binary, search tree for Huffman decoding," J. of KICS, vol. 30, no. 5C, pp. 382-390, 2005. (DOI없음)
5 I. Park, H. Lee, and J. Yi, "Optimizing the Huffman Decoding for Embedded System," J. of KIISE: Computing Practices and Letters, vol. 18, no 12, pp. 881-885, 2012. (논문 검색이 안됨)
6 Y. Takishima, M. Wada, and H. Murakami, "Reversible variable length codes," IEEE Trans. Comm, vol. 43, pp. 158-162, 1995. DOI:10.1109/26.380026   DOI