Chapter 3

Penyederhanaan Fungsi/Gerbang
Logika
Penyederhanaan fungsi/gerbang
logika dapat dilakukan dengan :
Penyederhanaan langsung dari
ungkapan Boole
Karnaugh Map (K-Map)
Review Gerbang Logika

Penyederhanaan Langsung
Teorema Boole
Karnaugh Maps (K-Map)
sebuah representasi grafik dari
sebuah fungsi logika tabel kebenaran
yang dapat digunakan untuk
menyederhanakan fungsi tersebut
K-map berisi semua kemungkinan
logika dari sistem logika yang
dirangkai dalam bentuk tabel

Hubungan Tabel kebenaran dengan K-map
(dua variabel)
A A
B
B
A
B
0
1
2
3
pos A B F
0 0 0 F0
1 0 1 F1
2 1 0 F2
3 1 1 F3
Tabel kebenaran K-map
Contoh :
Buatlah penyederhanaan u/ fungsi
F=A.B+A.B dengan menggunakan
cara K-map


Penyelesaian
1. Buatlah kotak dgn 4
keluaran (22 =4)
2. Tentukan sel keluaran
yang bernilai logika 1
3. Sel bernilai 1 adalah
sel pada koordinat A.B
dan koordinat A.B spt
gambar disamping
sedangkan (sel yang lain
boleh dibiarkan kosong
atau diberi nilai 0)
A A
B
B
A
B
1
1
0
0
Penyelesaian (2)
A A
B
B
A
B
4. Kelompokkan sel yang
bernilai 1 yang berdekatan spt
gambar disamping
5. Dlm kelompok tersebut
yaitu A tidak berubah, tetap
benilai 1, tetapi B dapat
bernilai 0 atau 1
Sehingga keluaran diatas
dapat disederhanakan menjadi
F=A.B+A.B = A
6. Uji jawaban dengan tebel
kebenaran.
1
1
0
0
1


1
Tabel Kebenaran F = A.B + A.B
pos A B B A.B A.B F=A.B
+A.B
0 0 0 1 0 0 0
1 0 1 0 0 0 0
2 1 0 1 1 0 1
3 1 1 0 0 1 1
F = A.B + A.B
F = A
K-Map tiga-masukan 8 kombinasi
A 0 0 1 1
B 0 1 1 0
C=0
C=1
0
m
1
m
2
m
3
m
6
m
7
m
4
m
5
m
pos A B C F
m0 0 0 0 X
m1 0 0 1 X
m2 0 1 0 X
m3 0 1 1 X
M4 1 0 0 X
m5 1 0 1 X
m6 1 1 0 X
m7 1 1 1 x
A A A A
C
C
B B B B
0
m
2
m
6
m
4
m
1
m
3
m
7
m
5
m
Misal suatu ungkapan Boole sbb:
F = ABC+ABC+ABC+ABC
Maka pada K-Map logika 1 ditempatkan pada sel-sel sesuai
ungkapan berikut :
ABC A=0, B=1, C=0 m2, ABC A=0, B=1, C=0 m3
ABC A=1, B=0, C=0 m4, ABC A=1, B=0, C=1 m5

A 0 0 1 1
B 0 1 1 0
C=0
C=1
1 1
1 1
Soal
Buatlah penyederhanaan u/ fungsi
F=ABC+ABC+ABC+ABC dengan
menggunakan cara K-map


Penyelesaian
1. Dari F=ABC+ABC+ABC+ABC
tentukan sel-sel yang berlogika 1
pada K-Map
A 0 0 1 1
B 0 1 1 0
C=0
C=1
1
1
1
1
Penyelesaian
2. Kelompokkan
A 0 0 1 1
B 0 1 1 0
C=0
C=1
1 1
1
1
1

1
1

1
F = AB+AB
Penyelesaian
3. Perluas pengelompokan
A 0 0 1 1
B 0 1 1 0
C=0
C=1
1
1 1
1 1

Nilai A dan C akan berubah jika kita bergerak dari
dari satu sel ke sel lain dengan masukan B tetap.
Nilai A dan C tidak berpengaruh pada keluaran yang
hanya merufakan fungsi dari B
Sehingga F = B
Buktikan dengan Tabel Kebenaran!
K-Map dengan 4 masukan
AB
CD
00 01 11 10
00
01
11
10
0
m
1
m
2
m
3
m
6
m
7
m
4
m
5
m
12
m
13
m
14
m
15
m
10
m
11
m
8
m
9
m
Four-variable K-Map
W X Y Z F
WXYZ
0 0 0 0 0 X
1 0 0 0 1 X
2 0 0 1 0 X
3 0 0 1 1 X
4 0 1 0 0 X
5 0 1 0 1 X
6 0 1 1 0 X
7 0 1 1 1 X
8 1 0 0 0 X
9 1 0 0 1 X
10 1 0 1 0 X
11 1 0 1 1 X
12 1 1 0 0 X
13 1 1 0 1 X
14 1 1 1 0 X
15 1 1 1 1 X
V
0 1 3 2
4 5 7 6
12 13 15 14
8 9 11 10
X W
X W
X W
X W
Z Y Z Y Z Y Z Y
Four-variable K-Map
ab
cd
00 01 11 10
00
01
11
10
Edges are adjacent
E
d
g
e
s

