BASIC LOGIC GATES Shyam Kumar M.Sc Physics Roll No-15510059
[email protected] february, 2016
1
Contents 1 ABSTRACT
3
2 INTRODUCTION
3
3 THEORY 3.1 NOT GATE . 3.2 AND GATE . 3.3 OR GATE . . 3.4 NAND GATE 3.5 NOR GATE .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
3 3 4 4 4 5
4 DATA ANALYSIS OF GATES 4.1 NOT GATE . . . . . . . . . . . . 4.2 AND GATE . . . . . . . . . . . . 4.3 OR GATE . . . . . . . . . . . . . 4.4 NAND GATE . . . . . . . . . . . 4.5 NOR GATE . . . . . . . . . . . . 4.6 NAND GATE from NOR GATE 4.7 AND GATE from NOR GATE . 4.8 NOR GATE from NAND GATE 4.9 OR GATE from NAND GATE .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
6 6 6 6 7 7 7 8 8 8
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
5 CONCLUSION
9
6 REFERENCE
9
2
1
ABSTRACT
Under this experiment (Basics Logic Gates) we will study the operation of the AND, NAND, OR and NOR logic gates and analyse the outputs with the truth tables for the aforesaid gates.
2
INTRODUCTION
A large number of electronic circuits in computers, control units and so on are made up of logic gates. A Gate is a logic circuit that has only two (one inpute in NOT) but only one outpute.A signal appears at the output only for certain combinations of the inpute signals. thus, the circuit behave like a gate which either allows a signal to pass through it or blocks it. The basics Logic gates are:
3 3.1
THEORY NOT GATE
Truth Table of a NOT Gate is given in this form: INPUT A 0 1
OUTPUT Q 1 0
3
3.2
AND GATE
The truth table of AND Gate is given in the form: INPUT A 0 0 1 1
3.3
INPUT B 0 1 0 1
OUTPUT Q 0 0 0 1
OR GATE
The truth table of OR GATE is given in the form: INUPUT A 0 0 1 1
3.4
INPUT B 0 1 0 1
OUTPUT Q 0 1 1 1
NAND GATE
The truth table of NAND GATE is given in the form: INUPUT A 0 0 1 1
INPUT B 0 1 0 1 4
OUTPUT Q 1 1 1 0
3.5
NOR GATE
The truth table of NOR GATE is given in the form: INUPUT A 0 0 1 1
INPUT B 0 1 0 1
OUTPUT Q 1 0 0 0
The microelectronic chip that we are going to use in this practical as AND, OR, NAND, NOR and NOT GATES are given as follows with their corresponding IC Numbers:
7404 one input NOT GATE
5
4 4.1
DATA ANALYSIS OF GATES NOT GATE
Source as high voltage input = 4.40 V(ON) Source as low voltage input = 0 V(OFF) INPUT A 0 1
4.2
OUTPUT Q Vout in V 1 3.870(ON) 0 0.190(OFF)
AND GATE
Source as high voltage input = 4.82 V(ON) Source as low voltage input = 0 V(OFF) INPUT
OUTPUT State
A B state multicolumn1—c—Voltage State Voltage State Voltage State VOltage State Vout in V 1 4.82 1 4.82 1 4.84 (ON) 1 4.82 0 0 0 .11 (OFF) 0 0 1 4.82 0 .11 (OFF) 0 0 0 0 0 .11 (OFF)
4.3
OR GATE
Source as high voltage input = 4.82 V(ON) Source as low voltage input = 0 V(OFF) INPUT
OUTPUT State
A B state multicolumn1—c—Voltage State Voltage State Voltage State VOltage State Vout in V 1 4.82 1 4.82 1 4.83 (ON) 1 4.82 0 0 1 4.83 (ON) 0 0 1 4.82 1 4.83 (ON) 0 0 0 0 0 0 (OFF)
6
4.4
NAND GATE
Source as high voltage input = 4.83 V(ON) Source as low voltage input = 0 V(OFF) INPUT
OUTPUT State
A B state multicolumn1—c—Voltage State Voltage State Voltage State VOltage State Vout in V 1 4.83 1 4.83 0 .12 (OF) 1 4.83 0 0 1 4.29 (ON) 0 0 1 4.82 1 4.26 (ON) 0 0 0 0 1 4.29 (ON)
4.5
NOR GATE
Source as high voltage input = 4.83 V(ON) Source as low voltage input = 0 V(OFF) INPUT
OUTPUT State
A B state multicolumn1—c—Voltage State Voltage State Voltage State VOltage State Vout in V 1 4.83 1 4.83 0 .17 (OFF) 1 4.83 0 0 0 .18 (OFF) 0 0 1 4.82 0 .18 (OFF) 0 0 0 0 1 4.31 (ON)
4.6
NAND GATE from NOR GATE
7
4.7
AND GATE from NOR GATE
4.8
NOR GATE from NAND GATE
4.9
OR GATE from NAND GATE
8
5
CONCLUSION
So we have studied how logic gates work on the basis of Boolean algebra. Also using only some basic logic gates we can construct any other logic gate using its combination in a particular way. But to get a combinational logic gate most efficiently we should use the axioms and theorems of Boolean algebra. Input of a gate can be more than 2 for example we can have a four inputs AND Gate or three inputs AND Gate. The output of one logic gate can be used as the input to another logic gate or several logic gates depending upon or choice of combinational gate structure.
6
REFERENCE
1. V K MEHTA PRINCIPLE OF ELECTRONICS 2. A textbook on ELECTRONICS by Basudev Ghosh 3. PRACTICAL BOOK GEETA SANON
9
