Parallel Huffman Decoding

Authors:
Shmuel T. Klein;Yair Wiseman
Affiliations:
-;-
Venue:
DCC '00 Proceedings of the Conference on Data Compression
Year:
2000

Citing 10
Cited 3

Parallel algorithms for data compression

Journal of the ACM (JACM)
Bidirectional Huffman coding

The Computer Journal
The JPEG still picture compression standard

Communications of the ACM - Special issue on digital multimedia systems
A systematic approach to compressing a full-text retrieval system

Information Processing and Management: an International Journal - Special issue on data compression for images and texts
Constructing Huffman Trees in Parallel

SIAM Journal on Computing
Managing Gigabytes: Compressing and Indexing Documents and Images

Managing Gigabytes: Compressing and Indexing Documents and Images
Space- and Time-Efficient Decoding with Canonical Huffman Trees

CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text

CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Near optimal compression with respect to a static dictionary on a practical massively parallel architecture

DCC '95 Proceedings of the Conference on Data Compression
Extended synchronizing codewords for binary prefix codes

IEEE Transactions on Information Theory

Parallel Lempel Ziv Coding

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Pattern Matching in Huffman Encoded Texts

DCC '01 Proceedings of the Data Compression Conference
Pattern matching in Huffman encoded texts

Information Processing and Management: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple parallel algorithm for decoding a Huffman encoded file is presented, exploiting the tendency of Huffman codes to resynchronize quickly in most cases. An extension to JPEG decoding is mentioned.