karnaugh map
I am trying to create a binary adder. I have this truth table:
This is the Karnaugh map that I made for this function (see that there is a mistake: instead of c, it had to be "c-in"):
Now, as the map looks like that, it gives me that s = c + c but that is certainly false. Can anyone help me with this?
I beleive that you will need to do two Karnaugh maps; one for each output. After you have done the two maps, you can see if there are any common terms that can be used in a solution for both outputs.
Just simply make a truth table that shows values of F for each of the combinations of A, B and C. Then transfer this information to the K-Map format table to do the minimization.
Best Answer
If we look at the top left corner, where a=0 and c=0, we see that s follows b. This gives us a partial result of s=b. Moving down to the bottom left corner, we see that s is inverted when a=1. This is the XOR operation, and gives us s=a^b. Moving over to the right side, we see that the output is inverted when c=1. This gives us our final result of s=a^b^c.