Can you show a diagram of the gates please. I don’t understand what you’ve writte
I'm sorry -- this would be really messy if we drew it out in logic gates -- but you could easily draw out the individual stages if that makes it easier for you to visualize things.
The gate picture for the proposed solution is quite messy, as it involves several layers of gates. You can do it yourself of course from the equations---I tried and it was a complete spaghetti, and the equations actually explain the idea behind the solution a little better.
Having said that, I came up with a different, simpler design:
Aout = not Ain
Bout = not(Bin and Cin) and Bin
Cout = not(Bin and Cin) and Cin
which is fairly easy to draw, as it involves only five total gates.
It works because not(Bin and Cin) is notBin or notCin by de Morgan laws, and when you OR it with e.g. Bin you can cancel out Bin OR notBin, so notCin is what's left.
This sounds great (happy face) -- but I don't think it works (sad face). Consider the following truth table (I'm using Bi and Bo etc. for in and out to keep things short, also ! & | for NOT, AND, OR):
Bi Ci | (Bi & Ci) | !(Bi & Ci) | Bo = !(Bi & Ci) & Bi | !Bi
0 0 | 0 | 1 | 0 | 1
0 1 | 0 | 1 | 0 | 1
1 0 | 0 | 1 | 1 | 0
1 1 | 1 | 0 | 0 | 0
What we get --------------' |
What we want --------------------------'
if I did the right thing, you should receive a notification email to let you know about this comment.
Please let me know if you received it, thanks!
To post reply to a comment, click on the 'reply' button attached to each comment. To post a new comment (not a reply to a comment) check out the 'Write a Comment' tab at the top of the comments.
Registering will allow you to participate to the forums on ALL the related sites and give you access to all pdf downloads.