Article thumbnail
Location of Repository

Level-compressed Huffman decoding

By 鍾國亮, 吳榮根, Kuo-Liang Chung and Jung-Gen Wu

Abstract

[[abstract]]Based on the breadth-first search manner and the level-compression technique, this article first presents a new array data structure to represent the classical Huffman (1952) tree. Then, the decoding algorithm is given. Both the memory and the decoding time required in the proposed method are less than those of previous methods. Some experimentations are carried out to demonstrate the advantages of the proposed method. In fact, the proposed algorithm can be applied to the canonical Huffman tree.

Topics: Data compression;decoding algorithm;Huffman tree, [[classification]]42
Publisher: IEEE (Institute of Electrical and Electronics Engineers)
Year: 2011
OAI identifier: oai:ir.lib.ntnu.edu.tw:309250000Q/22170
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://ir.lib.ntnu.edu.tw/ir/h... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.