Explain about hamming error correcting code, Computer Engineering

Assignment Help:

Q. Explain about Hamming error correcting code?

Richard Hamming at Bell Laboratories worked out this code. We will only introduce this code with help of an illustration for 4 bit data. Let's presume a 4 bit number b4, b3, b2, b1.  In order to create a simple error detection code which detects error in one bit only we can just add an odd parity bit.  Though if we want to find which bit is in error then we may have to employ parity bits for different combinations of these 4 bits in such a way that a bit error can be recognized uniquely.  For illustration we can create four parity sets as below

Source Parity                            Destination Parity

b1, b2, b3                                                        P1                                            D1

b2, b3, b4                                                        P2                                            D2

b3, b4, b1                                                        P3                                            D3

b1, b2, b3, b4                                                  P4                                            D4

Now very interesting phenomenon can be noticed in above displayed parity pairs.  Assume data bit b1 is in error on transmission then it will cause alteration in destination parity D1, D3, D4.

ERROR IN                                                     Cause change in Destination Parity 

(One bit only)

b1                                                                                             D1, D3, D4

b2                                                                                             D1, D2, D4

b3                                                                                             D1, D2, D3, D4

b4                                                                                             D2, D3, D4

Figure: The error detection parity code mismatch

So by simply comparing parity bits of source and destination we can recognize that which of four bits is in error. This bit then can be complemented to eliminate error. Please note that even source parity bit can be in error on transmission but under assumption that just one bit (irrespective of data or parity) is in error it would be detected as just one destination parity would be different. What should be length of error detection code that detects error in one bit? Before responding this question we have to look in comparison logic of error detection. Error detection is done by comparing two ‘i’ bit error detection and correction codes fed to comparison logic bit by bit (see figure below). Let’s have comparison logic that produces a zero if compared bits are same or else it generates a one. Consequently if similar Position bits are similar then we obtained zero at that bit Position however if they are dissimilar that is this bit position may point to an error then this Particular bit position would be marked as one. This way a matching word is built. This matching word is ‘i’ bit long so can signify 2i values or combinations.


Related Discussions:- Explain about hamming error correcting code

What is a demultiplexer, What is a Demultiplexer ? Ans. Demultiplex...

What is a Demultiplexer ? Ans. Demultiplexer has similar circuit as decoder but here E is obtained as the particular input line, the output lines are similar as decode

How many bits must be decoded for 128 × 8 ram chips, How many bits must be ...

How many bits must be decoded for chip select? What is the size of decoder when 128 × 8 RAM chips are required to provide a memory capacity of 2048 bytes? Ans. All higher order l

Determine the benefits of developing prototype, Determine the benefits of d...

Determine the benefits of developing prototype According to SOMM [96] benefits of developing prototype are as following:  1.  Communication gap between clients and software

How address symbol table is generated, Address symbol table is generated by...

Address symbol table is generated by the  (A) memory management software.  (B) assembler.  (C) match logic of associative memory.   (D) generated by operating system

#logic function, Minimize the following logic function using K-maps and rea...

Minimize the following logic function using K-maps and realize using NAND and NOR gates. F(A,B,C,D) =?_m(1,3,5,8,9,11,15) + d(2,13).

Describe message passing model, Q. Describe Message Passing Model? In ...

Q. Describe Message Passing Model? In message-passing model there be a set of tasks which employ their own local memories at the time of computation. Many tasks may inhabit on

Explain virtual packets, Explain Virtual Packets. The router can't tran...

Explain Virtual Packets. The router can't transfer a copy of a frame from one kind of network to other since the frame formats be different. More significantly, the router cann

What is uml, ? UML is called as Unified Modeling Language. ? it is used...

? UML is called as Unified Modeling Language. ? it is used to Graphical language for visualizing artifacts of the system. ? It Allow to make a blue print of all the aspects

write a ''c'' program to accept any 3 digit integer number, Write a 'C' pr...

Write a 'C' program to accept any 3 digit integer number from the keyboard and display the word equivalent representation of the given number

Explain flash devices, Explain Flash devices It is possible to read the...

Explain Flash devices It is possible to read the contents of a one cell, but it is only possible to write an whole block of cells Greater density which leads to superior cap

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd