Scribd
Upload
8 views6 pages

Error Detection in Computer Networks

The document discusses error detection and correction in computer networks, highlighting how digital signals can suffer from noise during transmission, leading to errors. It outlines various error-detecting codes such as simple parity check, two-dimensional parity check, checksum, and cyclic redundancy check (CRC), which help identify errors in transmitted data. Additionally, it explains two methods of error correction: Backward Error Correction, which requests retransmission, and Forward Error Correction, which allows the receiver to correct errors autonomously.

Uploaded by

Gaurav Singh Joon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8 views6 pages

Error Detection in Computer Networks

The document discusses error detection and correction in computer networks, highlighting how digital signals can suffer from noise during transmission, leading to errors. It outlines various error-detecting codes such as simple parity check, two-dimensional parity check, checksum, and cyclic redundancy check (CRC), which help identify errors in transmitted data. Additionally, it explains two methods of error correction: Backward Error Correction, which requests retransmission, and Forward Error Correction, which allows the receiver to correct errors autonomously.

Uploaded by

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

Error Detection and correction in Computer Networks

Error
A condition when the receiver’s information does not match with the sender’s
information. During transmission, digital signals suffer from noise that can introduce
errors in the binary bits travelling from sender to receiver. That means a 0 bit may
change to 1 or a 1 bit may change to 0.

Error Detecting Codes (Implemented either at Data link layer or Transport Layer
of OSI Model)
Whenever a message is transmitted, it may get scrambled by noise or data may get
corrupted. To avoid this, we use error-detecting codes which are additional data added
to a given digital message to help us detect if any error has occurred during
transmission of the message.

Basic approach used for error detection is the use of redundancy bits, where additional
bits are added to facilitate detection of errors.
Some popular techniques for error detection are:
1. Simple Parity check
2. Two-dimensional Parity check
3. Checksum
4. Cyclic redundancy check
1. Simple Parity check
Blocks of data from the source are subjected to a check bit or parity bit
generator form, where a parity of :
 1 is added to the block if it contains odd number of 1’s, and
 0 is added if it contains even number of 1’s
This scheme makes the total number of 1’s even, that is why it is called even
parity checking.
01000111 -0
1101011 -1
1001 -> 10010 ---transmission media ----- 10011----reject

2. Two-dimensional Parity check


Parity check bits are calculated for each row, which is equivalent to a simple
parity check bit. Parity check bits are also calculated for all columns, then both
are sent along with the data. At the receiving end these are compared with the
parity bits calculated on the received data.
3. Checksum
 In checksum error detection scheme, the data is divided into k segments
each of m bits.
 In the sender’s end the segments are added using 1’s complement
arithmetic to get the sum. The sum is complemented to get the
checksum.
 The checksum segment is sent along with the data segments.
 At the receiver’s end, all received segments are added using 1’s
complement arithmetic to get the sum. The sum is complemented.
 If the result is zero, the received data is accepted; otherwise discarded.

10011001 11100010 00100100 10000100 11011010

Data to be sent
4. Cyclic redundancy check (CRC)
 Unlike checksum scheme, which is based on addition, CRC is based on
binary division.
 In CRC, a sequence of redundant bits, called cyclic redundancy check
bits, are appended to the end of data unit so that the resulting data unit
becomes exactly divisible by a second, predetermined binary number.
 At the destination, the incoming data unit is divided by the same number.
If at this step there is no remainder, the data unit is assumed to be
correct and is therefore accepted.
 A remainder indicates that the data unit has been damaged in transit and
therefore must be rejected.
Example :

X3 +1: – (1 . x3) + (0. X2) + (0.x1) +1

1001

X4 +x2+1 ---- (1. X4) + (0. X3) + (1. X2) + (0. X1) +1

10101 5-1 =4

1.X3 +0.x2+0. x+ 1
1001

Error Correction
In the digital world, error correction can be done in two ways:
 Backward Error Correction When the receiver detects an error in the data
received, it requests back the sender to retransmit the data unit.
 Forward Error Correction When the receiver detects some error in the data
received, it executes error-correcting code, which helps it to auto-recover and to
correct some kinds of errors.
The first one, Backward Error Correction, is simple and can only be efficiently used
where retransmitting is not expensive. For example, fiber optics. But in case of wireless
transmission retransmitting may cost too much. In the latter case, Forward Error
Correction is used.
To correct the error in data frame, the receiver must know exactly which bit in the
frame is corrupted. To locate the bit in error, redundant bits are used as parity bits for
error detection.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy