DLCOA- Realize basic gates using universal gates.
EXPERIMENT NO.2
AIM: To realize basic gates using universal gates.
Objectives:
To implement basic gates (AND, OR, NOT) using NAND, NOR gate and verify their truth table.
To implement universal gates (NOR, EXOR, EXNOR) using NAND, NOR
gate and verify their truth table.
CO’s to be achieved: 1 (Design and simulate different digital circuits)
PO’s to be achieved: PO1, PO2, PO3, PO10
APPARATUS REQUIRED:
THEORY:
Logic gates are electronic circuits which perform logical functions on one or more inputs to produce one output. There are seven logic gates. When all the input combinations of a logic gate are written in a series and their corresponding outputs written along them, then this input/ output combination is called Truth Table.
1)NAND gate as Universal gate
NAND gate is actually a combination of two logic gates i.e. 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. So this gate is also called as universal gate.
NAND gates as NOT gate
A NOT produces complement of the input. It can have only one input, tie the inputs of a NAND gate together. Now it will work as a NOT gate. Its output is
Y = (A.A)’
Y = (A)’
Figure-1:NAND gates as NOT gate
Figure-2:Truth table of NOT
1.2) NAND gates as AND gate
A NAND produces complement of AND gate. So, if the output of a NAND gate is inverted, overall output will be that of an AND gate.
Y = ((A.B)’)’
Y = (A.B)
Figure-3:NAND gates as AND gate
Figure-4:Truth table of AND
1.3) NAND gates as OR gate
From DeMorgan’s theorems:
(A.B)’ = A’ + B’
(A’.B’)’ = A’’ + B’’ = A + B
So, give the inverted inputs to a NAND gate, obtain OR operation at output.
Figure-5:NAND gates as OR gate
Figure-6:Truth table of OR
1.4) NAND gates as Ex-OR gate
The output of a two input Ex-OR gate is shown by: Y = A’B + AB’. This can be achieved with the logic diagram shown in the left side.
Figure-7:NAND gates as Ex-OR gate
Figure-8:Truth table of Ex-OR
1.5) NAND gates as Ex-NOR gate
Ex-NOR gate is actually Ex-OR gate followed by NOT gate. So give the output of Ex-OR gate to a NOT gate, overall output is that of an Ex-NOR gate.
Y = AB+ A’B’
Figure-9:NAND gates as Ex-NOR gate
Figure-10:Truth table of Ex-NOR
1.6) Implementing the simplified function with NAND gates only
We can now start constructing the circuit. First note that the entire expression is inverted and we have three terms ANDed. This means that we must use a 3-input NAND gate. Each of the three terms is, itself, a NAND expression. Finally, negated single terms can be generates with a 2-input NAND gate acting as an inverted. Figure 8 illustrates a circuit using NAND gates only.
F=((C'.B.A)'(D'.C.A)'(C.B'.A)')'
Figure-11:Implementing the simplified function with NAND gates only.
2)NOR gate as Universal Gate
NOR gate is actually a combination of two logic gates: OR gate followed by NOT gate. So its output is complement of the output of an OR gate. This gate can have minimum two inputs, output is always one. By using only NOR gates, we can realize all logic functions: AND, OR, NOT, Ex-OR, Ex-NOR, NAND. So this gate is also called universal gate.
2.1)NOR gates as NOT gate
A NOT produces complement of the input. It can have only one input, tie the inputs of a NOR gate together. Now it will work as a NOT gate. Its output is
Y = (A+A)’
Y = (A)’
Figure-12:NOR gates as NOT gate
Figure-13:Truth table of NOT
2.2) NOR gates as OR gate
A NOR produces complement of OR gate. So, if the output of a NOR gate is inverted, overall output will be that of an OR gate.
Y = ((A+B)’)’
Y = (A+B)
Figure-14:NOR gates as OR gate
Figure-15:Truth table of OR
2.3)NOR gates as AND gate
From DeMorgan’s theorems:
(A+B)’ = A’B’
(A’+B’)’ = A’’B’’ = AB
So, give the inverted inputs to a NOR gate, obtain AND operation at output.
Figure-16:NOR gates as AND gate
Figure-17:Truth table of AND
2.4)NOR gates as Ex-NOR gate
The output of a two input Ex-NOR gate is shown by: Y = AB + A’B’. This can be achieved with the logic diagram shown in the left side.
Figure-18:NOR gates as Ex-NOR gate
Figure-19:Truth table of Ex-NOR
2.5)NOR gates as Ex-OR gate
Ex-OR gate is actually Ex-NOR gate followed by NOT gate. So give the output of Ex-NOR gate to a NOT gate, overall output is that of an Ex-OR gate.
Y = A’B+ AB’
Figure-20:NOR gates as Ex-OR gate
Figure-21:Truth table of Ex-OR
2.6)Constructing a circuit with NOR gates only
Designing a circuit with NOR gates only uses the same basic techniques as designing a circuit with NAND gates; that is, the application of De Morgan’s theorem. The only difference between NOR gate design and NAND gate design is that the former must eliminate product terms and the later must eliminate sum terms.
F=(((C.B'.A)+(D.C'.A)+(C.B'.A))')'
Figure-22:Implementing the simplified function with NOR gates only
PROCEDURE:
Please refer virtual lab
1)https://de-iitr.vlabs.ac.in/
2) http://vlabs.iitkgp.ernet.in/coa/
- Connections are given as per circuit diagram.
- Logical inputs are given as per circuit diagram.
- Observe the output and verify the truth table.
Input and Output:
LOGIC OF OR GATE USING NAND GATE(RIGHT CONNECTION)
Comments
Post a Comment