Professional Documents
Culture Documents
Module 2 - Iat1
Module 2 - Iat1
10.1
Note
10.2
10-1 INTRODUCTION
10.3
Note
10.4
Figure 10.1 Single-bit error
10.5
Note
10.6
Figure 10.2 Burst error of length
8
10.7
Note
10.8
Figure 10.3 The structure of encoder and
decoder
10.9
10-2 BLOCK CODING
10.11
Note
10.12
Note
10.13
Example 10.4
10.14
Note
10.15
Example 10.5
10.16
Example 10.6
Solution
We first find all the Hamming distances.
10.17
10-3 LINEAR BLOCK
CODES
Almost all block codes used today belong to a subset
called linear block codes. A linear block code is a code
in which the exclusive OR (addition modulo-2) of two
valid codewords creates another valid codeword.
10.18
Note
10.19
Methods
Simple Parity
Two Dimensional Parity
10.20
Note
10.21
Table 10.3 Simple parity-check code C(5,
4)
10.22
Error in Simple Parity Check
(even parity)
Dataword= 0010
Codeword=00100 (wrong answer)
…correct answer=00101
10.23
Figure 10.10 Encoder and decoder for simple parity-check
code
10.24
Two-dimensional parity-
check code
10.25
Figure 10.11 Two-dimensional parity-check code (even)
10.26
Figure 10.11 Two-dimensional parity-check code
10.27
Figure 10.11 Two-dimensional parity-check code
10.28
Table 10.4 Hamming code C(7,
4)
10.29
Figure 10.12 The structure of the encoder and decoder for a Hamming
code
10.30
Table 10.5 Logical decision made by the correction logic
analyzer
10.31
Figure 10.13 Burst error correction using Hamming
code
10.32
11-1 FRAMING
11.33
Types of Frames
Character-oriented protocol
Byte stuffing
Bit stuffing
11.34
Figure 11.1 A frame in a character-oriented
protocol
Example
542143564789
11.35
Figure 11.2 Byte stuffing and unstuffing
11.36
Note
11.37
Figure 11.3 A frame in a bit-oriented
protocol
11.38
Note
11.39
Figure 11.4 Bit stuffing and unstuffing
11.40
11-2 FLOW AND ERROR
CONTROL
The most important responsibilities of the data link
layer are flow control and error control. Collectively,
these functions are known as data link control.
11.41
Note
11.42
Note
11.43
11-3 PROTOCOLS
Now let us see how the data link layer can combine
framing, flow control, and error control to achieve the
delivery of data from one node to another. The
protocols are normally implemented in software by
using one of the common programming languages. To
make our discussions language-free, we have written
in pseudocode a version of each protocol that
concentrates mostly on the procedure instead of
delving into the details of language rules.
11.44
Figure 11.5 Taxonomy of protocols discussed in this chapter
11.45
Terminology
Sequence No.- It is a number given to each outbound
frame
Sliding Window- These are imaginary boxes at
transmitter & receiver.
Acknowlegement--An acknowledgement (ACK)
is
a signal that communicating processes, computers,
or devices to signify acknowledgement, or receipt
of message, as part of a communications protocol.
Positive
10.56
11-4 NOISELESS CHANNELS
11.57
Figure 11.6 The design of the simplest protocol with no flow or error
control
11.48
Example 11.1
11.49
Figure 11.7 Flow diagram for Example
11.1
11.50
Figure 11.8 Design of Stop-and-Wait Protocol
11.51
Example 11.2
11.52
Figure 11.9 Flow diagram for Example
11.2
11.53
11-5 NOISY
CHANNELS
Although the Stop-and-Wait Protocol gives us an idea
of how to add flow control to its predecessor, noiseless
channels are nonexistent. We discuss three protocols
in this section that use error control.
11.54
Note
11.55
Note
11.56
Note
11.57
Figure 11.10 Design of the Stop-and-Wait ARQ Protocol
11.58
Example 11.3
11.59
Figure 11.11 Flow diagram for Example
11.3
11.60
Note
11.61
Note
11.62
Note
11.63
Figure 11.14 Design of Go-Back-N ARQ
11.64
Note
11.65
Example 11.7
11.67
Figure 11.17 Flow diagram for Example
11.7
11.68
Note
11.69
Figure 11.20 Design of Selective Repeat
ARQ
11.70
Note
11.71
Figure 11.23 Flow diagram for Example
11.8
11.72