Minterms

 Consider variables A and B

 Assume that they are somehow combined with AND operator

Sum of Product and Product of Sums  There are 4 possible combinations;

AB, A' B, AB ' , A' B '
(SOP and POS)
 Each of those terms is called a Minterm (standard product)

 Minterms are AND terms with every variable present in either true

or complemented form.

11/17/2024 SOP and POS 2

Minterms… Exercise
 Given that each binary variable may appear normal (e.g., x) or  List the Minterms for 3 variables
complemented (e.g., x’), there are 2n minterms for n variables.

 In general, if there are n variables, there are 2n Minterms

11/17/2024 SOP and POS 3 11/17/2024 SOP and POS 4

1
 Maxterms Maxterms…
 Consider variables A and B  Given that each binary variable may appear normal (e.g., x) or

 Assume that they are somehow combined with OR operator complemented (e.g., x’), there are 2n maxterms for n variables.

 There are 4 possible combinations

A  B, A'  B , A  B', A'  B '  In general, if there are n variables, there are 2n maxterms

 Each of those terms is called a Maxterm (standard sums)

 Maxterms are OR terms with every variable in true or

complemented form.

11/17/2024 SOP and POS 5 11/17/2024 SOP and POS 6

Exercise Standard Order

 List the Maxterm for 3 variables  Minterms and maxterms are designated with a subscript

 The subscript is a number, corresponding to a binary pattern

 The bits in the pattern represent the complemented or normal state

of each variable listed in a standard order.

 All variables will be present in a minterm or maxterm and will be

listed in the same order (usually alphabetically)

11/17/2024 SOP and POS 7 11/17/2024 SOP and POS 8

2
 Standard Order… Purpose of the Index
 Example: For variables a, b, c;  The index for the minterm or maxterm, expressed as a binary
number, is used to determine whether the variable is shown in the
 Maxterms: (a + b + c’), (a + b + c)
true form or complemented form.
 Terms: (b + a + c), and (c + b + a) are NOT in standard order.  For Minterms;

 Minterms: ab’c, abc, a’b’c  “1” means the variable is “Not Complemented” and

 “0” means the variable is “Complemented”.

 Terms: (a + c), bc, and (a’ + b) do not contain all variables
 For Maxterms;

 “0” means the variable is “Not Complemented” and

 “1” means the variable is “Complemented”.

11/17/2024 SOP and POS 9 11/17/2024 SOP and POS 10

Index Example in Three Variables Index Example in Three Variables…

 Example: (for three variables)  All three variables are complemented for minterm 0

 Assume the variables are called X, Y, and Z. (X’,Y’,Z’) and no variables are complemented for

 The standard order is X, then Y, then Z. Maxterm 0 (X,Y,Z).

 Minterm 0, called m0 is X’Y’Z’
 The Index 0 (base 10) = 000 (base 2) for three variables).
 Maxterm 0, called M0 is (X + Y + Z)
 All three variables are complemented for minterm 0
 Minterm 6 ?
(X’,Y’,Z’) and no variables are complemented for
 Maxterm 6 ?
Maxterm 0 (X,Y,Z).

11/17/2024 SOP and POS 11 11/17/2024 SOP and POS 12

3
 Example Sum of Product (Minterm)
 Express F in the sum of minterms and product of maxterms  The Sum of Product (SOP) means that the products of the variables
formats. that are separated by a plus sign. The variables can be
F  A  BC '
complemented or uncomplemented, for-example;

 Solution F  A  BC '  A( B  B ' )(C  C ' )  ( A  A' ) BC '

 ABC  ABC '  AB 'C  AB 'C '  ABC '  A' BC '  A sum of product (minterm) is obtained as follows: For each row

 ABC  ABC '  AB 'C  AB 'C '  A' BC ' of the truth table for which the output is 1, the Boolean term is the

 m7  m6  m5  m4  m2 product of variables that are equal to 1 and the complement of

  2,4,5,6,7  variable that are equal to 0. The sum of these products is the

 0,1,3 desired Boolean equation.

11/17/2024 SOP and POS 13 11/17/2024 SOP and POS 14

Sum of Product (Minterm)… Product of sum (Maxterm)

 One or more AND gates feeding a single OR gate at the output  The Product of Sum (POS) means that the sum of variables that are

AB  CD E  AC E
' ' ' ' separated by a multiplication sign. For example,

 A product of sum expression is obtained as follows: each row of

the truth table for which the output is 0, the Boolean term is the
sum of the variables that are equal 0 plus the complement of the
variables that are equal to 1. The product of these sum is the
desired Boolean equation.
11/17/2024 SOP and POS 15 11/17/2024 SOP and POS 16

4
 Product of sum (Maxterm)… Fundamental Products
 One or more OR gates feeding a single AND gate at the output  The products that produce a high (1) output are called Fundamental
Products. For example, for the two input variables A and B, we
( A  B ' )(C  D '  E )( A  C '  E ' )
have four possible combinations, which are shown in the table
below and the fundamental products corresponding to each;

11/17/2024 SOP and POS 17 11/17/2024 SOP and POS 18

Fundamental Products… Fundamental Products…

 For three input variables or signals a similar idea is applied.

 Whenever the input variable is 0, the same variable is

complemented in the fundamental product.

11/17/2024 SOP and POS 19 11/17/2024 SOP and POS 20

5
 Fundamental Products… Exercises
Question 1

 Find the sum-of-products and product of sums equations from the

given truth table

11/17/2024 SOP and POS 21 11/17/2024 SOP and POS 22

