Framing + Error detection+correction
Framing + Error detection+correction
Framing
1
19-03-2025
Vijay S. Katta 3
2
19-03-2025
1. Establishing and Terminating Links: Manages the establishment and termination of communication links.
2. Error Control: Ensures error-free transmission using techniques like Automatic Repeat request (ARQ).
3. Flow Control: Prevents overwhelming the receiver by regulating the data flow.
4. Data Sequencing: Ensures frames are delivered in the correct order.
5. Acknowledgment Mechanism: Confirms the receipt of frames.
6. Logical Link Control (LLC): Provides multiplexing of network protocols on the same network interface.
Summary:
• MAC sublayer: Focuses on physical addressing and medium access control.
• DLC sublayer: Ensures reliable, error-free communication between devices.
3
19-03-2025
4
19-03-2025
Framing
Framing
Framing
1. A character Count.
5
19-03-2025
Bit stuffing
(a) The original data.
(b) The data as they appear on the line.
(c) The data as they are stored in receiver’s memory
after destuffing.
6
19-03-2025
7
19-03-2025
ENQ/ACK
8
19-03-2025
ENQ/ACK
Multipoint Discipline
9
19-03-2025
Select
Poll
10
19-03-2025
Error Detection
and Correction
Types of Errors
Detection
Correction
Note:
11
19-03-2025
Types of Errors
Single-bit error
12
19-03-2025
Multiple-bit error
Burst error
13
19-03-2025
Error Detection
Note:
14
19-03-2025
VRC
15
19-03-2025
LRC
16
19-03-2025
Polynomial
17
19-03-2025
Figure 9-14
Standard Polynomials
18
19-03-2025
Example:1
Data :- 100100
Divisor :- x3 + x2 +1
Solution:-
Divisor :- 1101
Use modulo 2 Division
(X-OR Operation)
19
19-03-2025
20
19-03-2025
Example
It is obvious that we cannot choose x (binary 10) or x2 + x
(binary 110) as the polynomial because both are divisible
by x.
21
19-03-2025
Example
The CRC-12
x12 + x11 + x3 + x + 1
which has a degree of 12, will detect all burst errors
affecting an odd number of bits, will detect all burst
errors with a length less than or equal to 12.
22
19-03-2025
Note:
•All sections are added using one’s complement to get the sum.
Note:
•All sections are added using one’s complement to get the sum.
•If the result is zero, the data are accepted: otherwise, rejected.
23
19-03-2025
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
1 0 1 0 1 0 0 1
0 0 1 1 1 0 0 1
--------------------------------------------------
Sum 1 1 1 0 0 0 1 0
Checksum 00011101
The pattern sent is 10101001 00111001 00011101
Example
Now suppose the receiver receives the pattern sent in Example 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 111 11111
Complement 0 0 0 0 0 0 0 0 means that the pattern is OK.
24
19-03-2025
Figure 9-17
Error Correction
Figure 9-18
Hamming Code
25
19-03-2025
Figure 9-19
Hamming Code
Figure 9-19-continued
Hamming Code
26
19-03-2025
Figure 9-20
Example of Hamming Code
Figure 9-21
Single-bit error
27
19-03-2025
Figure 9-22
Error
Detection
Error-Correcting Codes
Use of a Hamming code to correct burst errors.
28