Scribd
Upload
17 views

Ch3 Part 2 Error Detection and Correction

Error detection refers to the process of identifying and detecting errors or anomalies in data or signals. This is a critical task in various fields, including computer science, telecommunications, data transmission, and more.

Uploaded by

thaanussh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views

Ch3 Part 2 Error Detection and Correction

Error detection refers to the process of identifying and detecting errors or anomalies in data or signals. This is a critical task in various fields, including computer science, telecommunications, data transmission, and more.

Uploaded by

thaanussh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

DATA

COMMUNICATIONS
AND NETWORKS
(SEET3623)

CHAPTER 3 DR. NURZAL EFFIYANA BINTI GHAZALI


PART 2: Error Detection &
[email protected]
Correction
P19a-02-17
0197771227
ERROR CONTROL 2

• Transmission errors are caused by:


• Electrical interference from natural sources such as lightning
• Man-made sources such as motors, generators, power line, and fluorescent
lights
• Error control can be done in 2 ways:
• Error detection
• Error correction
• Error performance is the rate in which error occur
• Probability error (𝑷𝑷[𝒆𝒆]): Theoretical expectation (mathematical) of the rate
which error will occur
• Bit error rate (BER): The actual historical record of a system’s error
performance
• BER is measured and then compared with the probability of error to evaluate
system performance
N.E.G.2022
ERROR CONTROL 3

• If a system has a 𝑃𝑃(𝑒𝑒) of 10−5

Mathematically the system can expect to experience one bit error for
−5 1 1
every 100,000 bits transported through the system (10 = 5 = )
10 100,000

• If a system has a BER of 10−5

In the past there was one bit error for every 100,000 bits transported.

N.E.G.2022
ERROR DETECTION 4

What?
• Process of monitoring data transmission and determining when errors have
occurred

Why?
• To prevent undetected errors from occurring

How?
• Parity Check (to illustrate basic ideas behind error detection & correction)
• Cyclic Redundancy Check (typically used in the link layer in an adapter)
• Checksum (typically used in the transport layer)
N.E.G.2022
ERROR DETECTION 5

Error detection and correction scenario

Network adapter: Its relationship to


other host components and to protocol
stack functionality
N.E.G.2022
PARITY CHECK 6

• The most common and least expensive


• Parity bit is added to every data unit so that the
total number of 1s in the unit (including the
parity bit) becomes even (or odd)
• Example: Sending binary data unit 1011011 ([).
Adding 1s gives us 5, an odd number. Before
transmitting, the data is passed through a parity
generator. The parity generator counts the 1s
and appends the parity bit to the end. The total
Even parity concept of 1s is now 6, an even number, and the data
unit passes.
• Principle for odd checking is same, where the
number of 1s should be odd
• Even parity for synchronous and odd for
asynchronous
N.E.G.2022
ACTIVITY 1 7

Find disadvantages of parity check

N.E.G.2022
EXERCISE 1 8

Suppose the sender wants to send the word world. In ASCII, the five characters are
coded as:

1110111 1101111 1110010 1101100 1100100


w o r l d

Develop the parity bit to this data.

N.E.G.2022
REDUNDANCY 9

• Duplicating each data unit for the purpose of detecting errors


• Effective but costly especially for long messages
• Adding bits for the sole purpose of detecting errors is called redundancy checking

N.E.G.2022
CYCLIC REDUNDANCY CHECK (CRC) 10

• Most common and powerful using sequence of redundant bit


• For block of k bits, transmitter generates n-k bit frame check sequence (FCS)/CRC
• Transmits n bits which is exactly divisible by some predetermined number (pattern)
• Receiver divides frame by the same predetermined number
• If getting no remainder, assume no error
• Three equivalent ways to clarify
• Modulo 2 arithmetic
• Polynomials
• Digital logic (not cover)

N.E.G.2022
ACTIVITY 2 11

Describe figure below.

N.E.G.2022
ACTIVITY 2 cont… 12

• Parameters:
 T = n-bit frame (codeword) to be transmitted
 D = k-bit block of data; the first k bits of T
 F = (n – k)-bit FCS; the last (n – k) bits of T
 P = pattern of n – k + 1 bits; this is the
predetermined divisor
 Q = Quotient
 R = Remainder

N.E.G.2022
MODULO 2 ARITHMETIC 13

• Performed digit by digit on binary numbers


• Each digit is considered independently from its neighbor
• Numbers are not carried or borrow
• Binary subtraction with no carries is also interpreted as the XOR operation:

1 1 1 1 1 1 1 1 1 1 0 0 1
+ 1 0 1 0 - 0 1 0 1 X 1 1
0 1 0 1 1 0 1 0 1 1 0 0 1
1 1 0 0 1
1 0 1 0 1 1

XOR
N.E.G.2022
BINARY DIVISION 14

1 1 0 1 1 0 0 1 0 0 0 0 0

N.E.G.2022
EXERCISE 2 15

Given

Message, D = 1010001101 (10 bits)


Pattern, P = 110101 (6 bits)

• Calculate FCR, R
• Transmitted message, T
• Show the message is received with error or without error

N.E.G.2022
CRC:POLYNOMIALS 16

• Selection of polynomial P(x):


 should not be divisible by X
 should be divisible by X+1
• Benefits:
 Detects all burst errors that affect odd number of bits
 Detects all burst errors of length less than or equal to degree of the polynomial
 Detects, with high probability, all burst errors of length greater than the degree of
the polynomial

N.E.G.2022
CRC:POLYNOMIALS 17

• CRC-8: 𝑥𝑥 8 + 𝑥𝑥 2 + 𝑥𝑥 + 1
 [Factors] = (𝑥𝑥 + 1)(𝑥𝑥 7 + 𝑥𝑥 6 + 𝑥𝑥 5 + 𝑥𝑥 4 + 𝑥𝑥 3 + 𝑥𝑥 2 + 𝑥𝑥 + 1)
 Used in: 802.16 (along with error correction)
• CRC-CCITT: 𝑥𝑥 16 + 𝑥𝑥 12 + 𝑥𝑥 5 + 1
 [Factors] = (𝑥𝑥 + 1)(𝑥𝑥 15 + 𝑥𝑥 14 + 𝑥𝑥 13 + 𝑥𝑥 12 + 𝑥𝑥 4 + 𝑥𝑥 3 + 𝑥𝑥 2 + 𝑥𝑥 + 1)
 Used in: HDLC, SDLC, PPP default

N.E.G.2022
EXERCISE 3 18

Represent this polynomial in binary

(𝑥𝑥 8 + 𝑥𝑥 7 + 𝑥𝑥 5 + 𝑥𝑥 4 + 𝑥𝑥 2 + 𝑥𝑥 + 1)

N.E.G.2022
CHECKSUM 19

• The concept of the checksum is not difficult.


• Suppose our data is a list of five 4-bit numbers that we want to send to a destination.
In addition to sending these numbers, we send the sum of the numbers.
• Example:
If the set of numbers is (7, 11, 12, 0, 6), we send (7, 11, 12, 0, 6, 36), where 36 is the
sum of the original numbers. The receiver adds the five numbers and compares the
result with the sum. If the two are the same, the receiver assumes no error, accepts
the five numbers, and discards the sum. Otherwise, there is an error somewhere and
the data are not accepted.

N.E.G.2022

You might also like