Error Detection
and
Correction
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Note:
Data can be corrupted during
transmission. For reliable
communication, errors must be
detected and corrected.
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Types of Error
Single-Bit Error
Burst Error
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Note:
In a single-bit error, only one bit in the
data unit has changed.
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
10.1 Single-bit error
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Note:
A burst error means that 2 or more bits
in the data unit have changed.
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Burst error of length 5
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Detection
Parity Check
Cyclic Redundancy Check (CRC)
Checksum
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Note:
Error detection uses the concept of
redundancy, which means adding
extra bits for detecting errors at the
destination.
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Redundancy
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Detection methods
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Even-parity concept
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
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 ©The McGraw-Hill Companies, Inc., 2004
Example 1
Suppose the sender wants to send the word world. In
ASCII the five characters are coded as
1110111 1101111 1110010 1101100 1100100
The following shows the actual bits sent
11101110 11011110 11100100 11011000 11001001
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Example 2
Now suppose the word world in Example 1 is received by
the receiver without being corrupted in transmission.
11101110 11011110 11100100 11011000 11001001
The receiver counts the 1s in each character and comes up
with even numbers (6, 6, 4, 4, 4). The data are accepted.
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Example 3
Now suppose the word world in Example 1 is corrupted
during transmission.
11111110 11011110 11101100 11011000 11001001
The receiver counts the 1s in each character and comes up
with even and odd numbers (7, 6, 5, 4, 4). The receiver
knows that the data are corrupted, discards them, and asks
for retransmission.
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
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 ©The McGraw-Hill Companies, Inc., 2004
Two-dimensional parity
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
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 ©The McGraw-Hill Companies, Inc., 2004
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
CRC generator and checker
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Binary division in a CRC generator
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Binary division in CRC checker
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
A polynomial
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
A polynomial representing a divisor
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Checksum
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Note:
The sender follows these steps:
•The unit is divided into k sections, each of n bits.
•All sections are added using one’s complement to get the sum.
•The sum is complemented and becomes the checksum.
•The checksum is sent with the data.
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Note:
The receiver follows these steps:
•The unit is divided into k sections, each of n bits.
•All sections are added using one’s complement to get the sum.
•The sum is complemented.
•If the result is zero, the data are accepted: otherwise, rejected.
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Example 7
Suppose the following block of 16 bits is to be sent using a
checksum of 8 bits.
10101001 00111001
The numbers are added using one’s complement
10101001
00111001
------------
Sum 11100010
Checksum 00011101
The pattern sent is 10101001 00111001 00011101
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Example 8
Now suppose the receiver receives the pattern sent in Example 7
and there is no error.
10101001 00111001 00011101
When the receiver adds the three sections, it will get all 1s, which,
after complementing, is all 0s and shows that there is no error.
10101001
00111001
00011101
Sum 11111111
Complement 00000000 means that the pattern is OK.
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Example 9
Now suppose there is a burst error of length 5 that affects 4 bits.
10101111 11111001 00011101
When the receiver adds the three sections, it gets
10101111
11111001
00011101
Partial Sum 1 10110101
Carry 1
Sum 10110110
Complement 01001001 the pattern is corrupted.
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Correction
Retransmission
Forward Error Correction
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Data and redundancy bits
Number of Number of Total
data bits redundancy bits bits
m r m+r
1 2 3
2 3 5
3 3 6
4 3 7
5 4 9
6 4 10
7 4 11
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Positions of redundancy bits in Hamming code
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Redundancy bits calculation
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Example of redundancy bit calculation
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Error detection using Hamming code
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
