Scribd
Upload
526 views14 pages

Lecture 3 Hamming Code

Hamming code is an error-correction code that detects and corrects errors during data transmission. It adds redundant bits calculated using a formula to the data bits before transmission. The redundant bits are placed in positions corresponding to powers of 2. To detect errors, parity checks are performed on groups of bits indicated by their binary positions. If a parity check results in an odd number of 1s, the redundant bit is set to 1, otherwise it is set to 0. When an error is detected, the erroneous bit can be identified and corrected by its position.

Uploaded by

goutam sanyal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
526 views14 pages

Lecture 3 Hamming Code

Hamming code is an error-correction code that detects and corrects errors during data transmission. It adds redundant bits calculated using a formula to the data bits before transmission. The redundant bits are placed in positions corresponding to powers of 2. To detect errors, parity checks are performed on groups of bits indicated by their binary positions. If a parity check results in an odd number of 1s, the redundant bit is set to 1, otherwise it is set to 0. When an error is detected, the erroneous bit can be identified and corrected by its position.

Uploaded by

goutam sanyal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 14

Hamming code

Hamming Code
• Hamming code is a set of error-correction
codes that can be used to detect and correct
the errors that can occur when the data is
moved or stored from the sender to the
receiver. It is technique developed by R.W.
Hamming for error correction.
Redundant bits –
• Redundant bits are extra binary bits that are generated
and added to the information-carrying bits of data
transfer to ensure that no bits were lost during the
data transfer.
The number of redundant bits can be calculated using
the following formula:
• 2^r ≥ m + r + 1 where, r = redundant bit, m = data bit
Suppose the number of data bits is 7, then the number
of redundant bits can be calculated using:
= 2^4 ≥ 7 + 4 + 1
Thus, the number of redundant bits= 4
Parity bits –
• A parity bit is a bit appended to a data of binary bits to ensure that
the total number of 1’s in the data is even or odd. Parity bits are
used for error detection. There are two types of parity bits:
• Even parity bit:
In the case of even parity, for a given set of bits, the number of 1’s
are counted. If that count is odd, the parity bit value is set to 1,
making the total count of occurrences of 1’s an even number. If the
total number of 1’s in a given set of bits is already even, the parity
bit’s value is 0.
• Odd Parity bit –
In the case of odd parity, for a given set of bits, the number of 1’s
are counted. If that count is even, the parity bit value is set to 1,
making the total count of occurrences of 1’s an odd number. If the
total number of 1’s in a given set of bits is already odd, the parity
bit’s value is 0.
1011001
• Determining the position of redundant bits –
These redundancy bits are placed at the
positions which correspond to the power of 2.
As in the above example:
• The number of data bits = 7
• The number of redundant bits = 4
• The total number of bits = 11
• The redundant bits are placed at positions
corresponding to power of 2- 1, 2, 4, and 8
R1 bit is calculated using parity check at all the bits positions
whose binary representation includes a 1 in the least
significant position.R1: bits 1, 3, 5, 7, 9, 11
To find the redundant bit R1, we check for even parity. Since
the total number of 1’s in all the bit positions corresponding
to R1 is an even number the value of R1 (parity bit’s value) =
0.
R2 bit is calculated using parity check at all the bits positions whose
binary representation includes a 1 in the second position from the
least significant bit.R2: bits 2,3,6,7,10,11.
To find the redundant bit R2, we check for even parity. Since the total
number of 1’s in all the bit positions corresponding to R2 is odd the
value of R2(parity bit’s value)=1
R4 bit is calculated using parity check at all the bits positions
whose binary representation includes a 1 in the third position
from the least significant bit.R4: bits 4, 5, 6, 7
To find the redundant bit R4, we check for even parity. Since the
total number of 1’s in all the bit positions corresponding to R4 is
odd the value of R4(parity bit’s value) = 1
R8 bit is calculated using parity check at all the bits positions
whose binary representation includes a 1 in the fourth position
from the least significant bit.R8: bit 8,9,10,11
To find the redundant bit R8, we check for even parity. Since the
total number of 1’s in all the bit positions corresponding to R8 is
an even number the value of R8(parity bit’s value)=0.
Thus, the data transferred is:
Error detection and correction –
Suppose in the above example the 6th bit is changed
from 0 to 1 during data transmission, then it gives new
parity values in the binary number:

The bits give the binary number as 0110 whose decimal representation is 6. Thus, the bit 6
contains an error. To correct the error the 6th bit is changed from 1 to 0.
THANK YOU

You might also like