[go: up one dir, main page]

0% found this document useful (0 votes)
43 views21 pages

Physics Project Final

The document provides an overview of logic gates, including their definitions, types, and applications in digital circuits. It explains Boolean algebra, truth tables, and the construction of basic gates such as AND, OR, NOT, NAND, NOR, XOR, and XNOR. Additionally, it discusses the practical applications of these gates in electronics and concludes with their significance in modern technology.

Uploaded by

Sasi vijay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
43 views21 pages

Physics Project Final

The document provides an overview of logic gates, including their definitions, types, and applications in digital circuits. It explains Boolean algebra, truth tables, and the construction of basic gates such as AND, OR, NOT, NAND, NOR, XOR, and XNOR. Additionally, it discusses the practical applications of these gates in electronics and concludes with their significance in modern technology.

Uploaded by

Sasi vijay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 21

INTRODUCTION

GATE
A logic gate is either an idealized model of computation or a physical electronic
device that performs a Boolean function, which is a logical operation performed
on a single binary output from a set of binary inputs.

TRUTH TABLE
A truth table shows how a logic circuit's output responds to various combinations
of the inputs, using logic 1 for true and logic 0 for false. All permutations of the
inputs are listed on the left, and the output of the circuit is listed on the right.

BOOLEN ALGEBRA
Boolean algebra is the category of algebra in which the variable's values are the
truth values, true and false, ordinarily denoted 1 and 0 respectively. It is used to
analyse and simplify digital circuits or digital gates. It is also called Binary
Algebra or logical Algebra.

BOOLEN EXPRESSION
A logical statement that results in a Boolean value, either be True or False, is a
Boolean expression. Sometimes, synonyms are used to express the statement
such as 'Yes' for 'True' and 'No' for 'False'. Also, 1 and 0 are used for digital
circuits for True and False, respectively.

1
PRINCIPLE
Any Boolean algebraic operation can be associated with the input and output,
which represents the statement of Boolean algebra. Although these circuits may
be complex, they may all be constructed from three basic.

Devices like a P.N Junction diode, a resistance and an N.P N transistor.

We have three different type of logic gates and they are the AND gate, the OR
gate and the NOT gate.

LOGICAL STATEMENTS

1 0

High Low

On Off

Close Open

Conduction Non-Conduction

Right Wrong

True False

Yes No

2
BASIC GATES
The OR Gate: - It is a device that combines A and B to give Y as the result. The
OR gate has two or more inputs and one output. In Boolean algebra, addition
symbol (+) is referred as the OR.

The Boolean expression: A+B=Y

This indicates that Y equals to A or B

The And Gate: - It is a device that combines A with B to give Y as the result.
The AND gate has two or more inputs and one output. In Boolean algebra,
multiplication sign is referred as the And.

The Boolean expression: AB=Y or A X B=Y

This indicates that Y equals to A and B.

The NOT Gate: It is a device that invents the inputs. The NOT has one input and
has one output. In Boolean algebra, har symbol is referred as the Not.

3
The Boolean expression:

The increase that Y is not equal to A

Making of logic gates was started by binary numbers.

Logic gates can also store information

The basic logic gates are classified into seven types:

 AND gate
 OR gate
 XOR gate
 NAND gate
 NOR gate
 XNOR gate
 NOT gate

The truth table is used to show the logic gate function. All the logic gates have
two inputs except the NOT gate, which has only one input.

A Logic gate is a kind of the basic building block of a digital circuit having two
inputs and one output. The input and output relationship are based on a certain
logic. These gates are implemented using electronic switches such as diodes,
transistors.

4
The OR Gate
Aim:
To design and stimulate the OR gate circuit.

Components:
Two ideal p-n junction diode D1 and D2

Theory and Construction:


An OR gate can be realized by the electronic circuit, making use of two diodes
D1 and D2

Hear the negative terminal of the battery is grounded and corresponds to the)
level, and the positive terminal of the battery corresponds to level. The output Y
is voltage at C with respect to earth.

5
The following conclusion can be drawn from the above circuit:

(i) If the switch A and B are kept open (A=1, B=0), then bulb does not
glow, hence Y=0
(ii) If switch A is kept closed and B is kept open (A=1, B=0), then bulb
does not glow, hence Y=0
(iii) If switch A is kept open and B is kept closed (A=0, B=1), then bulb
does not glow, hence Y=0
(iv) If switch A and B both are kept closed (A=1, B=1), then bulb glows,
hence Y=1

TRUTH TABLE:

INPUT A INPUT B OUTPUT

