An SGH-tree based memory efficient and constant decoding algorithm for Huffman codes
Resource
Intelligent Multimedia, Video and Speech Processing, 2004. Proceedings of 2004 International Symposium on
Journal
Intelligent Multimedia
Journal Volume
Video and Speech Processing
Pages
374-377
Date Issued
2004-10
Date
2004-10
Author(s)
Chuang, Yuh-Jue
DOI
N/A
Abstract
We proposed an SGH-based data structure to obtain a memory efficient and constant Huffman decoding algorithm. In cooperation with the Aggarwal and Narayan's algorithm, the proposed data structure spends a constant time on decoding each symbol and needs less memory size. In addition, we derive some properties to reduce the proposed codeword searching time. We believe that the proposed approach is useful for various multimedia coding applications, especially when the applications are conducted on memory constrained devices.
SDGs
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
01434078.pdf
Size
977.53 KB
Format
Adobe PDF
Checksum
(MD5):c99678937d5fa86f544cf9d08f9c13e3