网站大量收购独家精品文档,联系QQ:2885784924

浅谈信息理论对数字通信系统发展的指导.ppt

浅谈信息理论对数字通信系统发展的指导.ppt

  1. 1、本文档共61页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
浅谈信息理论对数字通信系统发展的指导

浅谈信息理论对数字通信系统发展的指导 马 啸 中山大学信息科学与技术学院 Email:maxiao@ 主要内容 Shannon信息论 信源编码 信道编码 深空通信 Modem 无线移动通信 Shannon其人 /wiki/Claude_Shannon Claude Elwood Shannon (April 30, 1916 – February 24, 2001), an American electrical engineer and mathematician, the father of information theory. Shannon is famous for having founded information theory with one landmark paper published in 1948. But he is also credited with founding both digital computer and digital circuit design theory in 1937, when, as a 21-year-old masters student at MIT, he wrote a thesis demonstrating that electrical application of Boolean algebra could construct and resolve any logical, numerical relationship. It has been claimed that this was the most important masters thesis of all time. Mrs. Shannon with the statue. (photograph courtesy of J. OSullivan) 通信的数学理论 Claude E. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal, Vol. 27, pp. 379–423, 623–656, 1948. 数字通信系统模型 信息理论基本概念 两个离散随机变量 X和Y 熵的意义 随机变量的不确定性,含糊度,随机变量所含的信息量 条件熵 掷均匀硬币:1 bit 猜数字(Yes-No) 称球问题 信息量的无语义性 信息领域其他有趣的问题(不均匀硬币) 掷硬币 信源 信源是产生消息的源,形式多样 根据信息源输出信号的性质不同,可分为模拟信源和离散信源 模拟信源输出连续幅度的信号,如语音、图像、视频等 离散信源输出离散的符号序列或文字,如文本文字等 模拟信源可以通过抽样和量化变换为离散信源 离散信源又可以通过信源编码化为二进制 Every thing is binary! 信源编译码 把信源发出的信息转化为二进制序列 用最简洁的形式表达出来,消除冗余信息 极限是信源的熵(模糊度) 编码实例 例假设信源 Huffman编码实例 实质:是一个贪心算法;大概率符号用短码表示 Huffman编码的教学意义 In 1951, David A. Huffman and his MIT information theory classmates were given the choice of a term paper or a final exam. The professor, Robert M. Fano, assigned a term paper on the problem of finding the most efficient binary code. Huffman, unable to prove any codes were the most efficient, was about to give up and start studying for the final when he hit upon the idea of using a frequency-sorted binary tree and quickly proved this method the most efficient. In doing so, the student outdid his professor, who had worked with information theory inventor Claude Shannon to develop a similar code. Huffman avoided the major flaw of the s

文档评论(0)

zhuliyan1314 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档