I don't really know what this is supposed to mean, if you want to print the truth-table of the NAND-gate that will be something like this: for (a=0; a<=1; ++a) for (b=0; b<=1; ++b) printf ("%d %d %d\n", a, b, !(a&&b))
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
pass the inputs through an nand gate and again pass them through inverter,which is again formed by an nand gate
nand gate
Not And (electronic logic gate)
The behavior and truth table of a Negative-ORgate is the same as for a NAND gate.
negative logic means negative input values. so by checking the truth table, it becomes an OR gate
I don't really know what this is supposed to mean, if you want to print the truth-table of the NAND-gate that will be something like this: for (a=0; a<=1; ++a) for (b=0; b<=1; ++b) printf ("%d %d %d\n", a, b, !(a&&b))
NAND gate is nothing but a AND gate with a NEGATION at its output. Its truth table is INPUT1 INPUT2 OUTPUT 0 0 1 0 1 1 1 0 1 1 1 0
A NAND gate is a digital logic gate that performs the operation of a NOT-AND gate. This means that the output of a NAND gate is the negation of the AND of its inputs. In other words, the output of a NAND gate is true only if one or more of its inputs are false. A NAND gate is often used as a universal gate, because it can be used to implement any logical function by connecting its outputs to one or more other gates in a specific configuration. This makes it very versatile and useful in the design of digital circuits and systems. A NAND gate is represented by the symbol shown below, where the inputs are labeled A and B and the output is labeled Y. Copy code A B __ | | Y | | | The truth table for a NAND gate is shown below, where 1 represents a true or high state and 0 represents a false or low state. Copy code A B Y 0 0 1 0 1 1 1 0 1 1 1 0 As you can see from the truth table, the output of a NAND gate is 1 only when both inputs are 0. Otherwise, the output is 0. This is the negation of the AND function, which is why a NAND gate is also called a NOT-AND gate.
the not gate applied to and gate is nand gate
Truth table of 'NAND' is 0 0 - 1 0 1 - 1 1 0 - 1 1 1 - 0 NAND is just opposite of AND as the name itself suggest NAND is the not of AND Truth table of "NOR" is 0 0 - 1 0 1 - 0 1 0 - 0 1 1 - 0 NOR is just opposite of OR as the name itself suggest NOR is the not of OR.
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
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 nand gate can be made from an and gate by introducing an inverter at the output of the gate.
nand gate
74ls00 is the ic no. Of nand gate