Welcome

Logic Circuitry and Organization

 Learning Objectives
On the successful completion of this session
student will be able to:
• Explain the different types of gates
• Draw the circuit for given Boolean expression
with the helps of logic gates
• Represent the Boolean function in the form of
truth table
 An Introduction to Logic Gates

• Information flows from one point to another

through the use of what are called Signals.
• In digital computers binary information is
represented by signals which are electrical in
nature where a high voltage is considered a 1
and a low voltage is considered a 0.
• Electronic circuits must be designed to
manipulate these pulses into meaningful logic.
 Digital Logic
• Logic gates are the building blocks of digital circuits.
• Combinations of logic gates form circuits designed with specific tasks in
mind.
• E.g. logic gates are combined to form circuits
o to add binary numbers (adders)
o set and reset bits of memory (flip flops)
o multiplex multiple inputs, etc.
• names, graphic symbols, algebraic functions (used to describe its
operation) and truth tables of 8 logic gates are presented.
• 3 basic logic gates exist, from which all others are derived and these
are the
• AND
• OR and
• NOT gates
 Categories of Logic Gates
• Logic Gates are divided into three categories:
– Basic Gates includes AND gate, OR gate, NOT gate
and buffer gate
– Universal Gates includes NAND gate and NOR gate
– Exclusive Gates includes X-OR and X-NOR gate
 NOT Gate
Graphic symbol Explanation
• The NOT gate has only one
input
• Inverts input to its opposite.
A X
• In other words, a low-
voltage input (0) is
converted to a high-voltage
output (1), and vice-versa.
A X • It's that simple!
0 1
1 0
 BUFFER GATE

• Graphic symbol Explanation

• Buffer gate does not perform any
logic operation.
• used to maintain the strength of the
signal.
A X • can be replaced by two inverters
connected in cascade.
Algebraic function
BUFFER gate truth table The function of buffer is X =A

A X
0 0
1 1
 AND GATE

• Graphic symbol • Explanation

• requires two inputs and has one output.
A • produces an output of 1 when BOTH the
X inputs are a 1, otherwise the output is 0.
B
Algebraic expression
X=A.B
or
x =AB

AND gate truth table

A B X
0 0 0
0 1 0
1 0 0
1 1 1
 NAND gate

• Graphic symbol • Explanation

• the combination of an AND and NOT gate gives rise
to a new gate called a NAND gate which comes from
A the abbreviation of NOT AND.
X • the NAND gate simply complements the AND gate as
B
indicated by the graphic symbol, which consists of
an AND graphic symbol followed by a small circle.

Algebraic expression
X = (AB)’
NAND
A gateBtruth table
X
0 0 1
0 1 1
1 0 1
1 1 0
 OR GATE

• Explanation
• Graphic symbol • The OR gate produces the inclusive-OR function.
• has two input lines and one output line.
A • if either or both of the inputs are a 1, the resulting
X output value is a 1.
B
• In our example, the output in only high (1) if either A is
high (1) or B is high (1) or both A as well as B are high (1).
• Algebraic function
• The algebraic symbol of the OR function is similar to the
mathematical + used for addition.
• X= A + B (i.e. x = A or B)
A B X • OR Gate Truth Table
0 0 0
0 1 1
1 0 1
1 1 1

Notice that the output is low (0) if both inputs are zeros (0).
 XOR GATE
• Explanation
• Graphic Symbol • The X in the XOR gate stands for
"exclusive."
A • i.e. the output from this gate will be a 1
X ONLY when one of the inputs is a 1 but
B not both inputs.
• Notice also that the output is a 0 if both
the inputs are 1 or if both inputs are 0.
• In other words, the output is high (1) only
of the inputs have different values.
+
A B X • Algebraic function
• X= A B
0 0 0
• Or
0 1 1
• X= A’B + AB’
1 0 1
1 1 0 • XOR Gate truth table
 NOR GATE

• Explanation
• Graphic symbol • The NOR gate is a complement of the OR
gate
A
X • Its output is always the complement of
B the OR gate.
• I.e. the output is high (1) if and only if
both input A and B are high (1s).
• Algebraic function
• The algebraic symbol of the OR function is
similar to the mathematical + used for
A B X addition.
0 0 1
• X= (A + B)’ (i.e. x = (A or B)’)
0 1 0
1 0 0
• NOR Gate Truth Table
1 1 0

Notice that the output is high (1) if both inputs

are zeros (0s).
 Exclusive-NOR GATE (XOR) (aka
“same” or “equivalence” gate)
• Explanation
• Graphic symbol • Exclusive – NOR is also known as XNOR or
equivalence. It is the complement of the exclusive –
OR gate.
A • it is called an even function where the output of
X the gate is High (logic 1) only if both inputs are high
B (1s) or both inputs are low (0s).
• Algebraic function
• The algebraic symbol of the OR function is similar
to the mathematical + used for addition.
A B X • X= (AB + A’B’)’ (i.e. x = AB or A’B’)
0 0 1 • XNOR Gate Truth Table
0 1 0
1 0 0
1 1 1

Notice that the output is high (1) if both inputs

have the same value i.e. both 0 or both 1.
Drawing the Circuit for given Boolean
expression
Please click on the picture below to play the
video
• F = A + BC

A
F
B
C
• F = A + BC’

A
F
B

C
• F = AB’C + ABC’
 Truth table
• A truth table is a mathematical table used in
logic—specifically in connection with Boolean
algebra, Boolean functions, and propositional
calculus—which sets out the functional values
of logical expressions on each of their
functional arguments, that is, for each
combination of values taken by their logical
variables.
 Truth Table Example
• Draw the truth table for function F where
F=A’BC’ + A’B’C’ + ABC
A B C A’BC’ A’B’C’ ABC F
0 0 0 0 1 0 1
0 0 1 0 0 0 0
0 1 0 1 0 0 1
0 1 1 0 0 0 0
1 0 0 0 0 0 0
1 0 1 0 0 0 0
1 1 0 0 0 0 0
1 1 1 0 0 1 1
A B X

Truth Table
0 0 0
0 1 1
1 0 1
1 1 1
A B X
• F = A + BC 0
0
0
1
0
0
1 0 0
A B C BC A + BC 1 1 1
0 0 0 0 0
0 0 1 0 0
0 1 0 0 0
0 1 1 1 1
1 0 0 0 1
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1
A B X
0 0 0
0
1
1
1
0
1
1
1
1
F=A’BC’ + A’B’C’ + ABC
A B C A’ B’ C’ BC’ A’BC’ B’C’ A’B’C’ B
C
ABC A’BC’ +
A’B’C’ F
0 0 0 1 1 1 0 0 1 1 0 0 1 1
0 0 1 1 1 0 0 0 0 0 0 0 0 0
0 1 0 1 0 1 1 1 0 0 0 0 1 1
0 1 1 1 0 0 0 0 0 0 1 0 0 0
1 0 0 0 1 1 0 0 1 0 0 0 0 0
1 0 1 0 1 0 0 0 0 0 0 0 0 0
1 1 0 0 0 1 1 0 0 0 0 0 0 0
1 1 1 0 0 0 0 0 0 0 1 1 0 1
 Summary

• logic gates can have multiple inputs as well.

• commonly used gates are the AND, OR, NOT, NAND and NOR
gates.
• facts worth noting about these logic gate families and these are: -
• AND, OR, NOT gates are called basic gates. This is simply because
we can create any logic gate or any Boolean expression by
combining them.
• NOR and NAND gates are known as universal gates as they have
the particular property that any one of them can create any
logical Boolean expression if designed in a proper way.
• XOR and XNOR gates are known as exclusive gates constructed by
using basic gates.
 Activities
1. How many universal gates are there, draw the gate along with the truth
table?
2. Identify the output of each gate in the form of Boolean expression from
the below given logic circuit:

AB + (AC)’

3. F (X, Y, Z) = X’Y’Z + XYZ’ + X’Y’Z’

i. Draw the truth table
ii. Draw the logic circuit
Thank you !