BOOLEAN ALGEBRA

ME 513E - MECHATRONICS
BOOLEAN ALGEBRA
• The operation of almost all modern digital computers is
based on two-valued or binary systems.
• Binary systems were known in the ancient Chinese
civilization and by the classical Greek philosophers who
created a well structured binary system, called
propositional logic.
• Propositions may be TRUE or FALSE, and are stated
as functions of other propositions which are connected
by the three basic logical connectives: AND, OR, and
NOT.
BOOLEAN ALGEBRA
• For example:
“I will take an umbrella with me if it is raining or the
weather forecast is bad”.
• Two Propositions:
• If it is raining
• The weather forecast is bad
BLOCK DIAGRAM

TRUTH TABLE
BOOLEAN ALGEBRA
• For example:
• “If I do not take the car then I will take the umbrella if
it is raining or the weather forecast is bad”
• (Take Umbrella) = ( NOT (Take Car ) ) AND ( (Bad Forecast ) OR
(Raining ) )

BLOCK DIAGRAM
BOOLEAN ALGEBRA
• To simplify the handling of Complex binary
connectives, the mathematician George Boole
developed Boolean Algebra in the last century, using
ordinary algebraic notation, and 1 for TRUE and 0 for
FALSE.
• Operations:
• Multiplication - AND “∙”
• Addition – OR “+”
• Negation - ____
BOOLEAN ALGEBRA
• MULTIPLICATION: • ADDITION • NEGATION
0∙0=0 0+0=0
! 1! = 0
0∙1=0 0+1=1
! 0! = 1
1∙0=0 1+0=1
! 𝐴! = 𝐴
1∙1=1 1+1=1
A∙0=0 A+0=𝐴
A∙1=𝐴 A+1=1
𝐴 ∙ ! 𝐴! = 0 𝐴 + ! 𝐴! = 1
𝐴∙𝐴=𝐴 𝐴+𝐴=𝐴
BOOLEAN ALGEBRA
• Let:
• 𝑈 = 𝑈𝑀𝐵𝑅𝐸𝐿𝐿𝐴
• 𝐶 = 𝐶𝐴𝑅
• 𝑅 = 𝑅𝐴𝐼𝑁
• 𝑊 = 𝐹𝑂𝑅𝐸𝐶𝐴𝑆𝑇
𝑼 = ! 𝑪! ∙ (𝑹 + 𝑾)
LOGIC GATES
• Definition of symbols
• “1” → denotes that the switch condition is on or operated
• “0” → denotes that the switch conditions is off or not operated
• “not- 𝐴𝑎” → inverse
• “letter” → input, output, condition.
• Definition of “AND gate”
A∙B=S
A B S 1S1
0 0 0 1
0 1 0 1
1 0 0 1
1 1 1 0
LOGIC GATES
• Definition of “OR gate”
A+B=S
A B S 1S1
0 0 0 1
0 1 1 0
1 0 1 0
1 1 1 0
LOGIC GATES
• FUNDAMENTAL LAWS
• Commutative Laws
• OR
• 𝐴+𝐵 =𝐵+𝐴
• A+0=A
• 𝐴∙𝐵 =𝐵∙𝐴
• A+1=1
• Associative Laws
• A+A=A
• 𝐴+𝐵 +𝐶 =𝐴+ 𝐵+𝐶
• A+A=1
• 𝐴∙𝐵 ∙𝐶 =𝐴∙ 𝐵∙𝐶
• AND
• Distributive Laws
• A∙0=0
• A∙ B+C = A∙B + A∙C
• A∙1=A
• A+ B∙C = A+B ∙ A+C
• A∙A=A
• A∙A=0
LOGIC GATES
THEOREMS OR RULES OF BOOLEAN ALGEBRA
A. A + B = A .A + A .B = A
A + A .B =A
A . ! A! + B = A .B
A + ! A!. B =A+B
A+B . A+B =A+B
! A!. ! B! =A+B
A .B = ! A! + ! B!
! A! + ! B! = A .B
A+B = ! A!. ! B!
SIMPLIFYING BOOLEAN EXPRESSIONS
•S= A+B +A∙ B
•S= A ∙B+A∙B
•S= A ∙ B ∙ C + A ∙ B ∙C+A∙ B ∙ C +A∙C∙ B +A∙B∙C
•S= A ∙ C ∙B+A∙ B ∙ C +A∙C∙ B +A∙B∙ C
•S=A∙C∙B+A∙B∙C+A∙C∙B+A∙B∙C
•S=
A ∙ B ∙ C + A ∙ B ∙C+ A ∙B∙ C +A∙ B ∙ C +A∙B∙ C +A∙B∙C