By Topic

Algorithm for Construction of Variable Length Code with Limited Maximum Word Length

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)
Murakami, H. ; KDD Res. and Dev. Labs., Tokyo, Japan ; Matsumoto, S. ; Yamamoto, H.

As a high efficiency coding method for TV signals, variable length coding, such as Huffman coding, is extremely effective. However, when this variable length coding is applied to an actual TV codec which requires high-speed real-time processing, maximum word length will be limited for the hardware configuration. This correspondence describes an algorithm for the construction of a modified Huffman code with limited maximum word length by means of a "top-down" procedure meeting this requirement instead of the conventional "bottom-up" algorithm.

Published in:

Communications, IEEE Transactions on  (Volume:32 ,  Issue: 10 )