Previous [Previous] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10]

Journal of Inforamtion Science and Engineering, Vol.17 No.2, pp.325-339 (March 2001)

Faster Implementation of Canonical Minimum
Redundancy Prefix Codes*

Kuo-Liang Chung and Jung-Gen Wu+

Department of Information Management
and Institute of Information Engineering
National Taiwan University of Science and Technology
Taipei, Taiwan 106, R.O.C.
E-mail: klchung@cs.ntust.edu.tw
+Department of Information and Computer Education
National Taiwan Normal University
Taipei, Taiwan 106, R.O.C.

This note modifies the data structure developed by Moffat and Turpin [3]. Besides reducing the memory requirement, the decoding algorithm is further improved. Experimental results demonstrate both the memory and decoding-time advantages of the modified method.

Keywords: Huffman decoding, compression, algorithm, data structure, canonical Huffman tree

Full Text () Retrieve PDF document (200103_10.pdf)

Received August 29, 1998; revised September 30 & December 2, 1999; accepted January 18, 2000.
Communicated by Yung-Nien Sun.
This research was supported by NSC88-2213-E011-006.