CCR204 - Lec04
CCR204 - Lec04
ABC ABC
AB ABC C D D
4-2 Simplifying Logic Circuits
The circuits below both provide the same output, but
the lower one is clearly less complex.
Circuit that
produces a 1
output only for
the A = 0, B = 1
condition.
4-4 Designing Combinational Logic
Circuits
Each set of input conditions that is to produce a
1 output is implemented by a separate AND gate.
The AND outputs are ORed
OR to produce the final output.
4-4 Designing Combinational Logic
Circuits
Truth table for a 3-input circuit.
AND terms for each
case where output is 1.
4-4 Designing Combinational Logic
Circuits
Design a logic circuit with three inputs, A, B, and C.
Output to be HIGH only when a majority inputs are HIGH.
AND terms for each
Truth table. case where output is 1.
Implementing the
circuit after factoring:
Groups of 4 Groups of 8
(Quads) (Octets)
4-5 Karnaugh Map Method
When the largest possible groups have been
looped, only the common terms are placed
in the final expression.
Looping may also be wrapped between top,
bottom, and sides.
4-5 Karnaugh Map Method
Complete K map simplification process:
Construct the K map, place 1s as indicated in the truth table.
Loop 1s that are not adjacent to any other 1s.
Loop 1s that are in pairs.
Loop 1s in octets even if they have already been looped.
Loop quads that have one or more 1s not already looped.
Loop any pairs necessary to include 1st not already looped.
Form the OR sum of terms generated by each loop.
When a variable appears in both complemented and
uncomplemented form within a loop, that variable
is eliminated from the expression.