Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-Reports 1999 Copyright 1999 Universität Bonn, Institut für Informatik, Abt. V
85208

Byte-oriented Decoding of Canonical Huffman Codes
Yakov Nekritch
[Download PostScript] [Download PDF]

We design an efficient algorithm for decoding canonical Huffman codes. The decoding is based on consequential look-up tables. We also present a data structure for reading bit sequences without using bit operations. Our algorithm, combined with this data structure allows fast byte-oriented decoding without causing high memory requirements.

Last Change: 07/05/01 at 14:04:20
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope