Boolean expressions and operations

• Boolean Addition is equivalent to OR operation.

• Boolean Multiplication is equivalent to AND operation.

• In Boolean algebra signals (input or output) are considered as

variables which represent data, condition or action. Slide # 2
Slide # 3
Implement logic expression from circuit

Slide # 4
Implement logic expression from circuit

Slide # 5
Implement logic circuit from logic exp:

Slide # 6
Implement logic circuit from logic exp:

Slide # 7
Implement logic circuit using only NAND and NOR gates

• Also find output if A=B=C=1 and D=0

Slide # 8
Creating truth table for logic expression
• A(B+CD)

Slide # 9
De Morgan’s theorems
• In set theory ( A  B ) '  A ' B '
• Two theorems
( A  B ) '  A ' B '
• In Boolean algebra
• 1st theorem
• The complement of a product of variables is equal to the sum
of the complements of the variables.
• The complement of two or more ANDed variables is
equivalent to the OR of the complements of the individual
variables.

Slide # 10
De Morgan’s theorems
• 2nd theorem
• The complement of a sum of variables is equal to the product of
the complements of the variables.
• The complement of two or more ORed variables is equivalent to
the AND of the complements of the individual variables.

Slide # 11
Slide # 12
Simplify using De Morgan’s law

• Answer

Slide # 13
Simplify using De Morgan’s law

• Answers

Slide # 14
Laws of Boolean algebra
• Commutative law of addition for two variables (A+B=B+A)

• Commutative law of multiplication for two variables

(A+B=B+A)

Slide # 15
Laws of Boolean algebra
• Associative law of addition for three variables A+(B+C)=(A+B)
+C

• Associative law of multiplication for three variables

A(BC)=(AB)C

Slide # 16
Laws of Boolean algebra
• Distributive law of addition for three variables
A(B+C)=AB+AC

Slide # 17
Rules of Boolean algebra
• Rule 1:

• Rule 2:

Slide # 18
Rules of Boolean algebra
• Rule 3:

• Rule 4:

Slide # 19
Rules of Boolean algebra
• Rule 5:

• Rule 6:

Slide # 20
Rules of Boolean algebra
• Rule 7:

• Rule 8:

Slide # 21
Rules of Boolean algebra
• Rule 9:

• Rule 10:

Slide # 22
Rules of Boolean algebra

Slide # 23
Rules of Boolean algebra
• Rule 11:

Slide # 24
Rules of Boolean algebra
• Rule 11:

Slide # 25
Rules of Boolean algebra
• Rule 12:

Slide # 26
Rules of Boolean algebra
• Rule 12:

Slide # 27
Rules of Boolean algebra

Slide # 28
Simplify the following Boolean expression/logic circuit:

Slide # 29
Simplify the following Boolean expression/logic circuit:

Slide # 30
Slide # 31
• By applying rule 12

z=B

• By applying rule 11

Slide # 32
Using Boolean algebra techniques, simplify this expression:

• Answer

Slide # 33
Simplify the following Boolean expression:

• Answer

• 2 Answers

BC  AC  BC Slide # 34
Simplify the following Boolean expression:

• Answer

Slide # 35
Simplify
• to

• to
•
• to

• to

Slide # 36
Forms of Boolean expressions (SOP and POS)
• Sum of products (SOP) form
• Examples

• SOP can have individual bars over individual variables but can’t
have single bar over more than one variables.

• Set of variables is also known as domain of Boolean expression

Slide # 37
Sum of products (SOP) form
• An SOP expression can be implemented with one OR gate and
two or more AND gates.

Slide # 38
Convert each of the following Boolean expressions to SOP form:

• Standard SOP form:

• All variables in domain, appear in each product term in the
expression.
• Example of standard SOP form:

Slide # 39
Converting product terms into Standard SOP
• For product terms, where there is/are missing variable/s
Multiply product term with sum of missing variable and its
complement
• Example
• Taking first product term

• Taking second product term

Slide # 40
Converting product terms into Standard SOP
• 3rd term is already in standard form
• The complete standard SOP form of the original expression is
as follows:

Slide # 41
Standard forms of Boolean expressions
• Product of sums (POS) form
• When two or more sum terms are multiplied, the resulting expression
if POS. Example:

• Can contain a single-variable term

• Can have Slide # 42

Implementation of POS
• ANDing the outputs of two or more OR gates

Slide # 43
Converting a Sum term to standard POS
• Since we know rule 8 and 12

• Add missing variable using Rule-8, then expand using Rule-12

• Convert the following Boolean expression into standard POS

form:

Slide # 44
• Take first term, missing variable is . Add and
apply Rule-12

• Take second term

• Third term is already in standard form

Slide # 45
• Final result will be

Slide # 46
Converting standard SOP to standard POS
• Step 1: Determine the binary numbers that represent the
product terms (variable without complement=1).
• Step 2: Determine all of the binary numbers not included in the
evaluation in Step 1.
• Step 3: Write the equivalent sum term for each binary number
from Step 2 and express in POS form. (Binary 1=
complemented variable)
• Using a similar procedure, you can go from POS to SOP.

