Exp2 Dlca
Exp2 Dlca
Theory: A universal gate is a logic gate which can implement any Boolean
function without the need to use any other type of logic gate. The NOR gate and
NAND gate are universal gates. This means that you can create any logical
Boolean expression using only NOR gates or only NAND gates.
1) NAND Gate: A NAND gate is a logic gate, whose output will be logic 0 if both
of its inputs are high, and logic 1 if any one of the inputs is low.
Input Output
A B ~(A.B)
1 1 0
1 0 1
0 1 1
0 0 1
2) NOR Gate: A NOR gate is a logic gate, whose output will be logic 0 if any one
of its inputs is high, and logic 1 if both inputs are low.
Input Output
A B ~(A+B)
1 1 0
1 0 0
0 1 0
0 0 1
i) AND Gate Using NAND Gate: To construct an AND Gate from NAND Gates,
we need an inverter or NOT Gate at the output of NAND Gate. The double
inversion cancels out functions as AND.
ii) OR Gate Using NAND Gate: To construct an OR Gate from NAND Gates, the
first two NAND Gates invert both inputs and those outputs are applied to another
NAND Gate to obtain OR function.
iii) NOT Gate Using NAND Gate: To construct an NOT Gate from NAND
Gates, both the inputs of NAND Gates are given the same input or connected to
obtain NOT function.
iv)EX-OR Gate Using NAND Gate: To construct an EX-OR Gate we need 5 NAND
Gates.
v)AND Gate Using NOR Gate: To construct an AND Gate from NOR Gates,
we give outputs of 2 NOR Gate as input to the next NOR Gate then it
functions as AND.
vi) OR Gate Using NOR Gate: To construct an OR Gate from NOR Gates, we
give output of NOR Gate as input to the next NOR Gate then it functions as OR.
vii) NOT Gate Using NOR Gate: To construct an NOT Gate from NOR Gates,
both the inputs of NAND Gates are given the same input or connected to obtain
NOT function.
viii) EX-OR Gate Using NOR Gate: To construct an EX-OR Gate we need 5 NOR
Gates.
Output:
Realisation using NAND gate:
Realisation using NOR gate:
Conclusion: