Scribd
Upload
16 views

Error Control

Uploaded by

Donna Jessica Agbayani
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
16 views

Error Control

Uploaded by

Donna Jessica Agbayani
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 33

Que Francis Ong

ERROR CONTROL
INTRODUCTION
• Noise is one of the main problem in any
communication system, in which affects the
reliability of a communication system.
• Data can be corrupted during transmission. For
reliable communication, errors must be detected and
corrected.
Types of Errors
1. Single bit error

In a frame, there is only one bit, anywhere though, which is


corrupt.

2. Multiple bits error

Frame is received with more than one bit corrupted but not
successive.
3. Burst error

Frame contains more than 1 consecutive bits corrupted.


ERROR CONTROL
• It is the process of detecting and correcting data
frames that have been corrupted or lost during
transmission.
• It is functionality used to detect erroneous
transmissions in data frames and retransmit them.
• Ensure that the information received by the
receiver is exactly the information transmitted by
the sender.
Two categories of Error Control
1. Error Detection
- process of monitoring the received data and determine
when transmission error has occurred
- detection or identification of errors
2. Error Correction
-is the process of detecting errors in transmitted
messages and reconstructing the original error-free data.
REDUNDANCY
• Instead of repeating the entire data stream, a shorter
group of bits may be appended to the end of each
unit.
• A technique of adding extra bit that will be used for
error detection.
REDUNDANCY
Error Detection Techniques
1. VRC (Vertical Redundancy Check)
2. LRC (Longitudinal Redundancy Check)
3. CRC (Cyclical Redundancy Check)
4. Checksum
VERTICAL REDUNDANCY CHECK
• It is also known as parity check
• It is least expensive mechanism for error detection
• In this technique, the redundant bit called parity bit is
appended to every data unit so that the total number of
1s in the unit becomes odd or even (including parity bit)
VERTICAL REDUNDANCY CHECK
1100001
Checking function

Is the total 11000011 Even – parity


number of 1s generator
even?

Receiver 1 VRC

Sender
VERTICAL REDUNDANCY CHECK
Example 1: Given the data message below determine
the VRC (used odd parity) and write the data stream
to be transmitted.
LSB MSB LSB MSB LSB MSB
1110110 1101111 1110010
VERTICAL REDUNDANCY CHECK
• VRC can detect all single – bit errors
• It can detect burst errors if the total number of
errors in each data unit is odd.
• VRC can not detect errors where the total number
of bits changed is even.
LONGITUDINAL REDUNDANCY
CHECK(LRC)
• In this method , a block of bits is organized in table(rows and
columns) and calculate the parity bit (even or odd parity) for
each column.
• It is also known as 2-D parity check
• Detects transmission errors about 95 to 98%
LRC Example
1110011111100111
1101110111011101
00111001 00111001
10101001 10101001

11100111
11011101
00111001
10101001

LRC 10101010

11100111 11011101 00111001 10101001 10101010

Original data plus LRC


Suppose the following block is sent :
10101001 00111001 11011101 11100111 10101010
(LRC)

However, it is hit by burst of length eight and some bits are


corrupted.
10100011 11000110 11011101 11100111 10101010
Advantage :
• LRC of n bits can easily detect burst error of n bits.

Disadvantage :
• If two bits in one data units are damaged and two bits in
exactly same position in another data unit are also
damaged , the LRC checker will not detect the error.
VERTICAL AND LONGITUDINAL
REDUNDANCY CHECK
Example: Determine the VRC and LRC for the following ASCII-
encoded message: THE WORLD. Use odd parity for VRC and
even parity for LRC.
CYCLIC REDUNDANCY CHECK(CRC)
• It is an error detection technique to detect changes to raw
data and is used widely in today’s computer networks.
• Also known as polynomial codes
• Approximately 99.95% of all transmission errors are
detected.
STANDARD POLYNOMIAL
Name Polynomial
CRC-8 x8 + x2 + x + 1
CRC-10 x10 + x9 + x5 + x4 + x2 + 1
CRC-16 (ITU) x16 + x12 + x5 + 1
CRC-32 (ITU) x32 + x26 + x23 + x22 + x16 + x12 + x11 +
x10 + x8 + x7 + x5 + x4 + x2 + x + 1
Procedure in finding for the CRC code:
1. Data polynomial is multiplied by the highest term of
the CRC generating polynomial.
2. Convert the data, CRC generating polynomial and the
result of procedure 1 to its equivalent binary number.
3. Divide the binary equivalent (result of procedure 1)
with the binary equivalent of the CRC generating
polynomial.
4. The remainder of the division done in procedure 3 is
the CRC code. (Take note the number of bits of the
CRC code must be equivalent to the highest exponent
of the CRC generating polynomial.
Example: Determine the CRC code or block check
sequence (BCS) for the following data and CRC
generating polynomials:

data G(x) = x7 + x5 + x4 + x2 + x1 + x0
CRC P(x) = x5 + x4 + x1 + x0
CHECKSUM
• An error-detection method in a the transmitter
computes a numerical value according to the
number of set or unset bits in a message and sends
it along with each message frame.
Example: Determine the checksum of the transmitted
data message.
10011001 11100010 00100100 10000100
Another Example:
If the data transmitted along with checksum is
10101001 00111001 00011101. But the data
received at destination is 10111001 10111001
00011101. Determine whether there is a transmission
error occurred.
ERROR CORRECTION
Methods
1. Symbol substitution
2. Retransmission
3. Forward error correction
Symbol Substitution
• It is designed to be used in a human environment
• If a character is received in error, a unique
character that is undefined by the character code,
such as reverse question mark is substituted for the
bad character.
Retransmission
• It is resending a message when it is received in
error.
• The most reliable method of error correction.
• Not the most efficient method of error correction
Forward Error Correction (FEC)
• It is the only error correction scheme that actually
detects and corrects transmission errors at the
receive end without calling for retransmission.
Hamming Code
• A popular error correcting code developed by
Richard Wesley Hamming.

Number of hamming bits is determine by the


expression:
2n ≥ m + n + 1
where n = number of Hamming bits
m = number of bits in the data character
Example: For a 12-bit data string of 101100010010,
determine the number of Hamming bits required,
arbitrarily place the Hamming bits into the data
string, determine the condition of each Hamming bit,
assume an arbitrary single-bit transmission error, and
prove that the Hamming code will detect the error.
Get in Touch
With Us
Send us a message or
visit us
City of Batac, Ilocos Norte,
Philippines
(63) 77-600-0459
[email protected]

Follow us for updates


facebook.com/MMSUofficial
www.mmsu.edu.ph

You might also like