0 0 0

0 1 0

1 0 0

1 1 1

6
The AND Gate Aim:
To design and stimulate the and gate circuit.

Components:
Two ideal p-n junction diode (D1 and D2) and resistance R.

Theory and Construction:


An AND gate can be realized by the electronic circuit, making use of two diodes
D1 and D2. The resistance R is connected to the positive terminal of a 5V battery
permanently.

Here the negative terminal of the battery is grounded and corresponds to the 0
level, and the positive terminal of the battery corresponds to the level 1. The
output Y is voltage at C with respect to earth.

7
The following conclusion can be easily drawn from the working of this circuit:

(i) If the switch A and B are kept open (A=0, B=0), then bulb does
not glow, hence Y=0.
(ii) If switch A is kept closed and B is kept open (A=1, B=0), then
bulb does not glow, hence Y=0
(iii) If switch A is kept open and B is kept closed (A=0, B=1), then
bulb does not glow, hence Y=0.
(iv) If both switch A and B are kept closed (A=1, B=1), then bulb
glows, hence Y=1

TRUTH TABLE:

INPUT A INPUT B OUTPUT

0 0 0

0 1 0

1 0 0

1 1 1

8
The NOT Gate
Aim:
To design and stimulate the not gate circuit.

Components:
An ideal n-p-n transistor.

Theory and Construction:


A NOT gate cannot be realized by using diodes. However, an electric circuit of
NOT gate can be realize by making use a n-p-n transistor.

The base of the transistor is connected to the input A through a resistance Rb and
the emitter is earthed.

The collector is connected to 5V battery. The output Y is voltage at C with


respect to earth.

9
The following inference can be easily drawn from the working of circuit.

(i) If the switch A is kept open (A=0) then bulb glows, hence Y=1
(ii) If the switch A is kept closed (A=1) then bulb does not glow, hence Y=0

TRUTH TABLE:

INPUT A OUTPUT Y

0 1

1 0

The NOT gate is an electronic circuit that produces an inverted version of


the input at its output. It is also known as an inverter.

If the input variable is A, the inverted output is known as NOT A.

10
The NOR Gate Aim:
To design and stimulate the not gate circuit.

Component:
Two ideal p-n junction diode (D1 and D2)

Theory and Construction:


If we connect the output Y of OR gate to the input of a NOT gate, then the gate
obtained is the NOR gate. The output Y is voltage at C with respect to earth.

In Boolean expression, the NAND gate is expressed as:

A NOR gate is a digital logic gate that gives an output of 0 when any of its inputs
are 1, otherwise 1. NOR gates can be made to produce a variety of logic gates,
including OR and AND gates. The output of the NOR gate is a logic 0 as long
as the input voltage is below the threshold.

11
The following inference can be easily drawn from the working of circuit:

(i) If the switch A and B are kept closed (A=0, B=0) then bulb glows,
hence Y=1
(ii) If the switch A is kept open and B is kept closed (A=0, B=1), then bulb
glows, then bulb glows, hence Y=1
(iii) If switch A is kept closed and B is kept open (A=1, B=0), then bulb
glows, hence=1
(iv) If both switch A and B are kept closed (A=1, B=1) then bulb does not
glow, hence Y=0.

TRUTH TABLE:

Input A Input B OUTPUT

0 0 1

0 1 1

1 0 1

1 1 0

Its Boolean expression is denoted by a plus sign, (+) with a line or Overline,
(‾‾) over the expression to signify the NOT or logical negation of the NOR
gate giving us the Boolean expression of: A+B = Q.

12
THE NAND GATE
Aim
To design and stimulate the NAND gate circuit

Components
Two ideal p-n junction diode (d1 and d2)

A resistance r

An ideal n-p-n transistor

Theory and construction


If we connect the output of the and gate to the input of a not gate then the
gate obtained is the nand gate. The output y is voltage at c with respect to
earth.

The Boolean expression given for a NAND gate is that of logical addition
and it is opposite to AND gate. The Boolean expression is given by a single
dot (.) with an overline over the expression to show the NOT or the
logical negation of the NAND gate.

13
THE EX-OR GATE
Aim
To design and stimulate the ex-or gate circuit

Components
1)Two and gate

2)An or gate

3)Two not gate

Theory and construction


The operation EX-OR check for the exclusivity in the value of the two signals A
and B. It means if a and b are not identical, then output y=0. This operation is
also called exclusive OR gate designated EX-OR

14
THE EX-NOR GATE
Aim
To design and stimulate the EX-NOR gate circuit

