Logic Gates

&
It’s Application
Logic gates
• We send information through computers using
wires that represent 1s and 0s.

• Computers need a way to manipulate those 1s

and 0s, so that they can eventually do more
complicated operations like calculating the 50th
digit of π(pi).

• Computers use logic gates to transform the 1s

and 0s from input wires.

• A logic gate accepts inputs and then outputs a

result based on their state.
Logic gates …
• Logic gates are the basic building
blocks of any digital system.

• It is an electronic circuit having one

or more than one input and only one
output.

• The relationship between the input

and the output is based on a certain
logic.
Logic gates …
• They perform basic logical functions
that are fundamental to digital circuits.

• Most electronic devices we use today

will have some form of logic gates in
them.

• For example, logic gates can be used

in technologies such as smartphones,
tablets or within memory devices.
Logic gates …
• There are seven basic logic gates:
1) AND,
2) OR,
3) XOR,
4) NOT,
5) NAND,
6) NOR, and
7) XNOR.

• The AND gate is so named because, if 0 is

called "false" and 1 is called "true," the gate acts
in the same way as the logical "and" operator.
 AND Function
Text Description  Output Y is TRUE if inputs A AND B are
TRUE, else it is FALSE.

Logic Symbol  A
AND Y
B

INPUTS OUTPUT
A B Y
Truth Table  0 0 0
0 1 0
1 0 0
1 1 1
AND Gate Truth Table

AND Symbol
Boolean Expression 
Y = A x B = A • B = AB
 OR Function
Text Description  Output Y is TRUE if input A OR B is
TRUE, else it is FALSE.

A
Logic Symbol  OR Y
B

INPUTS OUTPUT
A B Y
0 0 0
Truth Table  0 1 1
1 0 1
1 1 1
OR Gate Truth Table

OR Symbol

Boolean Expression  Y = A + B
 NOT Function (inverter)
Text Description  Output Y is TRUE if input A is FALSE,
else it is FALSE. Y is the inverse of A.

Logic Symbol  A NOT Y

INPUT OUTPUT
A Y
0 1
Truth Table  1 0
NOT Gate Truth Table

NOT Alternative Notation

Bar
Boolean Expression  Y = A Y = A’
Y = !A
 NAND Function
Text Description  Output Y is FALSE if inputs A AND B
are TRUE, else it is TRUE.
A bubble is an inverter
A This is an AND Gate with an inverted output
Logic Symbol  NAND Y
B

INPUTS OUTPUT
A B Y
0 0 1
Truth Table  0 1 1
1 0 1
1 1 0
NAND Gate Truth Table

Boolean Expression  Y = A x B = AB
 NOR Function
Text Description  Output Y is FALSE if input A OR B is
TRUE, else it is TRUE.
A bubble is an inverter.
A This is an OR Gate with its output inverted.
Logic Symbol  NOR Y
B

INPUTS OUTPUT
A B Y
0 0 1
Truth Table  0 1 0
1 0 0
1 1 0
NOR Gate Truth Table

Boolean Expression  Y = A + B
Exclusive-OR Gate

XOR
X Y Z
X
Z 0 0 0
Y
0 1 1
Z = X ^ Y 1 0 1
xor(Z,X,Y)
1 1 0
Exclusive-NOR Gate

XNOR
X Y Z
Z 0 0 1
0 1 0
Z = ~(X ^ Y) 1 0 0
Z = X ~^ Y 1 1 1
xnor(Z,X,Y)
 Circuit-to-Truth Table Example
A
AND
B
OR Y
NOT

C
AND
A B C Y
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
2# of Inputs = # of Combinations 1 0 1
1 1 0
23 = 8 1 1 1
 Circuit-to-Truth Table Example
0 0
A
0 AND
B
0
OR Y
1
NOT 0
0 AND
C
A B C Y
0 0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
 Circuit-to-Truth Table Example
0 0
A
0 AND
B
1
OR Y
1
NOT 1
1 AND
C
A B C Y
0 0 0 0
0 0 1 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
 Circuit-to-Truth Table Example
0 0
A
1 AND
B
0
OR Y
1
NOT 0
0 AND
C
A B C Y
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
 Circuit-to-Truth Table Example
0 0
A
1 AND
B
1
OR Y
1
NOT 1
1 AND
C
A B C Y
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0
1 0 1
1 1 0
1 1 1
 Circuit-to-Truth Table Example
1 0
A
0 AND
B
0
OR Y
0
NOT 0
0 AND
C
A B C Y
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1
1 1 0
1 1 1
 Circuit-to-Truth Table Example
1 0
A
0 AND
B
0
OR Y
0
NOT 0
1 AND
C
A B C Y
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0
1 1 1
 Circuit-to-Truth Table Example
