A novel memory-efficient Huffman decoding algorithm and its implementation

Kuo‐Liang Chung

doi:10.1016/S0165-1684(97)00125-4

A novel memory-efficient Huffman decoding algorithm and its implementation

1997-10-01

18

PRE

AI

DOI：10.1016/S0165-1684(97)00125-4

原文链接

原文求助

摘要

En 中文

This paper first presents a new array data structure to represent the Huffman tree. The memory required in the proposed data structure is less than the previous methods (Huffman, 1952; Roman, 1992), which also use array data structure to store the corresponding Huffman tree, and is the lower bound of the one in (Hashemian, 1995). We then present an efficient Huffman decoding algorithm based on the proposed data structure; given a Huffman code, the search time for finding the source symbol is O(d), where d denotes the depth of the Huffman tree. This time bound is equal to the ones in (Hashemian, 1995; Huffman, 1952; Roman, 1992). Some experimentations on real images are carried out to demonstrate the performance of space and search time among our method and the previous ones. (C) 1997 Elsevier Science B.V.

Keyword:

data structure

decoding algorithm

Huffman code

image compression

A novel memory-efficient Huffman decoding algorithm and its implementation

摘要

AI总结

期刊

机构

引用论文