By Topic

An efficient Huffman decoding method based on pattern partition and look-up table

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

3 Author(s)

An efficient Huffman decoding method is presented in this paper. This new method first partitions a Huffman tree into subtrees by a set of regular bit-patterns. Then, some look-up tables are used to represent these subtrees. Using this method, a Huffman tree can be represented compactly and the decoding of codewords can be performed quickly by the matching of regular bit-patterns.

Published in:

Communications, 1999. APCC/OECC '99. Fifth Asia-Pacific Conference on ... and Fourth Optoelectronics and Communications Conference  (Volume:2 )

Date of Conference:

18-22 Oct. 1999