1 1
A
1 AND
B
1
OR Y
0
NOT 0
0 AND
C
A B C Y
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1
 Circuit-to-Truth Table Example
1 1
A
1 AND
B
1
OR Y
0
NOT 0
1 AND
C
A B C Y
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1
 Circuit-to-Boolean Equation
AB
A
AND
B

OR Y =AB + AC
A

}
NOT
AND
C
AC A B C Y
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1
 A - O - I Logic
A
AND
B

OR Y

NOT
AND
C

AND Gates
Other Logic Arrangements:
OR Gates NAND - NAND Logic
INVERTER Gates NOR - NOR Logic
 NAND Gate – Special Application

S NAND T

S T
0 1 A
1 0 NAND Y
B

INPUTS OUTPUT
A B Y
0 0 1
Equivalent To An Inverter Gate 0
1
1
0
1
1
1 1 0
 NOR Gate - Special Application
S NOR T

S T
0 1 A
1 0 B
NOR Y

INPUTS OUTPUT
A B Y
0 0 1
0 1 0
1 0 0
Equivalent To An Inverter Gate 1 1 0
NAND IMPLEMENTATION
NOR IMPLEMENTATION
Basic Boolean Identities
De Morgan’s Theorem

 The most important logic theorem for digital electronics, this

theorem says that any logical binary expression remains
unchanged if we
1) Change all variables to their complements.
2) Change all AND operations to ORs.
3) Change all OR operations to ANDs.
4) Take the complement of the entire expression.

 A practical operational way to look at DeMorgan's Theorem is

that the inversion bar of an expression may be broken at any
point and the operation at that point replaced by its opposite
(i.e., AND replaced by OR or vice versa).
De Morgan’s Theorem …
(i)Statement:
 The theorem states that the complement of sum of

variables is equal to the product of their individual

complements.
~(X | Y) = ~X & ~Y
De Morgan’s Theorem …
(ii)Statement:
 The theorem states that the complement of product of

variables is equal to the sum of their individual

complements.
~(X & Y) = ~X | ~Y
De Morgan’s Theorem …
 Another simple way of remembering the theorem is
‘Cut the line and change the sign’.

 De Morgan’s law is used to simplify the Boolean

expressions in digital circuits. De Morgan’s laws can
be applied to any number of variables.
 Some Examples
 Example: use algebraic simplification rules to reduce ~xyz+~xy~z+xz
~xyz + ~xy~z + xz = ~xy(z+~z)+xz (distributive law) =
~xy(1)+xz (inverse law) = ~xy+xz (identity law)

 Example: xy+~xz+yz = xy+~xz+yz*1 (identity) = xy+~xz+yz*(x+~x)

(inverse) = xy+~xz+xyz+~xyz (distributive) = xy(1+z)+~xz(y+1)
(distributive) = xy(1)+~xz(1) (null) = xy*1+~xz*1 (absorption)
= xy+~xz (identity)

 Example: (x+y)(~x+y) = ~x(x+y)+y(x+y) (distributive) = ~xx+~xy+xy+yy

(distributive)
= 0+~xy+xy+yy (inverse) = ~xy+xy+yy (identity) = y(~x+x+y) (distributive)
= y(1+y) (inverse) = y(1) (identity) = y (idempotent)
 Karnaugh Map (K map)
 Method for minimizing logic
 Is used to represent the values of a function for different input
values
 The rows and columns of the K-map correspond to the possible
values of the function's input
 Each cell in the K-map represents a minterm (i.e. a three
variables function has: x’y’z’, x’y’z, x’yz’, x’yz, xy’z’, xy’z, xyz’ and
xyz)
 Karnaugh Map (K map) # Rules
 No zeros allowed.
 Rectangular only.
 No diagonals.
 Only power of 2 number of cells in each group (i.e.
Made of 1,2,4,8,16,etc. no. of cells for grouping).
 Groups should be as large as possible.
 Every one must be in at least one group.
 Overlapping allowed.
 Wrap around allowed.
 Fewest number of groups possible.
K-map Example
 Let’s consider (xy’+yz)’ = x’y’ + x’z’ x y z x'y'+y'z'+yz'
+ yz’
0 0 0 1
 Group together the 1s in the map:
 g1: x’y’z’+x’y’z=x’y’(z’+z)=x’y’ 0 0 1 1
 g2: x’yz’+xyz’ = yz’(x’+x)=yz’ 0 1 0 1
 g3: x’yz’+x’y’z’=x’z’(y+y’)=x’z’ 0 1 1 0
 To derive a minimal expression we 1 0 0 0
must select the fewest groups that 1 0 1 0
cover all active minterms (1s).
 (xy’ + yz)’= x’y’ + yz’ 1 1 0 1
1 1 1 0