Components
1)Two AND gates

2)And OR gate

3)Three Not gates

Theory and Components


The operation EX-NOR checks for the exclusively in the value of the two
signals. A and B it means if A and B are not identical, the output Y=0 and if both
are identical then the output Y=1. This operation is also called exclusive NOR
gate designated
EX-NOR

EX-NOR (Exclusive NOR) Gate


For a 2-input Ex-NOR gate, the output Q is true if both input A and input B are
the same, either true or false, giving the Boolean Expression of: (Q = (A and B)
or (NOT A and NOT B)).

15
SOME COMMON APPLICATIONS OF LOGIC GATES
During the course of discussion about various digital logic gates, we have mainly
discussed about the design, property and operation of them. In this article we
will look at various applications of logic gates. Their applications are determined
mainly based upon their truth table i.e., their mode of operations. In the following
discussion we will look at the applications of basic logic gates as well as many
other normal logic gates as well.

Application of OR gate:
Wherever the occurrence of any one or more than one event is needed to be
detected or some actions are to be taken after their occurrence, in all those cases
OR gates can be used. It can be explained with an example. Suppose in an
industrial plant if one or more than one parameter exceeds the safe value, some
protective measure is needed to be done. In that case OR gate is used.

16
Application of AND gate:
There are mainly two applications of AND gate as Enable gate and Inhibit gate.
Enable gate means allowance of data through a channel and Inhibit gate is just
the reverse of that process i.e., disallowance of data through a channel.

Application of NOT gate:

NOT gates are also known as inverter because they invert the output given to
them and show the reverse result. Now the CMOS inverters are commonly used
to build square wave oscillators which are used for generating clock signals. The
advantage of using these is they consume low power and their interfacing is very
easy compared to other logic gates.

17
OBJECTIVE:
To design an appropriate logic gate combination for a given truth table.

MATERIALS REQUIRED:
A battery of 6V, two switches, torch bulb, connecting wires.

PROCEDURE:
1. Write product term for each input (minterm). Combination where Boolean
function has output.

2. While writing minterm, complement that variable whose value is 0 otherwise


write it in direct form (without complement).

3. Add all the minterms to obtain the Boolean function.

4. Draw the circuit using BASIC LOGIC GATES.

WORKING:
Logic circuit of F(x,y) = x.y + x.y

18
TRUTH TABLE:

X Y F minterm

0 0 1

0 1 0

1 0 0

1 1 1

APPLICATIONS:
• Used in multiplexers, Arithmetic Logic Units and Computer Memory Devices.

• Used in Microprocessors.

• Used in digital products like mobile phones, Laptops, etc.

RESULT:
A Logic Gate is prepared from the given truth table.

19
CONCLUSION:
Logic gates are an important concept if you are studying electronics. These are
important digital devices that are mainly based on the Boolean function. Logic
gates are used to carry out logical operations on single or multiple binary inputs
and give one binary output.

Logic gates are used to develop many IC circuit or microchips in today’s modern
world.

Nand gate and nor gate are known as universal gates because we can construct
all the three basic gates using nand and nor gates.

Without logic gates, electronic world would be nearly incomplete.

20
BIBLIOGRAPHY
https://www.google.com/search?q=BOOLEAN+EXPRESION+FOR+EXNOR
&oq=BOOLEAN+EXPRESION+FOR+EX-
NOR&aqs=chrome..69i57j0i13i512j0i22i30j0i390l2.10881j0j7&sourceid=chro
me
&ie=UTF-8

https://www.google.com/search?q=boolean+expresion+for+nor+gate&oq=bool
ean
+expresion+for+nor+gate&aqs=chrome..69i57j0i13i512j0i22i30l8.20823j0j7&
sou rceid=chrome&ie=UTF-8

https://www.google.com/search?q=BOOLEAN+EXPRESSION+NAND+EXP
RES
SION&oq=BOOLEAN+EXPRESSION+NAND+EXPRESSION&aqs=chrome
..69
i57j33i160l2.10320j0j7&sourceid=chrome&ie=UTF-8

https://www.google.com/search?q=LOGIC+GATES+TOPIC&sxsrf=ALiCzsb
S4o
FFWI0HFIt717A14jBAQahlcg:1664952770385&source=lnms&tbm=isch&sa
=X&
ved=2ahUKEwjG9sizwMj6AhXpRmwGHe90DrAQ_AUoAXoECAEQAw&b
iw= 1280&bih=913&dpr=1#imgrc=JMx1TSDvOYZJ6M

21

You might also like