Scribd
Upload
1K views2 pages

Hamming Code Error Correction

The document describes how to calculate the parity bits for Hamming code error correction. It gives a 7-bit data string 1100101 and explains how to determine the parity bits P1, P2, P4, and P8 based on whether the total number of 1s in certain bit positions is even or odd. It calculates each parity bit by counting the 1s in the relevant bit positions. The resulting 11-bit code word with parity bits is 00111000101.

Uploaded by

Mate Šimović
Copyright
© Attribution Non-Commercial (BY-NC)
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
1K views2 pages

Hamming Code Error Correction

The document describes how to calculate the parity bits for Hamming code error correction. It gives a 7-bit data string 1100101 and explains how to determine the parity bits P1, P2, P4, and P8 based on whether the total number of 1s in certain bit positions is even or odd. It calculates each parity bit by counting the 1s in the relevant bit positions. The resulting 11-bit code word with parity bits is 00111000101.

Uploaded by

Mate Šimović
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 2

Hamming code Error Correction Calculation Given : 1100101 7 bits TO find : Code word Parity bits fill the

e postions like : 1, 2, 4 , 8 , 16 ( 2 power x , x varies from 0 to n). Figure 1: P1 D3 P4 D5 D6 D7 P8 D9 1 1 0 0 1 Now , we need to find the Parity bits : P1 , P2 , P4 , P8 Steps : 1st bit : ( P1) Find the zeroth bit ( 2 power 0 = 1) of the positions to be 1 Like , 0001 1 0010 2 0011 3 0100 4 0101 5 So it will be : 1 , 3, 5 , 7 , 9 , 11 ( From Fig 1) 0110 6 | | | | | | 0111 7 1 1 0 1 1 1000 8 1001 9 Total no . of 1s = 4 (even parity ) 1010 10 Set parity bit P1 = 0 1011 11 2nd bit : ( P2) Find the first bit ( 2 power 1 = 2) of the position to be 1 P2 D10 0 D11 1

So it will be , 2 , 3, 6 , 7 , 10 , 11 ( From Fig 1) | | | | | 1 0 0 0 1 Total no . of ones = 2 ( even parity ) Set parity bit P2 0 4th bit : ( P4) Find the second bit ( 2 power 2 =4) of the position to be 1 So it will be , 4 , 5 , 6 , 7 , | | | 1 0 0 ( from fig 1) Total no of ones = 1 ( odd parity ) Set parity bit P4 1 8th bit : ( P8) Find the third bit ( 2power 3 = 8) of the position to be 1 So it will be , 8 , 9 , 10 , 11 | | | 1 0 1 ( from fig 1) Total no . of ones = 2 ( even parity ) Set Parity bit P8 0 Code word : P1 P2 D3 P4 D5 D6 D7 P8 D9 D10 D11 0 0 1 1 1 0 0 0 1 0 1 Code word : 00111000101 So for more practice , we can refer slide # 9 and verify our answers.

You might also like