DocumentCode
2706969
Title
Fast decoding of prefix encoded texts
Author
Bergman, Eyal ; Klein, Shmuel T.
Author_Institution
Dept. of Comput. Sci., Bar Ilan Univ., Ramat Gan, Israel
fYear
2005
fDate
29-31 March 2005
Firstpage
143
Lastpage
152
Abstract
New variants of partial decoding tables are presented that can be used to accelerate the decoding of texts compressed by any prefix code, such as Huffman´s. They are motivated by a variety of tradeoffs between decompression speed and required auxiliary space, and apply to any shape of the tree, not only the canonical one. Performance is evaluated both analytically and by experiments, showing that the necessary tables can be reduced drastically, with hardly any loss in performance.
Keywords
Huffman codes; data compression; decoding; text analysis; tree codes; Huffman code; data compression; decompression speed; partial decoding tables; performance; prefix encoded texts; tree; Acceleration; Computer science; Data structures; Gallium nitride; Huffman coding; Iterative decoding; Performance analysis; Performance loss; Shape; Transform coding;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 2005. Proceedings. DCC 2005
ISSN
1068-0314
Print_ISBN
0-7695-2309-9
Type
conf
DOI
10.1109/DCC.2005.39
Filename
1402175
Link To Document