XORing X with 1 gives X', i.e., NOT(X). If we are able to construct a NAND (AND) using XOR, we can also obtain AND (NAND) from it, which makes XOR a universal gate since inverted inputs to a NAND (AND) will give OR (NOR). However XOR is not a universal gate! Therefore we cannot obtain NAND (AND) using XOR. :-)
By,
Tirtha Sarathi Ghosh
Class 10
IIT Kanpur Aspirant
As such an OR gate should do the job...but if the question is of using gates other than the simple OR, it should be a combo of NOR and NOT gates; where-in, the NOT gate comes after the NOR gate. Factfully speaking: The output of a NOR gate when fed to a NOT gate shall give you an OR gate. cheers :) Anish Murthy Airpula, RF Design Engineer (F.A.E) Ceramic & Microwave Products Group, Dover Corporation Inc, United States of America
You can't make XOR out of NOT alone. Mathematically, NOT takes only a single argument, and its gate, an inverter, takes a single input. There's no way to combine two inputs giving a single output with one input gates. You need some two input gates to do the job. They can be AND, OR, NAND, NOR, or some combination, but you need something. That said, they don't have to be IC gates; you can combine two inputs with diodes to make an OR gate, so you could make XOR with only inverters and diodes, i.e. no other gate symbols on your schematic, but it would mot be making XOR out of NOT.
____ ____ c ----->|xor |------------> s a ->|xor |-+------------>|____| b ->|____| | _____ _____ +--->|nand |------>|nand |--> c c ----->|_____| +-->|_____| _____ | a ----->|nand |--+ b ----->|_____|
And, or, xor, xnor, nand, nor, not
If you're allowed to prove this the easy way (by showing you can use XOR and AND to create the set of AND, OR, and NOT), this is pretty straightforward. x AND y = x AND y (of course) x OR y = (x XOR y) XOR (x AND y) NOT x = x XOR 1 Also, (x AND y) XOR 1 is equivalent to x NAND y, which is a universal gate.
To make a full subtractor, you need an XOR and a NAND gate.
No, XOR gate is a not a universal gate. There are basically two universal gates NAND and NOR.
All other logic gates can be made using XOR and XNOR, but to get NOT, you need to do (input) XOR 1 or (input) XNOR 0, but with NAND, you don't need 1: (input) NAND (input).
The XOR operation can be implemented using only NAND gates by combining multiple NAND gates in a specific arrangement to achieve the desired XOR functionality.
Its possible to design a 4-i/p xor gate using only 2-i/p nand gates Although the design turns out to be quite complex and comprises of 21 NAND gates : F = (A'B+AB')(C'D'+CD) + (A'B'+AB)(C'D+CD') Above given equation is the o/p equation for the circuit .
As such an OR gate should do the job...but if the question is of using gates other than the simple OR, it should be a combo of NOR and NOT gates; where-in, the NOT gate comes after the NOR gate. Factfully speaking: The output of a NOR gate when fed to a NOT gate shall give you an OR gate. cheers :) Anish Murthy Airpula, RF Design Engineer (F.A.E) Ceramic & Microwave Products Group, Dover Corporation Inc, United States of America
Seven gates, they are: not, and, or, nor, nand, xor, xnor.
xor and xnor gates are derived from not gate
You can't make XOR out of NOT alone. Mathematically, NOT takes only a single argument, and its gate, an inverter, takes a single input. There's no way to combine two inputs giving a single output with one input gates. You need some two input gates to do the job. They can be AND, OR, NAND, NOR, or some combination, but you need something. That said, they don't have to be IC gates; you can combine two inputs with diodes to make an OR gate, so you could make XOR with only inverters and diodes, i.e. no other gate symbols on your schematic, but it would mot be making XOR out of NOT.
yes... xor is derived gate from primary gates
No. OR is not functionally complete, so you can not use it to derive any other logical expression. The reason for this is because you can only construct the following expressions out of only OR gates: A OR B A OR A Because of the Idempotency theorem, A OR A simply reduces to A, so we are left with A OR B, which we can not use to derive any other logical circuits. At the very least, we would also need a NOT gate. This is why NOR and NAND are functionally complete: you can derive a NOT gate by using A NAND A or A NOR A.
No. OR is not functionally complete, so you can not use it to derive any other logical expression. The reason for this is because you can only construct the following expressions out of only OR gates: A OR B A OR A Because of the Idempotency theorem, A OR A simply reduces to A, so we are left with A OR B, which we can not use to derive any other logical circuits. At the very least, we would also need a NOT gate. This is why NOR and NAND are functionally complete: you can derive a NOT gate by using A NAND A or A NOR A.