Scribd
Upload
32 views19 pages

Lecture 5 - Boolean Algebra

Boolean algebra - II was presented by Dr Abhijit Barthakur of Cotton University. The document discussed useful laws of Boolean algebra including commutative, associative, distributive, and absorption laws. It also covered laws for OR and AND gates. Several Boolean expressions were given as examples and solved step-by-step using Boolean algebra rules and identities to simplify the expressions. Circuits were also represented with Boolean equations and simplified.

Uploaded by

hridoydey2808
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
32 views19 pages

Lecture 5 - Boolean Algebra

Boolean algebra - II was presented by Dr Abhijit Barthakur of Cotton University. The document discussed useful laws of Boolean algebra including commutative, associative, distributive, and absorption laws. It also covered laws for OR and AND gates. Several Boolean expressions were given as examples and solved step-by-step using Boolean algebra rules and identities to simplify the expressions. Circuits were also represented with Boolean equations and simplified.

Uploaded by

hridoydey2808
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

Boolean algebra - II

Dr Abhijit Barthakur
Cotton University
SOME USEFUL LAWS OF BOOLEAN ALGEBRA:
• Commutative law: 𝐴+𝐵 =𝐵+𝐴
𝐴. 𝐵 = 𝐵. 𝐴

• Associative law: 𝐴+ 𝐵+𝐶 = 𝐴+𝐵 +𝐶


𝐴. 𝐵. 𝐶 = 𝐴. 𝐵 . 𝐶

• Distributive law: 𝐴. 𝐵 + 𝐶 = 𝐴. 𝐵 + 𝐴. 𝐶

• Absorptive laws: 𝐴 + 𝐴𝐵 = 𝐴
𝐴. 𝐴 + 𝐵 = 𝐴
Laws of respective gates:
OR gate: AND gate:

𝐴+0=𝐴 𝐴. 0 = 0

𝐴+1 =1 𝐴. 1 = 𝐴

𝐴+𝐴=𝐴 𝐴. 𝐴 = 𝐴

𝐴+𝐴=1 𝐴. 𝐴 = 0
Boolean Expression Boolean Algebra Law or Rule
A+1=1 Annulment
A+0=A Identity
A.1=A Identity
A.0=0 Annulment
A+A=A Idempotent
A.A=A Idempotent

A+𝐴=1 Complement

A.𝐴=0 Complement

𝐴 + 𝐵= 𝐴.𝐵 de Morgan’s Theorem

𝐴. 𝐵= 𝐴 + 𝐵 de Morgan’s Theorem
Boolean identities:
• 𝐴. 𝐴 + 𝐵 = 𝐴. 𝐵
• 𝐴 + 𝐴. 𝐵 = 𝐴 + 𝐵
• 𝐴 + 𝐵 𝐴 + 𝐶 = 𝐴𝐶 + 𝐴𝐵
• 𝐴 + 𝐵 𝐵 + 𝐶 𝐶 + 𝐴 = 𝐴𝐵 + 𝐵𝐶 + 𝐶𝐴
• 𝐴 + 𝐵𝐶 = 𝐴 + 𝐵 𝐴 + 𝐶
• 𝐴𝐵𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶 = 𝐵 𝐴 + 𝐶
Question1: Verify the following Boolean
identities:
• (i) 𝐴𝐵𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶 = 𝐴𝐶 + 𝐴𝐵𝐶
• (ii) 𝐴𝐵 + 𝐴𝐵 = 𝐴
• (iii) 𝐴𝐶 + 𝐴𝐵𝐶 = 𝐴𝐶
• (iv) 𝐴𝐵 + 𝐴 + 𝐴𝐵 = 0

• (v) 𝐴. 𝐴𝐵 . 𝐵. 𝐴𝐵 = 𝐴𝐵 + 𝐴𝐵
Question2. Simplify the following Boolean
expressions:
• (i) 𝐴𝐵𝐶 + 𝐴𝐵. 𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶
• (ii) 𝐴𝐵 + 𝐴 + 𝐵 + 𝐴𝐶
• (iii) 𝐴 + 𝐵 𝐴 + 𝐵 𝐴 + 𝐵
• (iv) 𝐴 + 𝐵 + 𝐴 + 𝐶 𝐵 + 𝐶
• (v) 𝐴. 𝐵. 𝐶 + 𝐴. 𝐵𝐶 + 𝐴𝐵𝐶 + ABC
Solved example1: Simplify: 𝐶 + 𝐵𝐶:
Expression Rule(s) Used
𝐶 + 𝐵𝐶 Original Expression
𝐶+ 𝐵+𝐶 De Morgan's Law.

𝐶 +𝐶 +𝐵 Commutative, Associative Laws.


1+𝐵 Complement Law.
1
Solved example2: Simplify: 𝐴𝐵 𝐴 + 𝐵 𝐵 + 𝐵

Expression Rule(s) used


𝐴𝐵 𝐴 + 𝐵 𝐵 + 𝐵 Original expression

