A Space-Efficient Huffman Decoding Algorithm and its Parallelism
碩士 === 國立台灣工業技術學院 === 管理技術研究所 === 85 === This paper first transforms the Huffman treeinto a single--side growing Huffman tree, then presents a memory--efficientdata structure to represent the single--side growing Huffman tree, whichrequires...
Main Authors: | Lin, Yih-Kai, 林義凱 |
---|---|
Other Authors: | Kuo-Liang Chung |
Format: | Others |
Language: | zh-TW |
Published: |
1997
|
Online Access: | http://ndltd.ncl.edu.tw/handle/72819908164921559975 |
Similar Items
-
A Space-Efficient Huffman Decoding Algorithm and its Parallelism
by: Lin, Yi-Kai, et al.
Published: (1997) -
A Memory-Efficient and Fast Huffman Decoding Algorithm
by: 陳宏綜
Published: (1999) -
Multi-bit Huffman Decoder
by: Ya-Nan Wen, et al.
Published: (2011) -
Parallel Huffman decoder with an optimized look up table option on FPGA
by: Aspar, Zulfakar, et al.
Published: (2000) -
Implementation of a Numerical Huffman Decoder
by: Hao-Ming Hsu, et al.
Published: (2002)