Scribd
Upload
19 views52 pages

Lecture 3

This document summarizes a lecture on Boolean algebra, which included: - Definitions of basic Boolean operations like addition and multiplication. - Laws of Boolean algebra like commutative, associative, and distributive laws. - Rules for using Boolean operations in truth tables. - DeMorgan's theorems for rewriting Boolean expressions. - Standard forms like sum-of-products and product-of-sums. - Using Karnaugh maps to minimize Boolean expressions.

Uploaded by

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

Lecture 3

This document summarizes a lecture on Boolean algebra, which included: - Definitions of basic Boolean operations like addition and multiplication. - Laws of Boolean algebra like commutative, associative, and distributive laws. - Rules for using Boolean operations in truth tables. - DeMorgan's theorems for rewriting Boolean expressions. - Standard forms like sum-of-products and product-of-sums. - Using Karnaugh maps to minimize Boolean expressions.

Uploaded by

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

CSE563

APPLIED MATHEMATICS
LECTURE-3
Boolean algebra
Boolean Operations and Expressions
• Addition • Multiplication
0+0=0 0*0=0
0+1=1 0*1=0
1+0=1 1*0=0
1+1=1 1*1 =1
Laws of Boolean Algebra

• Commutative Laws
• Associative Laws
• Distributive Law
Laws of Boolean Algebra
• Commutative Law of Addition:
A+B=B+A
• Commutative Law of Multiplication:
A*B=B*A
• Associative Law of Addition:
A + (B + C) = (A + B) + C
• Associative Law of Multiplication:
A * (B * C) = (A * B) * C
• Distributive Law:
A(B + C) = AB + AC
Rules of Boolean Algebra
• Rule 1

OR Truth Table
• Rule 2

OR Truth Table
• Rule 3

AND Truth Table


• Rule 4

AND Truth Table


• Rule 5

OR Truth Table
• Rule 6

OR Truth Table
• Rule 7

AND Truth Table


• Rule 8

AND Truth Table


• Rule 9
• Rule 10: A + AB = A

AND Truth Table OR Truth Table


• Rule 11: A  AB  A  B

AND Truth Table OR Truth Table


• Rule 12: (A + B)(A + C) = A + BC

AND Truth Table OR Truth Table


DeMorgan’s
Theorem
• Theorem 1

XY  X  Y

• Theorem 2
X  Y  XY
Remember:
“Break the bar,
change the sign”
A logic circuit showing the development of the Boolean expression
for the output.
A logic circuit showing the development of the Boolean
expression for the output.
Standard Forms of Boolean
Expressions
The sum-of-product (SOP) form
• Example: X = AB + CD + EF

The product of sum (POS) form


• Example: X = (A + B)(C + D)(E + F)
Implementation of the SOP expression AB + BCD + AC.
This NAND/NAND implementation is equivalent to the AND/OR
This NAND/NAND implementation is equivalent to the AND/OR.
The Karnaugh Map
3-Variable Karnaugh Map 3-Variable Example
4-Variable Karnaugh Map 4-Variable Example
Adjacent cells on a Karnaugh map are those that differ by only one
variable. Arrows point between adjacent cells.
Example of mapping a standard SOP expression.
5-Variable Karnaugh Mapping
SUM-OF-PRODUCTS FORM FOR BOOLEAN
ALGEBRAS
Below is the four-step algorithm which uses the Boolean algebra laws to transform any
Boolean expression into an equivalent sum-of-products expression.
EXAMPLE
• The sum-of-products form for a Boolean expression E is also called the
disjunctive normal form or DNF of E.
• The complete sum-of-products form for E is also called the full
disjunctive normal form, or the disjunctive canonical form, or the
minterm canonical form of E.
Finding a Minimal Sum-of-Products Form
THANKS !!!

You might also like