第04章输入输出系统2 eng.pptVIP

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Error Detection and Correction Bit Error Rate, BER, is the probability that, when read, a given bit will be in error. BER is a statistical property Especially important in I/O, where noise and signal integrity cannot be so easily controlled 10-18 inside processor 10-8 - 10-12 or worse in outside world Many techniques Parity check SECDED Encoding CRC Parity Checking Add a Parity Bit to the word Even Parity: Add a bit if needed to make number of bits even Odd Parity: Add a bit if needed to make number of bits odd Example: for word to add odd parity bit: 100110101 Hamming Codes Hamming codes are a class of codes that use combinations of parity checks to both detect and correct errors. They add a group of parity check bits to the data bits. For ease of visualization, intersperse the parity bits within the data bits; reserve bit locations whose bit numbers are powers of 2 for the parity bits. Number the bits from l to r, starting at 1 A given parity bit is computed from data bits whose bit numbers contain a 1 at the parity bit number. Fig 4.20: Multiple Parity Checks Making up a Hamming Code Add parity bits, Pi, to data bits, Di Reserve bit numbers that are a power of 2 for Parity Bits Example: P1=001, P2 = 010, P4=100, etc. Each parity bit, Pi, is computed over those data bits that have a 1 at the bit number of the parity bit. Example: P2(010) is computed from D3 (011), D6 (110), D7(111), ... Thus each bit takes part in a different combination of parity checks. When the word is checked, if only one bit is in error, all the parity bits that use it in their computation will be incorrect. 海明校验码(校验位数) 海明码需要几位校验码? k—数据位的位数 r—校验位的位数 数据位k与校验位r的关系:2r ≥ k+r+1 数据位k 校验位r 总位数n 1 2 3 2~4 3 5~7 5~11 4 9~15 12~26 5 17~31 27~57 6 33~63 58~120 7

文档评论(0)

精品文库 + 关注
实名认证
文档贡献者

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

1亿VIP精品文档

相关文档