Practical Submission Sheet
Student Name: Shivam Rai
Submission Date: 24/11/2021
Lecture Date: 17/11/2021
Project Number: 1
Course Code: ECE 233
Section: E2001
Registration Number: 12018182
Term: 3
Roll No: RE2001A03
Practical Name: Hamming Code Generation, Error Detection, and
Correction.
1. Concept Learned:
a.
b.
c.
d.
e.
f.
g.
Generation of Hamming code.
Displaying Hamming Code on a 7-segment display.
Calculation of the number of parity bits.
Placement of Parity Bits.
Error Detection in Hamming Code.
Good Parity and Bad Parity.
Error Correction in Hamming Code.
2. Key Observations and Insights:
#1011
h. No. of parity bits: 2p >= p + n + 1
Here 3 is satisfying the condition. So, we need a minimum of
3 parity bits.
So, n = 4 & p = 3.
ii. Placement of Parity Bits:
Location of Parity bits:
• 20 = 1st position
• 21 = 2nd position
• 22 = 4th position
• 23 = 8th position
• 24 = 16th position ……
D3
iii.
D2
P3
D0
P2
P1
4
P3
100
3
D0
011
2
P2
010
1
P1
001
Value of Parity Bits:
7
6
D3
D2
111
110
• P1: 3,5,7
• P2: 3,6,7
• P3: 5,6,7
iv.
D1
Hamming Code
Generation
• P1: 1,1,1 = 1
• P2: 1,0,1 = 0
• P3: 1,0,1 = 0
5
D1
101
Hamming Code
D3
D2
D1
1
0
1
P3
0
D0
1
3. CIRCUITS
Hamming Code Generation
P2
0
P1
1
Error Detection
Error Correction using 3x8 Decoder and 2:1 Multiplexer
Complete Circuit
4. Application Of Hamming Code
a. Hamming codes are still widely used in computing.
b. They are extensively used in the telecommunication
industry.
c. They are used in computer memory, modems, and
embedded processors.
d. They are used in nanosatellites.