Data Link Layer

Efficiency Error and Correction

Parity Checks – CRC, Checksum.
khushnood ahmed
0901au161031
EC - 7 sem
Madhav Institute of Technology and Science Gwalior 1
• Data Link Layer
• Efficiency Error
• Correction Parity Checks – CRC, Checksum.

2
Data Link Layer

3
Error Detection and Correction
• Because of attenuation, distortion, noise and interferences,
leading to corruption transmitted bits
• Data can be corrupted during transmission. For reliable
communication, error must be detected and corrected
• Error Detection and Correction are implemented either at

khushnood ahmed
the data link layer or the transport layer of the OSI model

4
• Single-Bit Error

• Burst Error

khushnood ahmed
5
Redundancy
• Error detection uses the concept of redundancy, which means
adding extra bits for detecting errors at the destination

khushnood ahmed
6
Detection methods

kushnood ahmed
7
 Parity Check
• A parity bit is added to every data unit so that the total number
of 1s(including the parity bit) becomes even for even-parity check
or odd for odd-parity check
• Simple parity check

khushnood ahmed
8
Performance
• Simple parity check can detect all single bit error
• It can also detect burst error. If the number of bits in error is
odd.
• This technique is not fool proof against burst errors that

khushnood ahmed
inverts more than one bit. If an even number of bit are
inverted due to error, the error is not detected

9
Two –Dimensional Parity
Check
• Performance can be improved by using two dimensional parity
check , which organizes the block of bits in the form of a table
• Parity check bits are calculated for each row which is
equivalent to a simple parity check bit
• Parity check bit are also calculated for all columns

khushnood ahmed
• Bothe are sent along the data
• At the receiving end these are compared with the parity bits
calculated on the received data

10
Two –Dimensional Parity
Check

khushnood ahmed
11
Performance
• Extra overhead is traded for better error detection capability
• Two-D parity check significantly improves error detection
capability compared to simple parity check
• It can detect many burst errors but not all.

khushnood ahmed
•

12
 Checksum

khushnood ahmed
13
Checksum
• To create the checksum the sender does the following:
• The unit is divided into K sections, each of n bits.
• Section 1 and 2 are added together using one’s complement.
• Section 3 is added to the result of the previous step.

khushnood ahmed
• Section 4 is added to the result of the previous step.
• The process repeats until section k is added to the result of the
previous step.
• The final result is complemented to make the checksum.

14
 khushnood ahmed
15
CRC(Cyclic Redundancy Check)
• CRC(Cyclic Redundancy Check) is based on binary division

khushnood ahmed
16
 CRC generator

• uses modular-2
division

khushnood ahmed
17
 CRC Checker

khushnood ahmed
18
Polynomials

• CRC generator(divisor) is most often represented not as a

string of 1s and 0s, but as an algebraic polynomial

khushnood ahmed
19
A polynomial representing a
divisor

khushnood ahmed
20
Standard polynomials

khushnood ahmed
21
Error Correction
• Backward error correction
• When an error detected in a frame, the sender is asked to
retransmit the data / frame.
• This approach is known as Automatic Repeat Request (ARQ)
technique.

khushnood ahmed
• Stop and Wait, Sliding Window
• Forward error correction:
• Use more redundancy in the transmitted data to not only detect
but correct error in the received data
• Hamming code

22