Slide # 47
Convert the following SOP expression to an equivalent POS expression:

• Step 01:

• Step 02:
001, 100, 110
• Step 03:

Slide # 48
Making truth table from standard SOP form
• Develop a truth table for the standard SOP expression

Slide # 49
Making truth table from standard POS form
• Determine the truth table for the following standard POS
expression:

Slide # 50
Determine the standard SOP expression and the equivalent standard
POS expression.

Slide # 51
Karnaugh Map (K-Map)
• Used to simplify Boolean expressions
• It produces simplest possible SOP or POS expressions
• K-map is an array of cells in which each cell represents a binary
value of the input variables.
• It can simplify expressions with up to maximum 5 variables
• Number of cells in K-map = Number of rows in truth table

Slide # 52
Karnaugh Map (K-Map)
• 3- variable K-map 4-variable K-map
• Single-variable changes b/w adjacent cells.

Slide # 53
Adjacent cells
• A cell is not adjacent to the
cells that diagonally touch
any of its corners.
• Cells in the top row are
adjacent to the
corresponding cells in the
bottom row.
• cells in the outer left column
are adjacent to the
corresponding cells in the
outer right column.
Slide # 54
Mapping standard SOP to K-Map

Slide # 55
Mapping standard SOP expression to K-Map
• Map the following standard SOP expression on a Karnaugh
map:

Slide # 56
Mapping a Nonstandard SOP Expression to K-Map
• Map the following SOP expression on a Karnaugh map:

Slide # 57
Mapping a Nonstandard SOP Expression to K-Map
• Map the following SOP expression on a Karnaugh map:

Slide # 58
Grouping the 1s
• 1. A group must contain either 1, 2, 4, 8, or 16 cells, which are
all powers of two. In the case of a 3-variable map, 2^3 = 8 cells
is the maximum group.
• 2. Each cell in a group must be adjacent to one or more cells in
that same group, but all cells in the group do not have to be
adjacent to each other.
• 3. Always include the largest possible number of 1s in a group
in accordance with rule 1.
• 4. Each 1 on the map must be included in at least one group.
The 1s already in a group can be included in another group as
long as the overlapping groups include noncommon 1s.
Slide # 59
Slide # 60
Determining the Minimum SOP Expression from the Map
• Each group of cells containing 1s creates one product term
• (a) For a 3-variable map:
• (1) A 1-cell group yields a 3-variable product term
• (2) A 2-cell group yields a 2-variable product term
• (3) A 4-cell group yields a 1-variable term
• (4) An 8-cell group yields a value of 1 for the expression
• (b) For a 4-variable map:
• (1) A 1-cell group yields a 4-variable product term
• (2) A 2-cell group yields a 3-variable product term
• (3) A 4-cell group yields a 2-variable product term
• (4) An 8-cell group yields a 1-variable term
• (5) A 16-cell group yields a value of 1 for the expression
• Derived minimum product terms are summed to form the minimum SOP
Slide # 61
Determine the product terms from the K-map and write the
resulting minimum SOP expression.

Slide # 62
K-map to SOP logic expression

Slide # 63
K-map to SOP logic expression

Slide # 64
Use K-map to minimize following SOP expression

• The binary values of the expression are

• 101 + 011 + 001 + 000 + 100
• Map the standard SOP
expression and group the cells

Slide # 65
Use K-map to minimize following SOP expression

• It is not a standard SOP expression, therefore

Slide # 66
Mapping Directly from a Truth Table

Slide # 67
Logic expression and logic circuit for XOR and XNOR using
Truth table and K-Map

Slide # 68
Designing own logic circuit for application
• Three tanks A, B, C.
• Level sensor (tank full=0, tank empty=1)
• If level of any two of tanks get lower then alarm is activated
• Making truth table K-Map simplification Circuit
Tank A Tank B Tank C Alarm
• 0 0 0 0
AB+AC+BC
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1
Logic expression=A’BC+AB’C+ABC’+ABC Slide # 69
“Don’t Care” Conditions
• Conditions that won’t occur
• Such as BCD inputs to a circuit

Slide # 70
Application problem (Designing 7-segment display)
• In a 7-segment display, each of the seven segments is
activated for various digits. For example, segment a is
activated for the digits 0, 2, 3, 5, 6, 7, 8, and 9, as
illustrated in Figure.

Slide # 71
The expression for segment a is

• Each term in the expression represents one of the digits in

which segment a is used.

• Important (Assignment 1.1)

• Make expression for b to g
• Make circuit for a to g Slide # 72
K-map POS minimization
• Mapping a standard POS expression
• Steps
• Determine opposite binary equivalent
• Place 0

Slide # 73
Use a Karnaugh map to minimize POS

• Binary values

Slide # 74
Use a Karnaugh map to minimize the following POS expression:

• First need to be changed into standard POS form.

• Changed first term 

Slide # 75
Converting between POS and SOP using K-map

Slide # 76
Converting between POS and SOP using K-map

Slide # 77