a
r
e

a
d
j
a
c
e
n
t

Plotting Functions on the
K-map
SOP Form
Canonical SOP Form
Three Variable Example


F ABC ABC ABC ABC
using shorthand notation
6 3 1 5
F m m m m

, , 1, 3, 5, 6 F A B C m

Three-Variable K-Map Example

ab
c
00 01 11 10
0
1

, , 1, 3, 5, 6 F a b c m

Plot 1s (minterms) of switching function

1 1
1
1
Three-Variable K-Map Example
ab
c
00 01 11 10
0
1

, , F a b c ab bc
Plot 1s (minterms) of switching function
1 1
1
1
ab
bc
Four-variable K-Map Example
ab
cd
00 01 11 10
00
01
11
10

, , , 0, 2, 9,12,14 F a b c d m

1
1
1
1
1
Karnaugh Maps (K-Map)
Simplification of Switching Functions
using K-MAPS
Terminology/Definition
Literal
A variable or its complement
Logically adjacent terms
Two minterms are logically adjacent if
they differ in only one variable position
Ex:
abc
abc
and
m6 and m2 are logically adjacent
Note:

abc abc a a bc bc
Or, logically adjacent terms can be combined
Terminology/Definition
Implicant
Product term that could be used to cover
minterms of a function
Prime Implicant
An implicant that is not part of another
implicant
Essential Prime Implicant
An implicant that covers at least one minterm
that is not contained in another prime
implicant
Cover
A minterm that has been used in at least one
group


Guidelines for Simplifying Functions
Each square on a K-map of n
variables has n logically adjacent
squares. (i.e. differing in exactly
one variable)
When combing squares, always
group in powers of 2
m
, where
m=0,1,2,.
In general, grouping 2
m
variables
eliminates m variables.

Guidelines for Simplifying Functions
Group as many squares as possible.
This eliminates the most variables.
Make as few groups as possible.
Each group represents a separate
product term.
You must cover each minterm at
least once. However, it may be
covered more than once.

K-map Simplification Procedure
Plot the K-map
Circle all prime implicants on the K-
map
Identify and select all essential
prime implicants for the cover.
Select a minimum subset of the
remaining prime implicants to
complete the cover.
Read the K-map
Example
Use a K-Map to simplify the
following Boolean expression

, , 1, 2, 3, 5, 6 F a b c m

Three-Variable K-Map Example

ab
c
00 01 11 10
0
1
Step 1: Plot the K-map
1
1
1
1

, , 1, 2, 3, 5, 6 F a b c m

1
Three-Variable K-Map Example
ab
c
00 01 11 10
0
1
Step 2: Circle ALL Prime Implicants
1
1
1
1

, , 1, 2, 3, 5, 6 F a b c m

1
Three-Variable K-Map Example
ab
c
00 01 11 10
0
1
Step 3: Identify Essential Prime Implicants
1
1
1
1

, , 1, 2, 3, 5, 6 F a b c m

1
EPI
EPI
PI
PI
Three-Variable K-Map Example
ab
c
00 01 11 10
0
1
Step 4: Select minimum subset of remaining
Prime Implicants to complete the cover.
1
1
1
1

, , 1, 2, 3, 5, 6 F a b c m

1
EPI
PI
EPI
Three-Variable K-Map Example
ab
c
00 01 11 10
0
1
Step 5: Read the map.
1
1
1
1

, , 1, 2, 3, 5, 6 F a b c m

1
bc
ab
bc
Solution

, , F a b c ab bc bc ab b c
Example
Use a K-Map to simplify the
following Boolean expression

, , 2, 3, 6, 7 F a b c m

Three-Variable K-Map Example

ab
c
00 01 11 10
0
1
Step 1: Plot the K-map
1 1
1 1

, , 2, 4, 5, 7 F a b c m

Three-Variable K-Map Example

ab
c
00 01 11 10
0
1
Step 2: Circle Prime Implicants
1
1
1 1

, , 2, 3, 6, 7 F a b c m

Wrong!!
We really
should draw
A circle around
all four 1s
Three-Variable K-Map Example
ab
c
00 01 11 10
0
1
Step 3: Identify Essential Prime Implicants
EPI
EPI

, , 2, 3, 6, 7 F a b c m

1
1
1 1
Wrong!!
We really
should draw
A circle around
all four 1s
Three-Variable K-Map Example
ab
c
00 01 11 10
0
1
Step 4: Select Remaining Prime Implicants to
complete the cover.
EPI
EPI
1
1
1 1

, , 2, 3, 6, 7 F a b c m

Three-Variable K-Map Example

