By Topic

High speed pattern matching for a fast Huffman decoder

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Seung Bae Choi ; Dept. of Inf. & Commun. Eng., Chonbuk Nat. Univ., Chonju, South Korea ; Moon Ho Lee

The fast Huffman decoding algorithm has been used in JPEG, MPEG and image data compression standards, etc. And code compression is a key element in high speed digital data transport. A major compression is performed by converting the fixed-length codes to variable-length codes through an entropy coding scheme. Huffman coding combined with run-length coding is shown to be a very efficient coding scheme. To speed up the process of search for a symbol in a Huffman tree and to reduce the memory size we have proposed a tree clustering and a pattern matching algorithm to avoid high sparsity of the tree. The method is shown to be very efficient in memory size and fast searching for the symbol. For an experimental video data with Huffman codes extended up to 16 bits in length, i.e. it is used for the standard JPEG, the result of experiments show that the proposed algorithm has a very high speed and performance. The design of the decoder is carried out using silicon-gate CMOS process

Published in:

Consumer Electronics, IEEE Transactions on  (Volume:41 ,  Issue: 1 )