@inproceedings{b807ffb8e93a45b1b27fa642cd14b2d9,
title = "An efficient algorithm of huffman decoder with nearly constant decoding time",
abstract = "This paper introduces a Huffman decoding algorithm based on the single-side growing Huffman tree. The proposed scheme exploits an intrinsic property of the single-side growing Huffman tree to utilize the instructions of the modern processor. The data structure is proved to have linear space complexity O(d + 2n), where d is the maximal length of the Huffman codes and n is the number of symbols. More importantly, each Huffman decoding could be carried out by a constant number of instructions and two memory accesses, regardless the length of Huffman codes. As demonstrated in the experimental results, the proposed scheme yields a nearly constant decoding time and outperform the existing schemes. Our source code is publicly available.",
keywords = "Data compression, Decoding, Huffman codes",
author = "Wang, \{Pi Chung\} and Lee, \{Chun Liang\} and Chang, \{Hung Yi\}",
year = "2007",
language = "英语",
isbn = "9780889866706",
series = "Proceedings of the Fifth IASTED International Conference on Circuits, Signals, and Systems, CSS 2007",
pages = "131--135",
booktitle = "Proceedings of the Fifth IASTED International Conference on Circuits, Signals, and Systems, CSS 2007",
note = "5th IASTED International Conference on Circuits, Signals, and Systems, CSS 2007 ; Conference date: 02-07-2007 Through 04-07-2007",
}