Hi peoples, just thought i'd comment on how great this site is before i start with my question, have had a good read of the boolean algebra section which has been very useful so far, as does the rest of the site. Anyway heres my question:
I've designed a circuit and simplified it using a Karnaugh map and come up with the following after simplifying the minterms:
R = A B C + A B C + A B C + A B C
which i have simplified to:
R = CB + CA
which i hope is correct
(btw sorry for underlines, they should be over the letters.. but i can't figure out how to do it on here)
I now need to design a circuit for this expression using only NAND and NOT gates. I've ages messing around with designs and testing them manually against a truth table and I can't come up with anything that works. To put it simply does anyone have an idea of how i could build this circuit using NAND and NOT gates only? Thanks in advance...
I've designed a circuit and simplified it using a Karnaugh map and come up with the following after simplifying the minterms:
R = A B C + A B C + A B C + A B C
which i have simplified to:
R = CB + CA
which i hope is correct
(btw sorry for underlines, they should be over the letters.. but i can't figure out how to do it on here)
I now need to design a circuit for this expression using only NAND and NOT gates. I've ages messing around with designs and testing them manually against a truth table and I can't come up with anything that works. To put it simply does anyone have an idea of how i could build this circuit using NAND and NOT gates only? Thanks in advance...