ab
c
00 01 11 10
0
1
Step 5: Read the map.
ab
ab
1
1
1 1

, , 2, 3, 6, 7 F a b c m

Solution

, , F a b c ab ab b
Since we can still simplify the function
this means we did not use the largest
possible groupings.
Three-Variable K-Map Example
ab
c
00 01 11 10
0
1
Step 2: Circle Prime Implicants
1
1
1 1

, , 2, 3, 6, 7 F a b c m

Right!
Three-Variable K-Map Example
ab
c
00 01 11 10
0
1
Step 3: Identify Essential Prime Implicants
EPI

, , 2, 3, 6, 7 F a b c m

1
1
1 1
Three-Variable K-Map Example
ab
c
00 01 11 10
0
1
Step 5: Read the map.
b
1
1
1 1

, , 2, 3, 6, 7 F a b c m

Solution

, , F a b c b
Special Cases
Three-Variable K-Map Example
ab
c
00 01 11 10
0
1
1
1
1
1

, , 1 F a b c
1 1
1
1
Three-Variable K-Map Example
ab
c
00 01 11 10
0
1

, , 0 F a b c
Three-Variable K-Map Example
ab
c
00 01 11 10
0
1
1

, , F a b c a b c
1
1
1
Four Variable Examples
Example
Use a K-Map to simplify the
following Boolean expression

, , , 0, 2, 3, 6, 8,12,13,15 F a b c d m

Four-variable K-Map
ab
cd
00 01 11 10
00
01
11
10

, , , 0, 2, 3, 6, 8,12,13,15 F a b c d m

1
1
1
1
1 1
1
1
Four-variable K-Map
ab
cd
00 01 11 10
00
01
11
10

0, 2, 3, 6, 8,12,13,15 F m

1
1
1
1
1 1
1
1
Four-variable K-Map
ab
cd
00 01 11 10
00
01
11
10
F abd abc acd abd acd
1
1
1
1
1 1
1
1
Example
Use a K-Map to simplify the
following Boolean expression


, , , 0, 2, 6, 8,12,13,15
3, 9,10
F a b c d m
d

D=Dont care (i.e. either 1 or 0)

Four-variable K-Map
ab
cd
00 01 11 10
00
01
11
10
1
1
d
1
1 1
1
1

, , , 0, 2, 6, 8,12,13,15 3, 4, 9 F a b c d m d

d
d
Four-variable K-Map
ab
cd
00 01 11 10
00
01
11
10
1
1
d
1
1 1
1
1
F ac ad abd
d
d
Five Variable K-Maps

, , , , F a b c d e
Five variable K-map
A=1
A=0
Use two four variable K-maps
Use Two Four-variable K-Maps
bc
de
00 01 11 10
00
01
11
10
bc
de
00 01 11 10
00
01
11
10
A=0 map A=1 map
Five variable example

, , , , 5, 7,13,15, 21, 23, 29, 31 F a b c d e m

Use Two Four-variable K-Maps

bc
de
00 01 11 10
00
01
11
10
bc
de
00 01 11 10
00
01
11
10
A=0 map A=1 map

, , , , 5, 7,13,15, 21, 23, 29, 31 F a b c d e m

1
1
1
1
1
1
1
1
Use Two Four-variable K-Maps
bc
de
00 01 11 10
00
01
11
10
bc
de
00 01 11 10
00
01
11
10
A=0 map A=1 map
1
1
1
1
1
1
1
1

1
F a ce
2
F a ce
Five variable example

1 2
F F F a ce a ce ce
Plotting POS Functions
K-map Simplification Procedure
Plot the K-map for the function F
Circle all prime implicants on the K-map
Identify and select all essential prime
implicants for the cover.
Select a minimum subset of the
remaining prime implicants to complete
the cover.
Read the K-map
Use DeMorgans theorem to convert F to F
in POS form
Example
Use a K-Map to simplify the
following Boolean expression

, , 1, 2, 3, 5, 6 F a b c M

Three-Variable K-Map Example

ab
c
00 01 11 10
0
1
Step 1: Plot the K-map of F
1
1
1
1 1

, , 1, 2, 3, 5, 6 F a b c M

Three-Variable K-Map Example

ab
c
00 01 11 10
0
1
Step 2: Circle ALL Prime Implicants
1
1
1
1 1
Three-Variable K-Map Example
ab
c
00 01 11 10
0
1
Step 3: Identify Essential Prime Implicants
1
1
1
1 1
EPI
EPI
PI
PI
Three-Variable K-Map Example
ab
c
00 01 11 10
0
1
Step 4: Select minimum subset of remaining
Prime Implicants to complete the cover.
1
1
1
1 1
EPI
PI
EPI
Three-Variable K-Map Example
ab
c
00 01 11 10
0
1
Step 5: Read the map.
1
1
1
1 1
bc
ab
bc
Solution

F ab bc bc
F ab bc bc
a b b c b c




, , 1, 2, 3, 5, 6 F a b c M

TPS Quiz