Contents
How basic logic gates are obtained by using NAND gates only?
NAND gate is actually a combination of two logic gates: AND gate followed by NOT gate. So its output is complement of the output of an AND gate. This gate can have minimum two inputs, output is always one. By using only NAND gates, we can realize all logic functions: AND, OR, NOT, X-OR, X-NOR, NOR.
How many NAND gates are required to design the circuit?
How many NAND gates are required to make one NOT gate? Only one NAND gate is required to make a NOT gate. If one input of a NAND gate is made permanently high, we get a NOT gate [see figure (a)]. Alternatively, if both the inputs of a NAND gate are tied together, we get a NOT gate.
How to make a circuit with only NAND gates?
Simple – when both inputs are the same. If you tie A and B together so they always see the same signal, then you have a NOT gate. 0 nand 0 = 1, 1 nand 1 = 0. So the NOT gate can just be:
How to implement logic functions using only NAND OR NOR gates?
The core of this conundrum is as follows: The student has been presented with a Boolean Equation. He’s been instructed to create a corresponding truth table. He’s been told to perform Karnaugh map minimization. Finally, he must create an implementation using only NAND gates or only NOR gates.
Why do you need three gates in a logic circuit?
So these three gates form a sum of products configuration and there was no need to use De Morgan on the whole function. You pretty much had this on your third diagram. If instead of tying the inputs together at the second level you applied your four inputs, with X through and inverter, you would have gotten the answer.
How many transistors are in a NAND OR NOR gate?
Next up the complexity ladder are NAND and NOR gates, each of which contain four transistors. And then we have AND and OR gates, each of which contain six transistors. All of this means that if we can use a NAND or a NOR instead of an AND or an OR, then we can reduce our transistor count by a third.