Scribd
Upload
6 views4 pages

Sessional 5

The document discusses error correction methods, specifically backward and forward error correction, and introduces Hamming code as a technique for detecting and correcting errors in transmitted data. It explains the calculation of redundant bits needed for error detection and provides a detailed example of how to determine the position of errors using parity bits. The process involves recalculating parity bits at the receiving end to identify and correct any errors in the transmitted data.

Uploaded by

bkgaming9234372094
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
6 views4 pages

Sessional 5

The document discusses error correction methods, specifically backward and forward error correction, and introduces Hamming code as a technique for detecting and correcting errors in transmitted data. It explains the calculation of redundant bits needed for error detection and provides a detailed example of how to determine the position of errors using parity bits. The process involves recalculating parity bits at the receiving end to identify and correct any errors in the transmitted data.

Uploaded by

bkgaming9234372094
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/ 4

Sessional

(5) To Study Error Correction method

Error correction :-Error correction is the process of detecting errors in transmitted messages and
reconstructing the original error-free data.

Error Correction can be handled in two ways:

(i) Backward error correction: Once the error is discovered, the receiver requests the sender to
retransmit the entire data unit.

(ii) Forward error correction: In this case, the receiver uses the error-correcting code which
automatically corrects the errors.

For correcting the errors, one has to know the exact position of the error. For example, If we want to
calculate a single-bit error, the error correction code will determine which one of seven bits is in error.
To achieve this, we have to add some additional redundant bits.

Suppose r is the number of redundant bits and d is the total number of the data bits. The number of
redundant bits r can be calculated by using the formula

2r>=d+r+1
The value of r is calculated by using the above formula. For example, if the value of d is 4, then the
possible smallest value that satisfies the above relation would be 3.

To determine the position of the bit which is in error, a technique developed by R.W Hamming is
Hamming code which can be applied to any length of the data unit and uses the relationship between
data units and redundant units.

Hamming Code

Parity bits: The bit which is appended to the original data of binary bits so that the total number of 1s is
even or odd.

Even parity: To check for even parity, if the total number of 1s is even, then the value of the parity bit is
0. If the total number of 1s occurrences is odd, then the value of the parity bit is 1.

Odd Parity: To check for odd parity, if the total number of 1s is even, then the value of parity bit is 1. If
the total number of 1s is odd, then the value of parity bit is 0.

Algorithm of Hamming code:


o An information of 'd' bits are added to the redundant bits 'r' to form d+r.
o The location of each of the (d+r) digits is assigned a decimal value.
o The 'r' bits are placed in the positions 1,2,.....2k-1.

o At the receiving end, the parity bits are recalculated. The decimal value of the parity bits
determines the position of an error.
Relationship b/w Error position & binary number.

Let's understand the concept of Hamming code through an example:

Suppose the original data is 1010 which is to be sent.

Total number of data bits 'd' = 4


Number of redundant bits r :
2r >= d+r+1
2r>= 4+r+1
Therefore, the value of r is 3 that satisfies the above relation.
Total number of bits = d+r = 4+3 = 7

Determining the position of the redundant bits

The number of redundant bits is 3. The three bits are represented by r1, r2, r4. The position of the
redundant bits is calculated with corresponds to the raised power of 2. Therefore, their corresponding
positions are 1, 21, 22.

1. The position of r1 = 1
2. The position of r2 = 2
3. The position of r4 = 4

Representation of Data on the addition of parity bits:

Determining the Parity bits

Determining the r1 bit

The r1 bit is calculated by performing a parity check on the bit positions whose binary representation
includes 1 in the first position.
We observe from the above figure that the bit positions that includes 1 in the first position are 1, 3, 5, 7.
Now, we perform the even-parity check at these bit positions. The total number of 1 at these bit
positions corresponding to r1 is even, therefore, the value of the r1 bit is 0.

Determining r2 bit

The r2 bit is calculated by performing a parity check on the bit positions whose binary representation
includes 1 in the second position.

We observe from the above figure that the bit positions that includes 1 in the second position are 2, 3,
6, 7. Now, we perform the even-parity check at these bit positions. The total number of 1 at these bit
positions corresponding to r2 is odd, therefore, the value of the r2 bit is 1.

Determining r4 bit

The r4 bit is calculated by performing a parity check on the bit positions whose binary representation
includes 1 in the third position.

We observe from the above figure that the bit positions that includes 1 in the third position are 4, 5, 6,
7. Now, we perform the even-parity check at these bit positions. The total number of 1 at these bit
positions corresponding to r4 is even, therefore, the value of the r4 bit is 0.

Data transferred is given below:


Suppose the 4th bit is changed from 0 to 1 at the receiving end, then parity bits are recalculated.

R1 bit

The bit positions of the r1 bit are 1,3,5,7

We observe from the above figure that the binary representation of r1 is 1100. Now, we perform the
even-parity check, the total number of 1s appearing in the r1 bit is an even number. Therefore, the value
of r1 is 0.

R2 bit

The bit positions of r2 bit are 2,3,6,7.

We observe from the above figure that the binary representation of r2 is 1001. Now, we perform the
even-parity check, the total number of 1s appearing in the r2 bit is an even number. Therefore, the value
of r2 is 0.

R4 bit

The bit positions of r4 bit are 4,5,6,7.

We observe from the above figure that the binary representation of r4 is 1011. Now, we perform the
even-parity check, the total number of 1s appearing in the r4 bit is an odd number. Therefore, the value
of r4 is 1.

o The binary representation of redundant bits, i.e., r4r2r1 is 100, and its corresponding decimal
value is 4. Therefore, the error occurs in a 4th bit position. The bit value must be changed from 1
to 0 to correct the error.

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