Bagian 1:
Logika Biner
Gerbang Logika Dasar
Aljabar Boolean, Manipulasi Aljabar
Bagian 2:
Penyederhanaan Fungsi
Karnough Map
Bagian 3:
Gerbang NAND-NOR
Gerbang X-OR
Don’t Care Condition
3 Logika Biner
Logika Biner
4
OR
NOT
Contoh:
Y = A B dibaca “Y adalah : A AND B.”
▪ Catatan: Pernyataan:
1 + 1 = 2 (dibaca “one plus one equals two”)
tidak sama dengan :
1 + 1 = 1 (dibaca “1 or 1 equals 1”).
Definisi Operator
8
AND OR NOT
0·0=0 0+0=0 0=1
0·1=0 0+1=1 1=0
1·0=0 1+0=1
1·1=1 1+1=1
Truth Tables/Tabel Kebenaran
9
Y 0 1 0 1
(AND) X ·Y 0 0 0 1
(OR) X +Y 0 1 1 1
(NOT) X 1 1 0 0
(b) Timing diagram
Diagram Logika dan Ekspresi-nya.
14
1. X+0= X 2. X .1 =X
.
1-4 :Existence of 0 and 1
3. X+1 =1 4. X 0 =0
5. X+X =X 6. X .X = X 5-6 :Idempotence
7. X+X =1 8. X . X = 0 7-8 :Existence of complement
9. X=X 9 :Involution
10. X + Y = Y + X 11. XY = YX Commutative
12. (X + Y) + Z = X + (Y + Z) 13. (XY) Z = X(YZ) Associative
14. X(Y + Z) = XY + XZ 15. X + YZ = (X + Y) (X + Z) Distributive
16. X + Y = X . Y 17. X . Y = X + Y De Morgan’s
Beberapa properti dari identitas dan Aljabar.
17
AB + AC + BC = AB + AC (Consensus Theorem)
Justification 1: 1 .X = X
Justification 2: X + X’ = 1
= AB + A’C + ABC + A’BC X(Y + Z) = XY + XZ
(Distributive Law)
= AB + ABC + A’C + A’BC X+Y=Y+X
(Commutative Law)
= AB . 1 + ABC + A’C . 1 + A’C . B X . 1 = X, X . Y = Y . X
(Commutative Law)
= AB (1 + C) + A’C (1 + B) X(Y + Z) = XY +XZ
(Distributive Law)
= AB . 1 + A’C . 1 = AB + A’C X .1 = X
Contoh 3: Pembuktian Aljabar Boolean
23
( X + Y ) Z + X Y = Y( X + Z )
Proof Steps Justification (identity or theorem)
( X + Y )Z + X Y
= (lanjutkan!)
Teorema yang berguna
24
(x + y )(x + y ) = y
25
xy +xy = y
Buktikan!
Proof of DeMorgan’s Laws
26
x + y = xy xy = x + y
Buktikan x + y + x’. y’ = 1
Buktikan (x + y) . x’. y’ = 0
Evaluasi Fungsi Boolean
27
F1 = xy z x y z F1 F2 F3 F4
F2 = x + yz 0 0 0 0 0
F3 = x y z + x y z + x y 0 0 1 0 1
F4 = x y + x z 0 1 0 0 0
0 1 1 0 0
1 0 0 0 1
1 0 1 0 1
1 1 0 1 1
1 1 1 0 1
Penyederhanan Ekspresi
28
2-2
2-3
2-4
2-6
2-7
2-8
2-9