
Home

Sign up!

Projects

Seminars

Research Notes

Today's Lecture

About

Update Seminar Form
Course:
Seminar Topic:
Seminar Description:
Hamming Code for Error Detection & Correction Codes was invented by Richard Hamming. This error detection and Correction method detects and corrects a singlebit error. <br><b>Hamming Code Algorithm</b> <br>While transmitting the data<br> 1. Take ASCII value of the character.<br> 2. Add 64 to the ASCII value.<br> 3. Compute the binary equivalent of the sum..<br> 4. Break the binary into two parts, each of 4bits..<br> 5. Locate the obtained two 4bit binary numbers in the table (Hamming codes) and replace them with corresponding hamming code words..<br> 6. Transmit the code words.<br>.<br> While receiving the data.<br> 1. For each 7bit data received, hamming distance is calculated with respect to each codeword present in the table..<br> 2. The codeword, which gives the 1 as hamming distance is the correct code word that should have been received..<br> 3. The last three bits are removed from the correct codeword..<br> 4. Remaining 4bits form the data word..<br> 5. Obtain the 4bit data word from the two consecutive code words (corrected) and combine them together..<br> 6. The data word obtained is the corrected errorfree word..<br><b>Example</b> Data word to be transmitted A ASCII value of ‘A’ 65.<br> Add 64. Value obtained= 65+64=129<br> Binary equivalent of 129=10000001<br> Two 4bit parts 1000<br> 0001<br> Hamming code for 1000 is 1000110<br> 0001 is 0001011<br> On receiving error occurs, say, instead of 1000110 we receive 1000010<br> , and instead of 0001011 we receive 1001011<br> After computing the hamming distance, we get the corrected codewords and after removing the rightmost 3 bits we get, 1000 and 0001.<br> As we combine the two we get, 10000001 which is equal to 129=’A’. <br><br>Using the table created for Hamming code, one can detect and correct the error in the code, if any.
Your Password:
Prof. Ashay Dharwadker