哈夫曼算法编码原理与应用（The principle and application of Huffman encoding algorithm）.docVIP

下载本文档

6
0
约7.27千字
约 7页
2017-08-16 发布于河南
举报
版权申诉

哈夫曼算法编码原理与应用（The principle and application of Huffman encoding algorithm）.doc

1、本文档共7页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

哈夫曼算法编码原理与应用（The principle and application of Huffman encoding algorithm）

哈夫曼算法编码原理与应用（The principle and application of Huffman encoding algorithm） The principle and application of Huffman encoding algorithm 1 Overview The information age, people increasingly high on the use of the computer to obtain information, processing information and dependence. Computer systems are numeric, text, language, music, graphics, animation, multimedia, video image and static image etc.. The number of digital video and audio signals of the big is amazing, for the color image of the TV screen resolution of 640 x 480, 30 frames /s, a second volume of data: 640 x 480 x 24 x 30 = 221. 12M, so when playing, communication circuit 221Mbps. Storage, 1 CD 640M, only 2 89s data can be stored. 2 the Huffman algorithm encoding principle and Application The image information of a large amount of data for storage memory, communication trunk channel bandwidth and processing speed of the computer great pressure. Simply by increasing the memory capacity, it is unrealistic to solve the problem of increasing the channel bandwidth and processing speed of the computer and other methods, then we must consider the compression. The key lies in the compression encoding, if the encoding of data, for the common data, the encoder output shorter codewords; and for rare data with longer code words said, we can achieve compression. 2. 1 for example: there are 8 kinds of symbol S0, assume a file in SQ, S2, S3, S4, S5, S6, S7, then each encoding symbol should be, at least 3bit. Assuming that the encoding into 000001010011100101110111. Then the symbol sequence of S0S1S7S0S1S6S2S2S3S4S5S0S0S1 encoding into 000001111000001110010010011100101000000001, shared 42bit. We found that S0, S1, S2 of the 3 symbol frequency is relatively large, the other symbol frequency is relatively small, we use this encoding scheme: S0 to S7 code Liaoning 01 respectively, 111010000000100100011100, then the symbol sequence into 011110001110011101101000000010010010111, shared 39bit. Although some codes such as S3, S