Mekatronika

FTM 039
Boolean Algebra & Logic Gate
Theorema & Calculation Rules

M.Eng., Udink Aulia

M.Sc., Rudi Kurniawan
 Rule (1)
• Connector with 0 and 1

• Negation
 Rule (2)
• Idempoten law

• Associative law
A ∩ (B ∩ C) = (A ∩ B) ∩ C
A U (B U C) = (A U B) U C

• Distributive law
A ∩ (B U C) = (A ∩ B) U (A ∩ C)
A U (B ∩ C) = (A U B) ∩ (A U C)
 Rule (3)
• De Morgan Law

• Shorten Law
 Normal form of switching functions

• Input

where
 Minterm & maxterm
• A minterm is a Boolean expression resulting in 1 for the
output of a single cell, and 0s for all other cells in a
Karnaugh map, or truth table. If a minterm has a single 1
and the remaining cells as 0s, it would appear to cover a
minimum area of 1s.

• A maxterm is a Boolean expression resulting in a 0 for

the output of a single cell expression, and 1s for all other
cells in the Karnaugh map, or truth table.
 Disjunctive & conjunctive normal form

• Disjunctive normal form (DNF): A switching is

from DNF if z = 1 for all minterm.

• Conjuctive normal form (CNF): A switching is

from DNF if z = 0 for all maxterm.

• where
Example; Two variables
Example : Three Variables
 Representations of the Boolean function

The Boolean function is represented by some methods, will

be discussed.
 1. Function Table
• Function table to control an electromotor
 2. Boolean connector

Note
 3. Karnaugh-Veitch-Diagram
K-V diagram for 1 K-V diagram for 2 variables
variable

K-V diagram for 3

variables K-V diagram for 4 variables
K-V diagram to control an electromotor
4. Logic or -Function plan
Function plan of electromotor controller
Simplification Method

Simplified-Switching
1. Application of The Switching-Algebra
Theorem
2. Simplification with K-V Diagramm
Structure & effectiveness of Switchings
from NAND and NOR elements

IC with NAND and NOR gates

1. Element functions of NAND-Element
2. Element functions of NOR-Element