Chapter 3 Gate Level Minimization1
Chapter 3 Gate Level Minimization1
Note:
Karnaugh map steps
1. Two variable k-map
n = 2 means 22 => 4 squares or cells (4 minterms)
3
AB A+B
2. Three variable K-map
3 variables means 23 => 8 squares
or cells (minterms)
Note: The minterms are arranged,
not according to the binary
sequence, rather they are arranged
so that the change between two
consecutive rows or columns is only
one single variable; changes its logic
value from 0 to 1 or from 1 to 0. Note: The map can be constructed with
different order, like B as row and A&C as
columns, but with the same mis.
Map method
f = a’b + ab’
Map method
f = ac’ + bc
Map method
f = c + a’b
3. 4 variable k-map
4 variables, 24 => 16 squares or minterms
When two adjacent squares are combined, it is called a
pair and represents a term with three literals.
Four adjacent squares, when combined, are called a
quad and its number of literals is two.
If eight adjacent squares are combined, it is called an
octet and represents a term with one literal.
If all sixteen squares can be combined, the function will
be reduced to 1.
Eg: f(a,b,c,d) = Σ (1,3,5,6,7,12,13,14,15)
0
f’ f
1
X
Note:
A B C D Y CD
0 0 0 0 0 00 01 11 10
0 0 0 1 0 AB
0
0
0
0
1
1
0
1
0
0
00
0 1 0 0 0 01 1
0 1 0 1 0
0 1 1 0 0 11 x x x x
0
1
1
0
1
0
1
0
1
1
10 1 1 x x
1 0 0 1 1
Without “don’t care”
1 0 1 0 X
Y AB C A BCD
1 0 1 1 X
1 1 0 0 X
With “don’t care”
1 1 0 1 X Y A BCD
1 1 1 0 X
1 1 1 1 X