Proving XOR Gate Universality: Elementary Operations & Logical Manipulation

  • Thread starter Thread starter braceman
  • Start date Start date
  • Tags Tags
    Gate Universal
AI Thread Summary
The discussion centers on whether an XOR gate can be classified as a universal gate, similar to NAND and NOR gates. Participants emphasize that to prove universality, one must demonstrate that the functions AND, OR, and NOT can be constructed using only XOR gates. It is concluded that while an inverter can be created using an XOR gate, neither AND nor OR functions can be derived solely from XOR gates. The consensus is that XOR gates output high only when their inputs differ, which limits their capability to perform universal logic operations. Ultimately, XOR is not considered a universal gate due to these constraints.
braceman
Messages
30
Reaction score
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.

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:
Physics news on Phys.org
Sorry, misread your post. Look into definitions or requirements of a universal gate.
 
Last edited:
To prove that gate type X is "universal", you just need to show that the Boolean functions AND, OR, and NOT can be implemented using only gate type X without the need for any other type gate. Can you do that with an XOR gate?
 
phinds said:
To prove that gate type X is "universal", you just need to show that the Boolean functions AND, OR, and NOT can be implemented using only gate type X without the need for any other type gate. Can you do that with an XOR gate?
Or prove that you can make a single NOR or NAND gate
 
here is a hint. first see if you can make an inverter
then see if you can make any input a 'blocker.' an example of that is an and gate, if any input is a zero, the ouput will be zero, independent of any other input
 
Here's another hint: Try to prove you can't make an AND gate. (I don't think this is so easy to show if you haven't seen an argument before though).
 
Sorry I haven't posted back...forgot all about this post. I got it right in the end, Instructor said I could prove it however I wanted, so I just drew various combinations of 3-4 gates and their associated logic.
 
Is it correct that AND and OR cannot be derived from XOR at all?
 
bizuputyi said:
Is it correct that AND and OR cannot be derived from XOR at all?
what do you think, and why?
 
  • #10
What I meant is that an AND or OR gated cannot be derived by using only XOR gates. We can however make an inverter out of a XOR gate by connecting constant high to one of its input but I can't see any possible way to get either AND or OR from only XORs. To account for that I would say XOR gives high output only if its two inputs differ.
 
  • #11
bizuputyi said:
What I meant is that an AND or OR gated cannot be derived by using only XOR gates. We can however make an inverter out of a XOR gate by connecting constant high to one of its input but I can't see any possible way to get either AND or OR from only XORs. To account for that I would say XOR gives high output only if its two inputs differ.
I agree.
 
Back
Top