Design of the Efficient Encoder for the Canonical Huffman Code


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 2, pp. 572-581, Feb. 1998
10.3745/KIPSTE.1998.5.2.572,   PDF Download:

Abstract

In this paper, a new Huffman encoding algorithm with memory based Huffman table is proposed. The memory based table on the Huffman code of the canonical tree form consists of the Run-length code of the consecutive '1's and the rest of the code bit stream. The proposed algorithm is suitable for the hardware implementation since the construction of the table is simple and the encoding process is operated by only performing Run-length decoding and shift operation. The proposed encoder is implemented by using VHDL. simulated and verified the operation on the COMPASS. The designed chip occupies about 5,000 gates using 0.8 micron process. It is normally simulated at the 25 MHz clock. The proposed Huffman encoder is expected that it will be widely applied to the real-time processing such as the field of multimedia, digital data communications, since it is suitable for the hardware implemention.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
P. H. Sik and C. G. Yun, "Design of the Efficient Encoder for the Canonical Huffman Code," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 2, pp. 572-581, 1998. DOI: 10.3745/KIPSTE.1998.5.2.572.

[ACM Style]
Park Hwa Sik and Cho Gyung Yun. 1998. Design of the Efficient Encoder for the Canonical Huffman Code. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 2, (1998), 572-581. DOI: 10.3745/KIPSTE.1998.5.2.572.