Download as pdf or txt
Download as pdf or txt
You are on page 1of 31

Aturan- aturan Hukum

Aljabar Boolean &


D’Morgan

Slide - 4 1
1. Commutative law of addition
Commutative law of addition,
A+B = B+A
the order of O-Ring does not matter.

Slide - 4 2
2. Commutative law of Multiplication
Commutative law of Multiplication
AB = BA
the order of ANDing does not matter.

Slide - 4 3
3. Associative law of addition
Associative law of addition
A + (B + C) = (A + B) + C
The grouping of ORed variables does not
matter

Slide - 4 4
4. Associative law of multiplication
Associative law of multiplication
A(BC) = (AB)C
The grouping of ANDed variables does not
matter

Slide - 4 5
5. Distributive Law
A(B + C) = AB + AC

(A+B)(C+D) = AC + AD + BC + BD
Slide - 4 6
6. Boolean Rules
1) A + 0 = A
 In math if you add 0 you have changed nothing
 In Boolean Algebra ORing with 0 changes nothing

Slide - 4 7
6.Boolean Rules
2) A + 1 = 1

 ORing with 1 must give a 1 since if any input


is 1 an OR gate will give a 1

Slide - 4 8
Boolean Rules
3) A • 0 = 0

 In math if 0 is multiplied with anything you


get 0. If you AND anything with 0 you get 0

Slide - 4 9
Boolean Rules
4) A • 1 = A

 ANDing anything with 1 will yield the anything

Slide - 4 10
Boolean Rules
5) A + A = A

 ORing with itself will give the same result

Slide - 4 11
Boolean Rules
6) A + A = 1

 Either A or A must be 1 so A + A =1

Slide - 4 12
Boolean Rules
7) A • A = A

 ANDing with itself will give the same result

Slide - 4 13
Boolean Rules
8) A • A = 0
 In digital Logic 1 =0 and 0 =1, so AA=0 since one of
the inputs must be 0.

Slide - 4 14
Boolean Rules
9) A = A
 If you not something twice you are back to the
beginning

Slide - 4 15
Boolean Rules
10) A + AB = A

Proof:
A + AB = A(1 +B)DISTRIBUTIVE LAW
= A∙1 RULE 2: (1+B)=1
= A RULE 4: A∙1 = A

Slide - 4 16
Boolean Rules
11) A + AB = A + B
 If A is 1 the output is 1 , If A is 0 the output is B
Proof:
A + AB = (A + AB) + AB RULE 10
= (AA +AB) + AB RULE 7
= AA + AB + AA +AB RULE 8
= (A + A)(A + B) FACTORING

= 1∙(A + B) RULE 6
=A+B Slide - 4
RULE 4 17
Boolean Rules
12) (A + B)(A + C) = A + BC

PROOF
(A + B)(A +C) = AA + AC +AB +BC DISTRIBUTIVE LAW
= A + AC + AB + BC RULE 7
= A(1 + C) +AB + BC FACTORING
= A.1 + AB + BC RULE 2
= A(1 + B) + BC FACTORING
= A.1 + BC RULE 2
= A + BC RULE 4
Slide - 4 18
7. Teorema DeMorgan’s
Komplemen 2 atau lebih variabel – variabel gerbang AND
sama dengan komplemen variabel khusus gerbang OR.

Persamaan:
XY  X Y
Komplemen 2 atau lebih variabel gerbang OR sama dengan
komplemen variabel khusus gerbang AND.

Persamaan:
X Y  XY
slide - 5 19
Teorema
Komplemen 2 atau lebih variabel – variabel gerbang AND
sama dengan komplemen variabel khusus gerbang OR.

Persamaan:
XY  X Y
Komplemen 2 atau lebih variabel gerbang OR sama dengan
komplemen variabel khusus gerbang AND.

Persamaan:
X Y  XY
slide - 5 20
Kesetaraan gerbang dan hubungan tabel
kebenaran yang digambarkan oleh Teorema
DeMorgan.

slide - 5 21
XY  X Y X Y  XY
Contoh:

XYZ XYZ

X Y  Z X Y  Z

X Y  Z XYZ
slide - 5 22
Contoh:
A  B  C D ABC D

ABC  DEF A  B  C D  E  F 

AB  C D  EF A  B C  D E  F 

ABC D E ABC D E
slide - 5 23
Analisis Boolean Rangkaian
Logika

Jika A = 1, B = 1, C = 1 and D = 1, maka Output nya


adalah ???

slide - 5 24
Inputs Output
Tabel Kebenaran A B C D A(B + CD)
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1
slide - 5 25
Penyederhanaan menggunakan
Aljabar Boolean
Example: Draw your possible logic gate?
Simplify this expression using Boolean algebra?

AB  AB  C   B B  C  AB  A B  C   B B  C 
Try This:

B  AC
AB

slide - 5 26
Penyelesaian

AB  AB  C   B B  C 
Y  AB  A  B  C   B  B  C 
 AB  AB  AC  BB  BC
 AB  AC  B  BC
 B (1  A )  AC  BC
 B  AC  BC
 B (1  C )  AC
 B  AC

slide - 5 27
penyelesaian

Y  A B  A B  C   B B  C 
 A B  A ( B . C )  B ( B .C )
 AB  AB C  0 ingat B . B  0
 A B (1  C )
 AB

slide - 5 28
Exercise: Analyze the circuit below

1. Y=???
2. Simplify the Boolean expression found in 1

slide - 5 29
Exercise:

1. X=???
2. Simplify the Boolean expression found in 1

slide - 5 30
Thank You

Slide - 4 31

You might also like