Scribd
Upload
5 views31 pages

14 - Error 1

The document discusses error detection and correction in data transmission, emphasizing the importance of accuracy and reliability. It outlines types of errors such as single-bit and burst errors, and explains methods for error detection like Vertical Redundancy Check (VRC) and Longitudinal Redundancy Check (LRC). Additionally, it covers concepts such as Hamming distance and coding schemes, particularly focusing on block coding for redundancy in error detection.

Uploaded by

nikhil.2226cse1108
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
5 views31 pages

14 - Error 1

The document discusses error detection and correction in data transmission, emphasizing the importance of accuracy and reliability. It outlines types of errors such as single-bit and burst errors, and explains methods for error detection like Vertical Redundancy Check (VRC) and Longitudinal Redundancy Check (LRC). Additionally, it covers concepts such as Hamming distance and coding schemes, particularly focusing on block coding for redundancy in error detection.

Uploaded by

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

Error Detection

and Correction-
Part 1
Contents
 Basic Concepts
 Types of Errors
 Hamming Distance
 Vertical Redundancy Check (VRC)
 Longitudinal Redundancy Check (LRC)
Basic concepts
Networks must be able to transfer data from one device to another
with complete accuracy.
Data can be corrupted during transmission.
For reliable communication, errors must be detected and corrected.
 Error detection and correction are implemented
either at the data link layer or the transport layer of the OSI model.
Types of Errors

Types of
Errors

Burst
Single Bit Multi Bit
Error
Types of Errors
Single-bit error means that only 1 bit of a given data unit (such as a byte, character, or packet) is
changed from 1 to 0 or from 0 to 1.
Single bit errors are the least likely type of errors in serial data transmission because the noise must
have a very short duration which is very rare.
However, this kind of errors can happen in parallel transmission.
Example:
If data is sent at 1Mbps then each bit lasts only 1/1,000,000 sec. or 1 μs.
For a single-bit error to occur, the noise must have a duration of only 1 μs, which is very rare.
Types of Errors
The term burst error means that two or more bits in the data unit
have changed from 1 to 0 or from 0 to 1.
Burst errors does not necessarily mean that the errors occur in
consecutive bits, the length of the burst is measured from the first
corrupted bit to the last corrupted bit. Some bits in between may not
have been corrupted.
Types of Errors
Burst error is most likely to happen in serial transmission since the duration of
noise is normally longer than the duration of a bit.
The number of bits affected depends on the data rate and duration of noise.
Example:
If data is sent at rate = 1Kbps then a noise of 1/100 sec can affect 10
bits.(1/100*1000)
If same data is sent at rate = 1Mbps then a noise of 1/100 sec can
affect 10,000 bits.(1/100*106)
Types of Errors
Error detection
Error detection means to decide whether the received data is correct
or not without having a copy of the original message.

Error detection uses the concept of redundancy, which means


adding extra bits for detecting errors at the destination.
Redundancy
Error Correction
More difficult than error detection
In this receiver detects the invalid codeword and finds the original
codeword
Error correction require more redundant bits than error detection
Error Correction

Forward error correction is the process in which the receiver


tries to guess the message by using redundant bits. This is
possible, as we see later, if the number of errors is small.

Retransmission : Correction by retransmission is a technique in


which the receiver detects the occurrence of an error and asks
the sender to resend the message. Resending is repeated until a
message arrives that the receiver
believes is error-free (usually, not all errors can be detected).
MODULAR ARITHMETIC

modulus N: We use only the integers 0 to N - 1


Figure 10.4 XORing of two single bits or two words

10.14
Coding

Redundancy is achieved through various coding schemes.


We can divide coding schemes into two broad categories:
block coding and convolution coding.
Our concentration will be on block coding only.
To perform coding, we need encoding and decoding which is shown in
next figure.
The receiver can detect error/ a change in the original codeword, if it
follows these two conditions:
1. The receiver has (or can find) a list of valid codewords.
2. The original codeword has changed to an invalid one
10.15
Figure 10.3 The structure of encoder and decoder

10.16
10-2 BLOCK CODING

In block coding, we divide our message into blocks,


each of k bits, called datawords. We add r redundant
bits to each block to make the length n = k + r. The
resulting n-bit blocks are called codewords.

Topics discussed in this section:


Error Detection
Error Correction
Hamming Distance
Minimum Hamming Distance
10.17
Figure 10.5 Datawords and codewords in block coding

10.18
Figure 10.6 Process of error detection in block coding

10.19
Example 10.2
Let us assume that k = 2 and n = 3. Table 10.1 shows the list of datawords and
codewords. Later, we will see how to derive a codeword from a dataword.

Assume the sender encodes the dataword 01 as 011 and sends it to the receiver.
Consider the following cases:

1. The receiver receives 011. It is a valid codeword. The


receiver extracts the dataword 01 from it.
2. The codeword is corrupted during transmission, and
111 is received. This is not a valid codeword and is
discarded.

3. The codeword is corrupted during transmission, and


An error- 000 is received. This is a valid codeword. The receiver
detecting code incorrectly extracts the dataword 00. Two corrupted
can detect bits have made the error undetectable.
only the types of Table 10.1 A code for error detection (Example 10.2)
errors for which
it is designed;
other types of
errors may
remain
undetected.
Hamming Distance
Hamming distance between two words is the number of differences
between the corresponding bits. In this both words must be of same
size.
 XOR operation is to find the hamming distance
E.g., d(0010,1011) is 2
The hamming distance represent the number of bits affected by
error
Minimum Hamming Distance
The minimum hamming distance is the smallest hamming distance
between all the possible pair.
E.g. Three words are (101, 110, 111)
d(101,110)=2, d(101, 111)=1, d(110,111)=1
In this case =1
Eg: 2:: (000, 011, 101, 110)

Eg: 3::(00000, 10101, 01011, 11110)


Four types of redundancy checks are used
in data communications(Error Detection)
Vertical Redundancy Check
VRC or parity check is the simplest and most popular error detection
scheme. In this technique, a redundant bit, called a parity bit, is
appended to every data unit so that the total number of 1s in the unit
becomes even.
Compute
Sender Parity Bit Receiver

Y
1010101 N Reject
Even Data

Compute
Parity Bit Compute
Parity Bit

1010101 0
1010101 0

Transmission Media
Performance
• Detect single bit error
• It can detect burst error only if the number of error is odd.

• EG
• 11100001 10100001 (3)  correctly Rejects
• 11100001 10100101 (4)  erroneously accept(because burst error is even)

• Ques:
• 1110110
• 1101111
• 1110010
Longitudinal Redundancy
Check (LRC)
Organize data into a table(rows and columns) and create a
parity for each column
11100111 11011101 00111001 10101001
11100111
11011101
00111001
10101001
10101010

11100111 11011101 00111001 10101001 10101010


Original Data LRC
11100111, 11011101,00111001,
10101001
Odd no of 1s 1
Even no of 1s 0
Performance
LRC increases the likelihood of detecting burst errors
if 2 bits in one data unit or damaged and 2 bits in exactly the same
position in another data unit are also damaged the LRC checker will
not detect an error.

Ques
01110111
10101001
01110001
11111111

You might also like