2.6.3 error control.ppt

  1. 1、本文档共32页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Page * * 2.6 Basic Network Mechanisms Chapter 2 Network services and Layered Architectures Multiplexing Switching Error control Flow control Congestion control Resource allocation 2.6 Basic Network Mechanism 2.6.3 Error Control To control errors, a transmission link can use two methods: Error detection. 检错 and Error correction. 纠错 Parity bit Cyclic Redundancy Check (CRC) Error Correction With Replication Method Alternating Bit Protocol (ABP) Go Back N Selective Repeat Protocol (SRP) 2.6 Basic Network Mechanisms Parity bit 奇偶校验位: A simple error-detection method The transmitter appends a 1 or 0 to the packet it transmits so that the resulting string (packet + parity bit) contains a number of 1s that has an agreed parity, say odd. For instance. If the original packet is 0100100, then the transmitter appends a 1 and transmits the resulting string If the receiver gets the string then it knows that the transmission modified at least one bit. The method is not very reliable for long packets: it is not unlikely that transmission errors modify 2 or 4 bits in long packets. 2.6.3 Error Control 2.6.3 Error Control Cyclic Redundancy Check (CRC) 循环冗余校验 A binary word G 二进制字 forms the basis of the CRC calculation. Denote by r+1 the number of bits of G. By performing a long division 长除法, an electronic circuit in the transmitter calculates the remainder 余数 R of the division of by G. Assume that we want to transmit a packet that consists of the finite string of bits P. We denote by the binary word obtained by appending r 0s to the right of the packet P. This long division is calculated by performing the additions of the binary words bit by bit modulo 2 and without carry. Additions of the binary words bit by bit modulo 2 and without carry 二进制模2加法不进位. 2.6.3 Error Control 10011 + 01011 = 11000. 2.6.3 Error Control The binary word R is the CRC code that the transm

文档评论(0)

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

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

1亿VIP精品文档

相关文档