Professional Documents
Culture Documents
LOGIC GATES
(FOR PARTIAL FULLFILMENT OF AISSCE 2015)
PROJECT BY
MOHITH S | SURIYA E
JAWAHAR HIGHER SECONDARY SCHOOL (CBSE)
TOWN CLUB ROAD, BLOCK 17,
NEYVELI 607801
NAME
CLASS
SECTION
SUBJECT
REGISTRATION NUMBER :
This is to certify that the above mentioned student of class XII-D, Jawahar Higher Secondary
School (CBSE), Neyveli has completed the physics project during the academic year 2014-15
for AISSCE as prescribed by CBSE.
SUBMITTED ON
INTERNAL EXAMINER
PRINCIPAL
EXTERNAL EXAMINER
ACKNOWLEDGEMENT
WE ARE DEEPLY GRATEFUL TO THE FOLLOWING PERSONS AND FIRMS WHO PLAYED AN
IMPORTANT ROLE IN THE COMPLETION OF THIS PROJECT:
MRS. UMA MAHESWARI, OUR COMPUTER TEACHER WHO HELPED US IN THE FINER
CONCEPTS AND KEY DETAILS REGARDING LOGIC GATES AND CIRCUITS,
CONTENTS
1. INTRODUCTION..1
WHAT IS A LOGIC GATE?
HISTORY OF LOGIC GATES
RECENT DEVELOPMENTS
WHY A PROJECT ON LOGIC GATE?
2. OBJECTIVES.......................................................2
3. PRE-REQUISITES.......................................................................................................3
ELECTRONIC COMPONENTS
CONCEPTS
4. THEORY....................................................................................................................4
OPERATION OF SIMPLE GATES
TRUTH TABLES
BOOLEAN ALGEBRA BASICS
KARNAUGH MAP
5. OBSERVATIONS........................................................................................................8
CIRCUIT DIAGRAM
TRUTH TABLE
K-MAP ALGEBRAIC OPERATIONS
ALGEBRAIC PROOF
6. BIBLIOGRAPHY.........................................................................................................11
INTRODUCTION
Logic gates are physical devices which implements a Boolean function i.e. performs a logical
operation on one or more logical inputs and produce a single logical output.
They are referred to as digital logic circuits because the input and output signals are either low
voltage which denotes 0 or high voltage which denotes 1 and these gates are can be analyzed
with the help of Boolean algebra. Fundamentally, there are three types of logic gates namely,
AND gate, OR gate and NOT gate.
The invention of logic gates dates back to the discovery of binary number system by Gottfried
Wilhelm Leibniz in 1705.He established that by using the binary system, the principles of
arithmetic and logic could be combined. Another Mathematician Charles Sanders Peirce
described how logical operations could be carried out by electrical switching circuits.
Eventually, vacuum tubes replaced relays for logical operations. After many experiments and
observations made by logicians and mathematicians using the previous knowledge of Binary
number systems and electrical switching circuits, logic gates were developed to vast extent.
The invention of first electronic AND gate in 1924 marked the era of electronic logic circuits,
which paved way for the robust development of modern computers.
Due to the inevitable presence of logic circuits in most of the modern electronic devices these
days, logic gates have become an active arena of research. Scientists are involved in
developing molecular forms of logic gates, which can be incorporated in complex electronics,
thus minimizing the physical space required and to perform efficient multitasking processes in
future technologies yet to come. NISCAIR - CSIR, Govt. of India has also ignited its fruitful
research on molecular logic gates, so that the Indian made supercomputers and digital
technologies could meet the world class standards which can be used in vast area of research
such as space technology, defence, communications etc.,
Thus, we had chosen to take up a project on logic gates to illustrate its operations and to
describe its importance in electronics and computer industry today.
OBJECTIVES
OUR PRIMARY OBJECTIVES:
Construct a simple logic circuit using switches
Demonstrate the working of logic gates
Using Boolean algebra to reduce complex logic circuits
Using Karnaugh Map to reduce complex logic circuits
PRE-REQUISITES
ELECTRONIC COMPONENTS
S.NO
COMPONENTS
QUANTITY
Switch
LED
Solderless Breadboard
CONCEPTS
Series and parallel circuits
Logic gates
Boolean algebra
Karnaugh Map
Solderless Breadboard connections
THEORY
OPERATION OF SIMPLE GATES
1. AND gate
AND Gate is a logical gate having two or more input terminals and yields an output only
if both the input signals are 1 (high state).The AND operation is mathematically
represented as X.Y
2. OR gate
OR Gate is a logical gate having two or more input terminals and yields an output if
either of the input is 1 (high state).The OR operation is mathematically represented as
X+Y
3. NOT gate
NOT gate is a logical gate with only one input terminal and yields the output when the
input is 0 (low state).The NOT operation is mathematically represented as X or X.
TRUTH TABLES
1. AND gate
INPUT
(X)
1
INPUT
(Y)
0
OUTPUT
(X+Y)
0
INPUT
(X)
1
INPUT
(Y)
0
OUTPUT
(X+Y)
1
INPUT
(X)
1
INPUT
(Y)
0
OUTPUT
(X+Y)
0
2. OR gate
3. NOT gate
Principle of duality: This principle states that starting with a Boolean relation, another Boolean
relation can be derived by changing OR sign to AND sign, AND sign to OR sign or replacing each
0 by 1 and each 1 by 0.
1+X=1
0.X=0
1.X=X
Indempotence law:
X+X=X
X.X=X
Commutative law:
X+Y=Y+X
X.Y=Y.X
Associative law:
X+(Y+Z) = (X+Y)+Z
X(YZ)=(XY)Z
Distributive law:
X(Y+Z)=XY+XZ
X+YZ=(X+Y)(X+Z)
Involution law:
(X) = X
Absorption law:
X+ XY=X+Y
DeMorgans Theorems:
(X+Y)=XY
(X.Y)=X+Y
KARNAUGH MAP
Karnaugh Map (or K Map) is a graphical display of the fundamental products in a truth table.
It is a rectangular representation containing certain number of squares, each representing a
Maxterm or Minterm.
B
A
B (0)
B (1)
A
(0)
A
(1)
Maxterm: A Maxterm is a sum of all the literals (with or without complement) within the logic
system.
Minterm: A Minterm is a product of all the literals (with or without complement) within the
logic system.
OBSERVATIONS
CIRCUIT DIAGRAM
AB
A(B+C)
B+AC
B
C
B(B+C)
B
AC
A
C
B+AC
TRUTH TABLE
AC
B+AC
F (A,B,C) = m (2,3,5,6,7) is the equivalent Minterm expression for the above logical circuit.
BC
BC
BC
BC
A
4
BC
1
6
Expression = ABC+ABC+ABC+ABC+ABC
= BC+BC+ABC
= B+ABC
= B(B+B)+ABC
= BB+BB+ABC
(Distributive law)
= BB+B(B+AC)
= B+B(B+AC)
= B+B+AC
B+AC
ALGEBRAIC PROOF
AB+A(B+C)+B(B+C)
=AB+A(B+C)+B
=AB+AB+AC+B
=AB+AC+(AB+B)
=AB+AC+B
=(AB+B)+AC
=B+AC
BIBLIOGRAPHY
NCERT Class 12 Physics textbook
C.S. with C++ for Class 12 by Sumita Arora, Dhanpat Rai Publications.
Google (http://www.google.co.in)