rar

Huffman coding compression algorithm

  • 2014-03-05
  • 2.62KB
  • Points it Requires : 2

Huffman coding compression algorithm, in Huffman coding, each data is regarded as a leaf with weight, and the less frequent ones are sorted together to construct a tree-structured data called \"Huffman tree\", and then the Huffman tree is used to determine the bit sequence to be allocated to each data. Huffman tree is also used when decoding. We must read the Huffman coded data bit by bit, and then determine which branch to go according to this value. Then, after reaching the leaf, the value of this leaf is output. Then go back to the root again and repeat the same process until there is no more data.

unfold

You Might Like

Uploader
rubyonrails
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×