Beruflich Dokumente
Kultur Dokumente
McGraw-Hill
McGraw-Hill
McGraw-Hill
McGraw-Hill
McGraw-Hill
Chapters
Chapter 10 Error Detection and Correction
Chapter 11 Data Link Control and Protocols
Chapter 12 Point-To-Point Access
Chapter 13 Multiple Access
Chapter 14 Local Area Networks
Chapter 15 Wireless LANs
Chapter 16 Connecting LANs
Chapter 17 Cellular Telephone and Satellite Networks
Chapter 18 Virtual Circuit Switching
McGraw-Hill
Chapter 10
Error Detection
and
Correction
McGraw-Hill
Note:
Data can be corrupted during
transmission. For reliable
communication, errors must be
detected and corrected.
McGraw-Hill
Single-Bit Error
Burst Error
McGraw-Hill
Note:
In a single-bit error, only one bit in the
data unit has changed.
McGraw-Hill
10.1
McGraw-Hill
Single-bit error
Note:
A burst error means that 2 or more bits
in the data unit have changed.
McGraw-Hill
10.2
McGraw-Hill
10.2 Detection
Redundancy
Parity Check
Cyclic Redundancy Check (CRC)
Checksum
McGraw-Hill
Note:
Error detection uses the concept of
redundancy, which means adding
extra bits for detecting errors at the
destination.
McGraw-Hill
10.3
McGraw-Hill
Redundancy
10.4
McGraw-Hill
Detection methods
10.5
McGraw-Hill
Even-parity concept
Note:
In parity check, a parity bit is added to
every data unit so that the total
number of 1s is even
(or odd for odd-parity).
McGraw-Hill
Example 1
Supposethesenderwantstosendthewordworld.In
ASCIIthefivecharactersarecodedas
1110111 1101111 1110010 1101100 1100100
Thefollowingshowstheactualbitssent
1110111011011110111001001101100011001001
McGraw-Hill
Example 2
NowsupposethewordworldinExample1isreceivedby
thereceiverwithoutbeingcorruptedintransmission.
11101110110111101110010011011000
11001001
Thereceivercountsthe1sineachcharacterandcomesup
withevennumbers(6,6,4,4,4).Thedataareaccepted.
McGraw-Hill
Example 3
NowsupposethewordworldinExample1iscorrupted
duringtransmission.
11111110110111101110110011011000
11001001
Thereceivercountsthe1sineachcharacterandcomesup
withevenandoddnumbers(7,6,5,4,4).Thereceiver
knowsthatthedataarecorrupted,discardsthem,andasks
forretransmission.
McGraw-Hill
Note:
Simple parity check can detect all
single-bit errors. It can detect burst
errors only if the total number of
errors in each data unit is odd.
McGraw-Hill
10.6
McGraw-Hill
Two-dimensional parity
Example 4
Supposethefollowingblockissent:
10101001001110011101110111100111
10101010
However,itishitbyaburstnoiseoflength8,andsome
bitsarecorrupted.
10100011100010011101110111100111
10101010
Whenthereceivercheckstheparitybits,someofthebits
donotfollowtheevenparityruleandthewholeblockis
The McGraw-Hill Companies, Inc., 2004
McGraw-Hill
Note:
In two-dimensional parity check, a
block of bits is divided into rows and a
redundant row of bits is added to the
whole block.
McGraw-Hill
10.7
McGraw-Hill
10.8
McGraw-Hill
10.9
McGraw-Hill
10.10
McGraw-Hill
A polynomial
McGraw-Hill
McGraw-Hill
Name
Polynomial
Application
CRC-8
x8 + x2 + x + 1
ATM header
CRC-10
x10 + x9 + x5 + x4 + x 2 + 1
ATM AAL
ITU-16
x16 + x12 + x5 + 1
HDLC
ITU-32
LANs
Example 5
Itisobviousthatwecannotchoosex(binary10)orx2+x
(binary110)asthepolynomialbecausebotharedivisible
byx.However,wecanchoosex+1(binary11)because
itisnotdivisiblebyx,butisdivisiblebyx+1.Wecan
alsochoosex2+1(binary101)becauseitisdivisibleby
x+1(binarydivision).
McGraw-Hill
Example 6
TheCRC12
x12+x11+x3+x+1
whichhasadegreeof12,willdetectallbursterrors
affectinganoddnumberofbits,willdetectallburst
errorswithalengthlessthanorequalto12,andwill
detect,99.97percentofthetime,bursterrorswitha
lengthof12ormore.
McGraw-Hill
10.12
McGraw-Hill
Checksum
10.13
McGraw-Hill
Note:
The sender follows these steps:
The unit is divided into k sections, each of n bits.
All sections are added using ones complement to get
the sum.
The sum is complemented and becomes the checksum.
The checksum is sent with the data.
McGraw-Hill
Note:
The receiver follows these steps:
The unit is divided into k sections, each of n bits.
All sections are added using ones complement to get
the sum.
The sum is complemented.
If the result is zero, the data are accepted: otherwise,
rejected.
McGraw-Hill
Example 7
Supposethefollowingblockof16bitsistobesentusinga
checksumof8bits.
1010100100111001
Thenumbersareaddedusingonescomplement
10101001
00111001
Sum 11100010
Checksum00011101
Thepatternsentis101010010011100100011101
McGraw-Hill
Example 8
NowsupposethereceiverreceivesthepatternsentinExample7
andthereisnoerror.
101010010011100100011101
Whenthereceiveraddsthethreesections,itwillgetall1s,which,
aftercomplementing,isall0sandshowsthatthereisnoerror.
10101001
00111001
00011101
Sum
11111111
Complement
00000000meansthatthepatternisOK.
McGraw-Hill
Example 9
Nowsupposethereisabursterroroflength5thataffects4bits.
101011111111100100011101
Whenthereceiveraddsthethreesections,itgets
10101111
11111001
00011101
PartialSum111000101
Carry
Sum
1
11000110
Complement00111001thepatterniscorrupted.
McGraw-Hill
10.3 Correction
Retransmission
Forward Error Correction
Burst Error Correction
McGraw-Hill
McGraw-Hill
Number of
data bits
m
Number of
redundancy bits
r
Total
bits
m+r
10
11
10.14
McGraw-Hill
10.15
McGraw-Hill
10.16
McGraw-Hill
10.17
McGraw-Hill
10.18
McGraw-Hill