TOFEDetector

 

Here is a reference you might want to read over - http://en.wikipedia.org/wiki/Hamming_code.

Food for thought - if there are always 2 bits high and three low, what is the parity going to be?

 

Thanks @Beenthere

 

why not drop the word into a register and then performing a compare with logic gates?

 

@techroomt

i didnt understand ur logic....can u explain it more clearly.........

 

the register is just a means to hold your status word fror decoding, not required if it is already stored or available elsewhere. the bits can then be inputs to some and & or gates to "watch" for the specific pattern to output a high signal (or whatever stste your circuit requires). this is not much unlike a parity checker circuit honestly.

 

i am afraid we will need more detail of your application and conditions to help any further.

 

Simple.

First, draw up a 32 line truth table for all possible states of the five inputs. Outputs will be "0" for any input combination containing two and only two "1." Output will "1" for all other inputs.

Next, study the table and look for patterns. Create a logic circuit to satisfy the truth table.

Hint: There are only ten of the thirty-two states which will not be error states.

 

Thanks a lot thingmaker......