- #1
braceman
- 30
- 0
Hi guys, got a question that's got me stumped. Not looking for the answer as I'd prefer to work it out myself, just a nudge or a pointer in the right direction.
I'm being asked to prove if an XOR gate can be classed as universal (like the NAND & NOR gates are), but not sure how to go about it. I think there must be a simple way to do it, rather than draw numerous combinations of XOR gates.
Determine the elementary operations that can be derived from XOR and hence determine if it is a universal gate.
Obviously got the truth table for XOR, am I supposed to be manipulating this, or taking a function, ie - F = A.B + C. not A and then trying to manipulate this like we do when converting to NAND/NOR (changing gates and inverting terms etc).
Bit stuck, so any pointers would be grateful.
I'm being asked to prove if an XOR gate can be classed as universal (like the NAND & NOR gates are), but not sure how to go about it. I think there must be a simple way to do it, rather than draw numerous combinations of XOR gates.
Homework Statement
Determine the elementary operations that can be derived from XOR and hence determine if it is a universal gate.
Homework Equations
The Attempt at a Solution
Obviously got the truth table for XOR, am I supposed to be manipulating this, or taking a function, ie - F = A.B + C. not A and then trying to manipulate this like we do when converting to NAND/NOR (changing gates and inverting terms etc).
Bit stuck, so any pointers would be grateful.
Last edited by a moderator: