Parallel Huffman decoding
- 7 November 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
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.Keywords
This publication has 17 references indexed in Scilit:
- Parallel algorithms for optimal compression using dictionaries with the prefix propertyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Parallel lossless image compression using Huffman and arithmetic codingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Parsing algorithms for dictionary compression on the PRAMPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed TextLecture Notes in Computer Science, 1999
- Space- and time-efficient decoding with canonical huffman treesLecture Notes in Computer Science, 1997
- Constructing Huffman Trees in ParallelSIAM Journal on Computing, 1995
- The JPEG still picture compression standardCommunications of the ACM, 1991
- Self-synchronizing Huffman codes (Corresp.)IEEE Transactions on Information Theory, 1984
- Is text compression by prefixes and suffixes practical?Acta Informatica, 1983
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952