Scribd
Upload
33K views

Design An Appropriate Logic Gate Combination For A Given Truth Table

This document discusses logic gates and their use in digital electronics. It defines logic gates as digital circuits that allow or block signals based on input voltages. Truth tables show all possible input-output relationships. Boolean algebra uses logical operators like AND, OR, and NOT to represent these relationships. The basic logic gates - AND, OR, NOT, NAND, NOR, XOR - are described along with their truth tables and Boolean expressions. Combining these basic gates can represent any Boolean algebraic operation.

Uploaded by

Rajkumar A R
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
33K views

Design An Appropriate Logic Gate Combination For A Given Truth Table

This document discusses logic gates and their use in digital electronics. It defines logic gates as digital circuits that allow or block signals based on input voltages. Truth tables show all possible input-output relationships. Boolean algebra uses logical operators like AND, OR, and NOT to represent these relationships. The basic logic gates - AND, OR, NOT, NAND, NOR, XOR - are described along with their truth tables and Boolean expressions. Combining these basic gates can represent any Boolean algebraic operation.

Uploaded by

Rajkumar A R
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 12

VELAMMAL VIDYALAYA

PHYSICS PROJECT
ON

To design an appropriate logic gate combination for


a given truth table

SUBMITTED TO:
SUBMITTED BY:
INDEX
INTRODUCTION

GATE: A gate is defined as a digital circuit which follows some


logical relationship between the input and output voltages. It is
a digital circuit which either allows a signal to pass through or
stop it.
The logic gates are building blocks at digital electronics. They
are used in digital electronics to change one voltage level into
another according to some logic statement relating to them.

TRUTH TABLE: A logic gate may have one or more than one
inputs, but it has only one output. The relationship between the
possible values of input and output voltages are expressed in
the form of a table called truth table.
Truth table of a logic gate is a table that shows all the inputs
and outputs that are possible for the logic gates.

BOOLEAN ALGEBRA: The algebra which is based on binary


nature of the logic gates.
BOOLEAN EXPRESSION: They are the logical statement which
is followed by logic gates.

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 types of logic gates and they are

 The AND gate


 The OR gate and
 The NOT gate

LOGICAL STATEMENTS:
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: A . B = Y
This indicates that Y equals to A and B.
The NOT gate: It is a device that inverts the inputs. The NOT
gate has one input and has one output. In Boolean algebra,
bar symbol is referred as the NOT.

The Boolean expression: =Y


This indicates that Y equals to not A.
The NAND gate: A variation on the idea of the AND gate is
called the NAND gate. The word “NAND” is a verbal contraction
of the words NOT and AND. The output is "true" if any of the
inputs are "false".

The symbol is an AND gate with a small circle on the output to


illustrate this output signal inversion. This is also shown as (A.B)
with a bar over the top. The truth table for a NAND gate is, as
one might expect, exactly the opposite as that of an AND gate.
The NOR gate: As you might have suspected, the NOR gate is
an OR gate with its output inverted. Its output is "true" if both
inputs are "false". Otherwise, the output is "false".

The symbol is an OR gate with a small circle on the output. The


small circle represents inversion. This is also shown as (A+B)
with a bar over the top.
The XOR gate: The previous gates are all fairly direct
variations on three basic functions: AND, OR, and NOT. The XOR
gate, however, is something quite different.

The XOR (Exclusive-OR) gate’s output is "true" if either, but not


both, of the inputs are "true". The output is "false" if both
inputs are "false" or if both inputs are "true". Another way of
looking at this circuit is to observe that the output is "true" if
the inputs are different and “false if the inputs are the same.

An encircled plus sign (⊕) is used to show the XOR operation.


On the whole, it can be said as
AND: Output is “true” only if all inputs are “true”.

OR: Output is “true” if either or both inputs are “true”.

NOT: Output is inverted.

Buffer: Output is the same.

NAND: Output is “true” if either or both inputs are “false”.

NOR: Output is “true” only if all inputs are “false”.

XOR: Output is “true” if inputs are different.

XNOR: Output is “true” if inputs are the same.


 Making of logic gates was started by binary numbers.
 Logic gates can also store information.

You might also like