𝐴𝐵 𝐴 + 𝐵 Complement law, Identity law

𝐴+𝐵 𝐴+𝐵 De Morgan's Law


𝐴 + 𝐵𝐵 Distributive law. This step uses the fact that or
distributes over and. It can look a bit strange
since addition does not distribute over
multiplication.
𝐴 Complement, Identity.
Solved example3: Simplify: 𝐴 + 𝐶 𝐴𝐷 + 𝐴𝐷 +
𝐴𝐶 + 𝐶
Expression Rule(s) used
𝐴 + 𝐶 𝐴𝐷 + 𝐴𝐷 + 𝐴𝐶 + 𝐶 Original Expression

𝐴 + 𝐶 𝐴 𝐷 + 𝐷 + 𝐴𝐶 + 𝐶 Distributive.
(A + C)A + AC + C Complement, Identity.
A((A + C) + C) + C Commutative, Distributive.
A(A + C) + C Associative, Idempotent.
AA + AC + C Distributive.
A + (A + 1)C Idempotent, Identity, Distributive.
A+C Identity, twice.
Solved example4: Simplify: 𝐴 𝐴 + 𝐵 + 𝐵 + 𝐴𝐴 𝐴 + 𝐵
Expression Rule(s) used
𝐴 𝐴 + 𝐵 + 𝐵 + 𝐴𝐴 𝐴 + 𝐵 Original expression
𝐴𝐴 + 𝐴𝐵 + 𝐵 + 𝐴 𝐴 + 𝐵 + 𝐴 𝐵 Idempotent (AA to A), then Distributive, used twice.
𝐴𝐵 + 𝐵 + 𝐴 𝐴 + 𝐵 + 𝐴 𝐵 Complement, then Identity. (Strictly speaking, we also used the
Commutative Law for each of these applications.)
𝐴𝐵 + 𝐵𝐴 + 𝐴𝐴 + 𝐵𝐵 + 𝐴𝐵 Distributive, two places
𝐴𝐵 + 𝐵𝐴 + 𝐴 + 𝐴𝐵 Idempotent (for the A's), then Complement and Identity to
remove BB.
𝐴𝐵 + 𝐴𝐵 + 𝐴. 1 + 𝐴𝐵 Commutative, Identity; setting up for the next step.
𝐴𝐵 + 𝐴 𝐵 + 1 + 𝐵 Distributive.
𝐴𝐵 + 𝐴 Identity, twice (depending how you count it).
𝐴 + 𝐴𝐵 Commutative.
𝐴+𝐴 𝐴+𝐵 Distributive.
A+B Complement, Identity.
Solved example 5: Simplify the circuit
• Solution: The Boolean equation of the circuit is: Q=AB+BC(B+C)

• Simplify the equation as


Q=AB+BC(B+C)
Q=AB+BBC+BCC
Q=AB+BC+BC
Q=AB+BC
Q=B(A+C)
• The simplified circuit is:
Solved example6: Simplify the circuit
• Solution: The Boolean equation of the circuit is: 𝑄 = 𝐴 + 𝐵𝐶 + 𝐴𝐵
• Simplify the equation as:
𝑄 = 𝐴 + 𝐵𝐶 + 𝐴𝐵
𝑄 = 𝐴 + 𝐵𝐶 . 𝐴𝐵
𝑄 = 𝐴 + 𝐵𝐶 . 𝐴𝐵
𝑄 = 𝐴𝐴𝐵 + 𝐵𝐶𝐴𝐵
𝑄 = 𝐴𝐵 + 0 = 𝐴𝐵
• Simplified circuit is:
Solved example7: Simplify the circuit

Solution: The Boolean equation of the circuit is:


𝑌 = 𝐴𝐵𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶
• Simplification of the equation is:
𝑌 = 𝐴𝐵𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶
𝑌 = 𝐵𝐶 𝐴 + 𝐴 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶
𝑌 = 𝐵𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶
𝑌 = 𝐵 𝐶 + 𝐴𝐶 + 𝐴𝐵𝐶
• Applying rule 𝐴 + 𝐴𝐵 = 𝐴 + 𝐵 to 𝐶 + 𝐴𝐶 term
𝑌 = 𝐵 𝐶 + 𝐴 + 𝐴𝐵𝐶
𝑌 = 𝐵𝐶 + 𝐵𝐴 + 𝐴𝐵𝐶
𝑌 = 𝐵𝐶 + 𝐴 𝐵 + 𝐵𝐶
• Applying rule 𝐴 + 𝐴𝐵 = 𝐴 + 𝐵 to the 𝐵 + 𝐵𝐶 term
𝑌 = 𝐵𝐶 + 𝐴 𝐵 + 𝐶
𝑌 = 𝐵𝐶 + 𝐴𝐵 + 𝐴C
𝑌 = 𝐴𝐵 + 𝐵𝐶 + 𝐶𝐴
• The simplified circuit is:

You might also like