lts05 1
Aljabar Boolean memberikan dasar matematis untuk
merepresentasikan fungsi fungsi bervariabel biner (fungsi
logika biner, logika Boolean)
Fungsi logika biner :
Penyandian output : 7 1 1 1
input output
Sorang
x2 x1 x0 y1 y0
X
0 0 0 0 0 0
X<2 1 0 0 1 0 0
2 0 1 0 0 0
3 0 1 1 1 0
2< X < 4
4 1 0 0 1 0
5 1 0 1 0 1
4< X < 6
6 1 1 0 0 1
X=7 7 1 1 1 1 1
lts05
III.1 KAIDAH BOOLEAN
Operasi operasi dasar Boolean
Fungsi fungsi logika biner disusun berdasarkan
operasi operasi logika dasar (operator operator)
AND, OR dan NOT.
Operasi Operator
Penjumlahan logika OR
X0
Simbol gerbang OR : X1 F
XN-1
Tabel Kebenaran OR :
(Contoh : OR 2-input) Input Output
X1 X0 F
X0 0 0 0
F = X0 + X1
X1 0 1 1
1 0 1
1 1 1
lts05 8
Tabel Kebenaran OR 3-input
X0
F = X0 + X1+ X2 Input Output
X1
X2 X1 X0 F
X2
0 0 0 0
0 0 1 1
0 1 0 1
8 kombinasi 0 1 1 1
seluruh kemungkinan 1 0 0 1
kombinasi 3 var. biner 1 0 1 1
X , Y, Z 1 1 0 1
1 1 1 1
Tabel Kebenaran OR 4-input ?
Operasi AND (Perkalian logika)
X0
Simbol gerbang AND : X1
F
XN-1
Tabel Kebenaran AND :
(Contoh : AND 2-input) Input Output
X1 X0 F = X1 . X2
X0
F = X0 . X1 0 0 0
X1 0 1 0
1 0 0
1 1 1
lts05 10
AND 3-input : F=X.Y.Z
X
F = X .Y . Z input out
Y X Y Z F
Z
0 0 0 0
0 0 1 0
seluruh kemungkinan 0 1 0 0
kombinasi 3 var. biner 0 1 1 0
8 kombinasi
X , Y, Z 1 0 0 0
1 0 1 0
Jumlah kombinasi = 2n , 1 1 0 0
n = jumlah variabel
1 1 1 1
lts05 11
Identitas (persamaan dasar) Boolean
1. X + 0 = X 2. X 1 = X
dual
3. X + 1 = 1 4. X 0 = 0
5. X + X = X 6. X X = X
7. X + X = 1 8. X X = 0
9. (X ) = X
10. X + Y = Y + X 11. X Y = Y X
12. X + (Y+Z ) = (X+Y ) + Z 13. X (Y Z ) = (X Y ) Z
14. X.(Y + Z ) = XY + XZ 15. X + (YZ ) = (X +Y)(X + Z )
16. (X + Y ) = X Y 17. (X Y) = X + Y
18. X + X.Y = X + Y 19. X.(X + Y) = X.Y
lts05 12
Dual adalah pasangan suatu identitas
Commutative law: Urutan variabel tidak berpengaruh terhadap
hasil.
A . (B + C ) = (B + C ) . D A . A = 0
Identitas 16 : ( X + Y ) = X . Y
Identitas 17 : ( X . Y ) = X + Y
bentuk bentuk
AND OR
lts05 15
Aturan de Morgan memungkinkan ekivalensi gerbang logika
( X + Y ) = X . Y
X X
F = F
Y Y
X X
F = F
Y Y
( X . Y ) = X + Y
X X
F = F
Y Y
Perluasan aturan deMorgan untuk fungsi 3 variabel
(X + Y + Z ) = (X + (Y + Z )) menggunakan identitas 12
= X . (Y + Z ) menggunakan identitas 16
= X . (Y . Z ) menggunakan identitas 17
= X . Y . Z menggunakan identitas 13
(X .Y. Z) = (X . (Y . Z ))
identitas-identitas Boolean
= X + (Y . Z ) digunakan untuk mengubah-
ubah bentuk fungsi logika
= X + (Y + Z )
= X+Y +Z
lts05 17
(X + Y + Z ) = ( X + ( Y + Z ) )
= X . (Y + Z)
= X . (Y . Z )
= X.Y.Z
(X .Y. Z) = (X . (Y . Z ))
= X + (Y . Z)
= X + (Y + Z)
lts05
= X + Y + Z 18
Terapkan aturan de Morgan untuk ekspresi Boolean dibawah ini :
1. (AB+AB) = (A . B) . (A . B)
= (A + B) . (A + B)
= (A + B) . (A + B)
2. (X+Y+Z)
3. ((A+B+C)D)
4. ((ABC)+D+E)
5. (AB(C+D)+E)
Pembuktian Identitas Boolean :
(a) Dengan induksi-lengkap
Contoh :
X+0 = X
X Y X Y X . Y ( X + Y) (X + Y)
X X+0 0 0 1 1 1 0 1
0 0+0 0 0 1 1 0 0 1 0
1 0 0 1 0 1 0
1 1+0 1
1 1 0 0 0 1 0
sama sama
Terbukti X = X + 0 Terbukti X . Y = (X + Y)
lts05 20
(b) Pembuktian menggunakan identitas2 Boolean
Buktikan identitas X Y + Y Z + X Z = X Y + X Z
X Y + Y Z + X Z = X Y + (X + X) Y Z + X Z (7) X + X = 1
= X Y + X Y Z + X Y Z + X Z (14) (X+ X) YZ =
(14) (14) XYZ + XYZ
= X Y (1 + Z ) + X Z ( Y + 1 )
(3) (3) (3) (Y + 1) = 1
= XY.1 + X Z . 1
X Y + Y Z + X Z = XY + X Z terbukti !
lts05 21
Buktikan : 1) X + XY = X
= X(1 + Y) .......... id. 14 (distributive law)
= X . 1 ................id.3
= X .....................id.2
2) X + XY = X +Y
3) (X + Y)(X + Z) = X + YZ
III.2 Fungsi Logika & Tabel Kebenaran
Ekspresi (fungsi) Boolean
Ekspresi Boolean dapat dinyatakan dalam dua bentuk :
Contoh : F = AB + B C + A B C
Contoh : F = ( B + C ) . ( A + B + C )
lts05 24
Bentuk Kanonis
adalah bentuk SOP atau POS yang tiap sukunya
mengandung seluruh literal (variabel) input..
F(A,B,C) = A B C + A B C + A BC + A BC + A B C
F(A,B,C) = ( A + B + C ) . ( A + B + C ) . ( A + B + C)
f(A,B,C) = A B + A C + A C
= A B (C + C) + A (B + B) C + A (B + B) C
= m7 + m6 + m 3 + m1 + m4
= m(1, 3, 4, 6, 7)
Bentuk Kanonis
Contoh : Bentuk Non-kanonis
f(A,B,C) = A B + A C + A C
= (A + B + C)(A + B + C)(A + B + C)
= M0 M2 M5
= M(0, 2, 5)
Bentuk Kanonis
Isi dengan jawaban yang benar !
1 F = B (A + C) (B + A)
2 F = B + AB + BC + AC
3 F = (A + B) (A +B) (A + B)
4 F = ABC + ABC + ABC
5 F = AB + (B + C) (A + C)
lts05 28
jawaban yang benar
1 F = B (A + C) (B + A) POS non-kanonis
2 F = B + AB + BC + AC SOP non-kanonis
3 F = (A + B) (A +B) (A + B) POS kanonis
4 F = ABC + ABC + ABC SOP kanonis
5 F = AB + (B + C) (A + C) mixed -
lts05 29
Ekspresi Boolean Tabel Kebenaran
Contoh : F(A,B,C) = A B + B C + A B C
Kombinasi input A = 0 , B = 0 , C = 0 ,
Output F = 0 . 0 + 0. 0 + 0. 0 . 0 = 0
Kombinasi input A = 0 , B = 0 , C = 1,
output F = 0 . 0 + 0. 1 + 0. 0 . 1 = 1
lts05 30
Kombinasi input A = 0 , B = 1 , C = 0 , Tabel Kebenaran
Output F = 0 . 1 + 1. 0 + 0. 1 . 0 = 1
F = AB + B C + A B C
Kombinasi input A = 0 , B = 1 , C = 1,
Output F = 0 . 1 + 1. 1 + 0. 1 . 1 = 0
input out
Kombinasi input A = 1 , B = 0 , C = 0 , A B C F
Output F = 1 . 0 + 0. 0 + 1. 0 . 0 = 0 0 0 0 0 0
Kombinasi input A = 1 , B = 0 , C = 1, 1 0 0 1 1
Output F = 1 . 0 + 0. 1 + 1. 0 . 1 = 1 2 0 1 0 1
3 0 1 1 0
Kombinasi input A = 1 , B = 1 , C = 0 , 4 1 0 0 0
Output F = 1 . 1 + 1. 0 + 1. 1 . 0 = 1 5 1 0 1 1
Kombinasi input A = 1 , B = 1 , C = 1, 6 1 1 0 1
Output
lts05 F = 1 . 1 + 1. 1 + 1. 1 . 1 = 1 7 1 1 1 1 31
Tabel Kebenaran Ekspresi Boolean
Minterm & Maxterm untuk fungsi dengan 3 var.input :
Var.input minterm Maxterm
A B C mi simbol Mi (mi) simbol
0 0 0 m0 A B C M0 ( A B C) A+B+C
0 0 1 m1 A B C M1 ( A B C) A + B + C
0 1 0 m2 A B C M2 ( A B C) A + B + C
0 1 1 m3 A B C M3 ( A B C) A + B + C
1 0 0 m4 A B C M4 ( A B C) A + B + C
1 0 1 m5 A B C M5 ( A B C) A + B + C
1 1 0 m6 A B C M6 ( A B C) A + B + C
1 1 1 m7 A BC M7 ( A B C) A + B + C
lts05 32
Tabel Kebenaran Ekspresi Boolean
lts05
m3 1 1 1 = (A + B). (A+B)
34
Contoh : Ekspresi Boolean dari Tabel Kebenaran 3-var
A B C F
0 0 0 0 0 minterm minterm yang membuat
1 0 0 1 1 output F berharga 1 :
2 0 1 0 1
3
m1 , m2 , m5 , m6 , dan m7
0 1 1 0
4 1 0 0 0
5 maxterm maxterm yang membuat
1 0 1 1
output F berharga 0 :
6 1 1 0 1
M0 , M3 , dan M4
7 1 1 1 1
Bentuk SOP : F = m1 + m2 + m5 + m6 + m7
lts05 = ABC + AB C + A BC + A B C + A B C 35
Bentuk POS :
A B C F
F = m0 + m3 + m4
0 0 0 0 0
F = (F)
1 0 0 1 1
2 0 1 0 1 = (m0 + m3 + m4)
X
? F(X,Y) = ?
Y
16 fungsi yang berbeda , Fi , i = 0 , 1 , ... , 15 ,
F4 = X.Y F5 = Y F6 = X.Y+X.Y F7 = X + Y
X Y F4 X Y F5 X Y F6 X Y F7
0 0 0 0 0 1 0 0 0 0 0 1
0 1 0 0 1 0 0 1 1 0 1 1
1 0 1 1 0 1 1 0 1 1 0 1
1 1 0 1 1 0 1 1 0 1 1 0
Flts05
8=? F9 = ? . . . F15 = ? 39
X
1
1
0
0
N=2 22 bit Fungsi logika
Y
1
0
1
0
dengan N
F0 F1
0 0 0 0 0 F0
0
0
0
variabel biner
0 0 0 1 F1
0
0
1
0
menghasilkan
0 0 1 0 F2
F2
0
0
1
0 N
0 0 1 1 F3 2 2 fungsi
F3 F4 F5 F6
0
0
1
1
0 1 0 0 F4 logika yang
0
1
0
0
0 1 0 1 F5 berbeda
0
1
0
1
0 1 1 0 F6
22
2
0
1
1
0
0 1 1 1 F7
1 0 0 0 F8 kombinasi
F7 F8 F9 F10
0
1
1
1
1 0 0 1 F9
1
0
0
0
1 0 1 0 F10
1
0
0
1
1 0 1 1 F11
1
0
1
0
1 1 0 0 F12
1 1 0 1 F13
F14 F15
1
1
1
0
1 1 1 0 F14
1
1
1
1
1 1 1 1 F15
Untuk N variabel input , ada 2N kombinasi
input output
1 0 0 ... 0 1 0 0 1 ... 1
2 0 0 ... 1 0 0 0 0 ... 1
2N kombinasi
3 0 0 ... 1 1 0 0 0 ... 1
: : : : : : : : : : :
2N-3 1 1 0 1 0 0 0 ... 1
3. f = ( a + a) ( ab + abc ) = a b
( a + a) ( ab + abc ) = 1 ( a b ( 1 + c) ) = a b
4. f = ( ( a + b ) ( c + d) ) = a b + c d
( a+b) + ( c + d ) = a b + c d
5. f = ( a + ( bc ) + cd ) + (bc) = ad + b + c
= (( a + (b c) + c d) . (b c) )
= ( a (b c) + (b c)(b c) + c d (b c))
= ( a b c + (b + c).b c + b d c )
= ( a b c + b b c+ b c c + b d c )
= ( a b c + b d c ) = (a b c) (b d c)
= (a + b + c) ( b + d + c )
= a b + a d + a c + b b + b d + b c + c b + c d + c c
= a b + a d + a c + b + b d + b c + cd + c
= ( a b + b + b c + b d) + ( a c + c + c d) + a d
= b ( a + 1 + c + d) + c ( a + 1 + d) + a d
= b + c + a d terbukti
6. f = ( (a + b + c ) ( a+ b + c ) ) = b c
= ( a + b + c ) + ( a + b + c )
= ( a b c) + ( a b c )
= b c ( a + a ) = b c terbukti
7. f = ( ab + ac + bc ) = a b + bc
= (a b) . (a c) . (b c) = ( a + b) ( a + c ) ( b + c)
= ( a a + a c + b a + b c ) ( b + c)
= ( a c + b a + b c ) ( b + c)
= a b c + a c c + a b + a b c + b b c + b c c
= a b c + a b + a b c + b c
= b c ( a + 1) + a b (1 + c) = b c + a b terbukti
8. f = ( ab + ac ( b + c) ) = ( a+ b )( a + c )
= (a b) . ( a c ( b + c ))
= ( a + c ) ( a b c + a c c )
= ( a + c ) ( (a b c ) . ( a c ) )
= ( a + c ) ( ( a + b + c ) ( a + c )
= ( a + c ) ( a a + a c + a b + b c + a c + c c )
= ( a + c ) ( a + a c + a b + b c + a c + c )
= ( a + c ) ( a + a c + a b + b c + c )
= ( a + c ) ( a ( 1 + c + b ) + c ( b + 1 )
= (a + c) ( a + c ) terbukti