Next: Boolean Expressions Up: Universality of certain gates Previous: Universality of certain gates Contents
Using NAND gatesNOTFigure 12.10: Realizing a NOT gate using a NAND gate
OR The following statements are called DeMorgan's Theorems and can be easily verified and extended for more than two variables.
(12.1)(12.2)
(12.3)(12.4)In general: (12.5)Thus :(12.6)
Now it is easy to see that , which can be checked from the truth table easily. The resulting realization of OR gate is shown in 12.11
Figure 12.11: Realization of OR gate by NAND gates
AND gateFigure 12.12: Realization of AND gate by NAND gates
X-OR gate
(12.7)
Clearly, this can be implemented using AND, NOT and OR gates, and hence can be implemented using universal gates.
Figure 12.13: X-OR gate
X-NOR gate
(12.8)
Again, this can be implemented using AND, NOT and OR gates, and hence can be implemented using universal gates, i.e., NAND or NOR gates.
Figure 12.14: X-NOR gate
Next: Boolean Expressions Up: Universality of certain gates Previous: Universality of certain gates Contentsynsingh 2007-07-25
because it is an universal gate that control and repairs other gates.
Check this link http://www.dumpt.com/img/viewer.php?file=bd6b3mqsa66fhr6c76l1.bmp
by the procedure design a half subtractor design a logic ciruit to add two numbers with five bits each drawthe logic diagram of afull adder using using NAND gates only ?
A: NAND implies not and to be true both input must be hi or true <> There are two flavors of NAND gate. The positive input/negative output NAND will have a low output if and only if both inputs are high. The negative input/positive output NAND will have a high output if and only if both inputs are low.
for a two input gate to represent as an n-input gate excatly n-1 two input gates are required. this implies that for a two input OR gate to represent a four input OR gate exactly three two input OR gates are required let F is =a+b+c+d =(((a+b)+c)+d) =((a+b)+(c+d)) in both the above cases + is used three times so three two input OR gates make a four input OR gates. This discussion doesnot hold good for NAND gates an example can illlustrate the reson:- take F=(a.b.c.d)'=a'+b'+c'+d' --------------------------->(1) (this is obtained by a four input NAND gate) let us take this in the manner we did it for an OR gate and we will then verify the result. =((a.b)'(c.d)')' =((a'+b').(c'+d'))' =(a'+b')'+(c'+d')' =ab+cd <------------------------(2) (1)is not equal to (2) so we can say that a NAND gate cannot be replaced in the manner as OR gate is replaced
A universal gate is a logic gate that can be used to implement any logic function. The NAND gate and NOR gate are examples of universal gates because any other logic gate can be constructed using only NAND or only NOR gates.
universal logic gate is a gate using which you can make all the logic gates there are two such gates NOR gate and NAND gate
That title of "Universal Gate" is reserved for NAND gates because you can build all possible logic using only NAND logic . You can build even other basic logic like AND, OR and NOT using NAND.
two nand gates
universal gates are the ones from which we can design other gates also. for eg. NAND and NOR gates. they help in forming the uniformity in the circuits.
Next: Boolean Expressions Up: Universality of certain gates Previous: Universality of certain gates ContentsUsing NAND gatesNOTFigure 12.10: Realizing a NOT gate using a NAND gateOR The following statements are called DeMorgan's Theorems and can be easily verified and extended for more than two variables.(12.1)(12.2)(12.3)(12.4)In general: (12.5)Thus :(12.6)Now it is easy to see that , which can be checked from the truth table easily. The resulting realization of OR gate is shown in 12.11Figure 12.11: Realization of OR gate by NAND gatesAND gateFigure 12.12: Realization of AND gate by NAND gatesX-OR gate(12.7)Clearly, this can be implemented using AND, NOT and OR gates, and hence can be implemented using universal gates.Figure 12.13: X-OR gateX-NOR gate(12.8)Again, this can be implemented using AND, NOT and OR gates, and hence can be implemented using universal gates, i.e., NAND or NOR gates.Figure 12.14: X-NOR gateNext: Boolean Expressions Up: Universality of certain gates Previous: Universality of certain gates Contentsynsingh 2007-07-25
Next: Boolean Expressions Up: Universality of certain gates Previous: Universality of certain gates ContentsUsing NAND gatesNOTFigure 12.10: Realizing a NOT gate using a NAND gateOR The following statements are called DeMorgan's Theorems and can be easily verified and extended for more than two variables.(12.1)(12.2)(12.3)(12.4)In general: (12.5)Thus :(12.6)Now it is easy to see that , which can be checked from the truth table easily. The resulting realization of OR gate is shown in 12.11Figure 12.11: Realization of OR gate by NAND gatesAND gateFigure 12.12: Realization of AND gate by NAND gatesX-OR gate(12.7)Clearly, this can be implemented using AND, NOT and OR gates, and hence can be implemented using universal gates.Figure 12.13: X-OR gateX-NOR gate(12.8)Again, this can be implemented using AND, NOT and OR gates, and hence can be implemented using universal gates, i.e., NAND or NOR gates.Figure 12.14: X-NOR gateNext: Boolean Expressions Up: Universality of certain gates Previous: Universality of certain gates Contentsynsingh 2007-07-25
an AND gate and a NOT gate
A&B = ((A&B)')' So two, it would go a - | ==NAND--=NAND-- b - | By using two NAND gates back-to-back, you can create a normal AND gate.
when the two inputs are shorted, a NAND gate acts like a NOT gate. hence AND = NAND + NOT For OR gate, inverse both the inputs before connecting them to a NAND gate. So three NAND gates would be needed.
That title of "Universal Gate" is reserved for NAND gates because you can build all possible logic using only NAND logic . You can build even other basic logic like AND, OR and NOT using NAND.
Any logic gate from which all other logic gate functions can be derived. The two universal gates are NAND and NOR.