Exercises… Exercises…
Solution Question 2

 A circuit has four inputs P,Q,R,S, representing the natural binary

number 0000=0, to 1111=15. P is the most significant bit. The
circuit has one output, X, which is true if the input to the circuit
represents a prime number and false otherwise. A prime number is
a number which is only divisible by 1 and by itself. Note that
 Note that the Boolean expression from the truth table is the sum of
zero(0000) and one(0001) are not considered as prime numbers.
product (minterms) terms for which the output is;
Design a true table for this circuit, and hence obtain a SOP
expression for X in terms of P,Q,R,S.
11/17/2024 SOP and POS 23 11/17/2024 SOP and POS 24

6
 Exercises… Exercises…
Solution F = P’Q’RS’ + P’Q’RS + P’QR’S + P’QRS + PQ’RS + PQR’S

11/17/2024 SOP and POS 25 11/17/2024 SOP and POS 26

Exercises… Exercises…
Question 3
Driver S.Belt Passenger Sensor Passenger S.Belt Car Start
 A car seat belt interlock requires that the car should only start if the Sensor (A) (B) Sensor (C) (Y)
driver’s seat belt is fastened and either the front passenger seat is
0 0 0 0
unoccupied or the front passenger seat is occupied and the
0 0 1 0
passenger seat belt is fastened. Develop the truth table and write 0 1 0 0
0 1 1 0
the Boolean equation (SOP expression) to realize this system.
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1

11/17/2024 SOP and POS 27 11/17/2024 SOP and POS 28

7
 Exercises… Exercises…
 Car Start = AB’C’ + ABC Question 4
 A control system in an engine for an assembly plant has four fail-
safe sensors, sensor A, B, C and D. The engine should keep
running unless any of the following conditions arise.
 If sensor B is activated.
 If sensor A and sensor C are activated at the same time.
 If sensor B and sensor C are activated at the same time.
 If sensor A, sensor C and sensor D are activated at the same
time.
 Using the condition that the machine shut down as logic 1 and
sensors activated as logic 1, develop the truth table and write the
SOP expression for the system.

11/17/2024 SOP and POS 29 11/17/2024 SOP and POS 30

Exercises… Exercises…
Machine
Sensor Sensor Sensor Sensor
Shutdown
 Y= A’BC’D’ + A’BC’D + A’BCD’ + A’BCD + AB’CD’ + AB’CD
A B C D
Y
0 0 0 0 0
+ ABC’D’ + ABC’D + ABCD’ + ABCD
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 1
0 1 0 1 1
0 1 1 0 1
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
1 0 1 0 1
1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1
11/17/2024 SOP and POS 31 11/17/2024 SOP and POS 32

8
 Exercises… Exercises…
Question 5  SOP

 Convert the following expression to product-of-sum form; A B C F

0 0 0 0
0 0 1 0
= (C+C’)AB + ABC + AB’C’ + (B+B’)(AC’) 0 1 0 0
0 1 1 0
1 0 0 1
= ABC + ABC’ + ABC + AB’C’ + ABC’ + AB’C’ 1 0 1 0
1 1 0 1
1 1 1 1
= ABC + ABC’ + AB’C’

11/17/2024 SOP and POS 33 11/17/2024 SOP and POS 34

Exercises… NAND and NOR Gates in Two level Network

 POS
A B C F
0 0 0 0 =A+B+C
0 0 1 0 =A+B+C’
0 1 0 0 =A+B’+C
0 1 1 0 =A+B’+C’
1 0 0 1
1 0 1 0 =A’+B+C’
1 1 0 1
1 1 1 1
F=(A+B+C) (A+B+C’) (A+B’+C) (A+B’+C’) (A’+B+C’)
11/17/2024 SOP and POS 35 11/17/2024 SOP and POS 36

9
 NAND and NOR Gates in Two level
Combination of Gates
Network…
 The OR gate and AND gates and invertors can be interconnected to
form gating or logic networks, in the switching theory, these are
also called combinational networks.

 The Boolean algebra expression corresponding to a given network

can be driven by systematically progressing from input to output
on the gates.

11/17/2024 SOP and POS 37 11/17/2024 SOP and POS 38

Combination of Gates… Combination of Gates…

 Example: Construct the logic networks for;  Solution

 i)

11/17/2024 SOP and POS 39 11/17/2024 SOP and POS 40

10
 Combination of Gates… Combination of Gates…
 i)  ii)

11/17/2024 SOP and POS 41 11/17/2024 SOP and POS 42

Boolean Expressions and Logic Diagrams Exercises

 Boolean expressions are frequently written to describe Question 6
mathematically the behavior of a logic circuit. Using a truth table  Write the Boolean expression that describes mathematically the
and the Boolean expression, one can determine which behavior of logic circuit shown below. Use a truth table to
combinations of input signals cause the output signal. determine what input conditions produce a logic 1 output.

11/17/2024 SOP and POS 43 11/17/2024 SOP and POS 44

11
 Exercises… Exercises…
Solution

 Thus the input conditions those produce a logic 1 output are : 000,
100, 110

11/17/2024 SOP and POS 45 11/17/2024 SOP and POS 46

Exercises… Exercises…
Question 7 Solution

 Given the Boolean expression;  a)

(a) Draw the logic diagram for the expression.

(b) Minimize the expression.

(c) Draw the logic diagram for the reduced expression.

11/17/2024 SOP and POS 47 11/17/2024 SOP and POS 48

12
 Exercises… Exercises…
 b)  c)

11/17/2024 SOP and POS 49 11/17/2024 SOP and POS 50

END

11/17/2024 SOP and POS 51

13