A novel memory-efficient Huffman decoding algorithm and its implementation

Signal Processing

Volumn 62, Issue 2, 1997, Pages 207-213

  Chung, Kuo Liang ^a   Lin, Yih Kai ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Data structure; Decoding algorithm; Huffman code; Image compression

Indexed keywords

ALGORITHMS; ARRAYS; CODES (SYMBOLS); DATA STORAGE EQUIPMENT; DECODING; IMAGE PROCESSING;

HUFFMAN DECODING ALGORITHM; HUFFMAN TREE;

DATA STRUCTURES;

EID: 0031247191     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0165-1684(97)00125-4     Document Type: Article

References (6)

1. T.C. Bell, Text Compression, Prentice-Hall, Englewood Cliffs, NJ, 1990.
2. R. Hashemian, Memory efficient and high-speed search Huffman coding, IEEE Trans. Commun. 43 (1995) 2576-2581.
3. E. Horowitz, S. Sahni, S. Andersonfreed, Fundamentals of Data Structures in C, Computer Science Press, New York, 1993, p. 201.
4. A. Huffman, A method for the construction of minimum redundancy codes, Proc. IRE 40 (1952) 1098-1101.
5. W.B. Pennebaker, J.L. Mitchell, JPEG: Still Image Data Compression Standard, Van Nostrand Reinhold, New York, 1993.
6. S. Roman, Coding and Information Theory, Springer, New York, 1992.