EER-018
Introduction to Digital Computers
Lecture 5
K-map Simplification of switching functions
or Boolean equations
logical adjacency - when two
minterms differ only in one bit position
Karnaugh-map (K-map) - map where adjacent squares are
logically adjacent
- 2-variable - 4 squares, rather boring
- 3-variable map - each square represents a minterm with 3
literals.
- 4-variable map - corresponding squares at top and bottom are
adjacent. Corresponding squares on either side are adjacent.
Mapping functions
- find minterms of function and place ones in map at those minterms.
- use product of sum form or sum of product form to directly
fill in map
Grouping minterms - adjacent
minterms can be grouped in groups of 2^n. These groupings represent a product
term in the function with a reduced number of literals.
Minimization Procedure:.
Product of Sum Simplification
Don't care conditions