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.
ans. 3 nand gates resoon :- OR GATE :- x+y NAND GATE :- x'+y' LOGIC :-so the logic is is we apply NAND to the inputs x' and y' instead of xand y we would get x+y DESIGN PROCEDURE 1. for inverting the input x and y can be done by NAND gates , 2. take a NAND gate and pass both x in both the inputs it means x NAND x gives you x' 3. follow similar procedure for inverting y 4. and then all the outputs of those NAND gates as the inputs of another NAND gate
A universal gate is a gate which can implement any Boolean function without need touse any other gate type.The NAND and NOR gates are universal gates.In practice, this is advantageous since NAND and NOR gates are economical andeasier to fabricate and are the basic gates used in all IC digital logic families.In fact, an AND gate is typically implemented as a NAND gate followed by aninverter not the other way around!!Likewise, an OR gate is typically implemented as a NOR gate followed by an inverternot the other way around!!A universal gate is a gate which can implement any Boolean function without need touse any other gate type.The NAND and NOR gates are universal gates.In practice, this is advantageous since NAND and NOR gates are economical andeasier to fabricate and are the basic gates used in all IC digital logic families.In fact, an AND gate is typically implemented as a NAND gate followed by aninverter not the other way around!!Likewise, an OR gate is typically implemented as a NOR gate followed by an inverternot the other way around!!can be combined to produce AND, OR,NOT,XORand XNOR gates
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
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
yes (a or b)' = a' and b' a or b = (a' and b')' a or b = a' nand b'
The two categories for logic gates are basic logic gates and universal gates. Gates are identified by their function and universal gates are identified as NAND gate or NOR gate.
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.
two nand gates
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.
an AND gate and a NOT gate
ans. 3 nand gates resoon :- OR GATE :- x+y NAND GATE :- x'+y' LOGIC :-so the logic is is we apply NAND to the inputs x' and y' instead of xand y we would get x+y DESIGN PROCEDURE 1. for inverting the input x and y can be done by NAND gates , 2. take a NAND gate and pass both x in both the inputs it means x NAND x gives you x' 3. follow similar procedure for inverting y 4. and then all the outputs of those NAND gates as the inputs of another NAND 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.
A universal gate is a gate which can implement any Boolean function without need touse any other gate type.The NAND and NOR gates are universal gates.In practice, this is advantageous since NAND and NOR gates are economical andeasier to fabricate and are the basic gates used in all IC digital logic families.In fact, an AND gate is typically implemented as a NAND gate followed by aninverter not the other way around!!Likewise, an OR gate is typically implemented as a NOR gate followed by an inverternot the other way around!!A universal gate is a gate which can implement any Boolean function without need touse any other gate type.The NAND and NOR gates are universal gates.In practice, this is advantageous since NAND and NOR gates are economical andeasier to fabricate and are the basic gates used in all IC digital logic families.In fact, an AND gate is typically implemented as a NAND gate followed by aninverter not the other way around!!Likewise, an OR gate is typically implemented as a NOR gate followed by an inverternot the other way around!!can be combined to produce AND, OR,NOT,XORand XNOR gates
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
Any logic gate from which all other logic gate functions can be derived. The two universal gates are NAND and NOR.
A logic circuit of any complexity can be realized by using only the three basic gates (NOT, AND, and OR Gates). There are two universal gates, the NAND Gate and the NOR gate. Each of those can also realize logic circuit single-handedly. The NAND and NOR gates are therefore called universal gates.