Académique Documents
Professionnel Documents
Culture Documents
Karnaugh Maps
Boolean reduction
can get involved.
leaves one wondering if the final result really is
the simplest solution.
Karnaugh Mapping is a
systematic approach guaranteeing the
simplest possible logic circuit.
can be done by hand for up to four inputs
Karnaugh Map
C C
B B
AB
A
AB
A
AB
AB
Four Variable Karnaugh Map
C D C D CD CD
AB
AB
AB
AB
Step 1: Find SOP Expression
X = ABC’ + A’B + C’ C
A’B’
already in sum of A’B’ 1 1
products form
A’B 1 1
Solution
Circle 1: A’ AB 1
Circle 2: BC’
AB’
X = A’+ BC’
Example:
Note overlap. C’ C
Single circle would result in A’ +
ABC’ which is not the simplest
solution. A’B’ 1 1
Recall A’ + AB = A’ + B
Here:
A’B 1 1
A’ + ABC’ = A’ + BC’ AB 1
Circle largest possible
number of ones. AB’
Example:
Z = B’C’D+BC’D+C’D’+CD’(B+A’B’)
Step 1: Expand to Sum of Products
Z = B’C’D+BC’D+C’D’+ BCD’ +A’B’CD’
Example:
Z = B’C’D+BC’D+C’D’+CD’B+A’B’CD’
Circle A’B’ 1 1 1
Group
of 8 A’B 1 1 1
AB 1 1 1
AB’ 1 1
Example:
Circle A’B’ 1 1 1
group of
four. A’B 1 1 1
Note that AB 1 1 1
the map
can wrap AB’ 1 1
around.
Example:
Z BC BD ACD
Relay Ladder Logic
b)
Simplified Ladder Diagram
Relay Ladder Logic
Given a ladder diagram, simplify the number
of contacts using boolean algebra
Relay Ladder Logic
Solution:
X ((( A B) ( B A)) ( B C B C )) C
X ((( A B) ( B A)) ( B C B C )) C
X BC C
X ( B 1)C
X C
Seatwork
1. From the given relay ladder
diagram, identify the
equivalent logic operation.
Seatwork
2. Write the equation that
will represent the ladder
operation and simplify
using Boolean rules and
Karnaugh map.