Boolean Algebra

₰ The basic mathematics needed for the study of the logic design of digital systems is BOOLEAN ALGEBRA.
₰ a mathematical notation that generally specifies gate operations
₰ It is used to describe the interconnection of digital gates and to design logic circuits through the
manipulation of Boolean expressions.

Binary Logic
₰ BINARY LOGIC deals with binary variables that take on 2 discrete value and with the operations of
mathematical logic applied to these variables

Truth Table
₰ A TRUTH TABLE is a table of combination of the binary variables showing the relationship between the
values that the variables take on and the values of the result of the operation

Logical Operations
₰ NOT -represented by an apostrophe ( ‘ ) after a variable, or a bar over a variable.
Truth Table: Logic Symbols:
INPUT OUTPUT
X Z X Z
0 1
Z=X’
1 0
Condition: The output signal is the complement of the input signal
₰ AND –represented by a dot ( . ) or by the absence of the operator
Truth Table: Logic Symbols:
INPUT OUTPUT
X Y Z
X
0 0 0 Z
Y
0 1 0
1 0 0 Z=X.Y=XY

1 1 1
Condition: The input signals must be high to make the output signal equal to high
₰ OR –represented by a plus ( + ) symbol.
Truth Table: Logic Symbols:
INPUT OUTPUT
X Y Z
X
0 0 0 Z
Y
0 1 1
1 0 1 Z=X+Y

1 1 1
Condition: At least one signal must be high to make the output signal be high.
₰ NOR –represented by the complement of OR Operator.
Truth Table: Logic Symbols:
INPUT OUTPUT
X Y Z
X
0 0 1 Z
Y
0 1 0
1 0 0 Z=(X+Y)’

1 1 0
Condition: It must low input signals to make the output signal be high or the complement of output signals
in OR Truth Table.
₰ NAND –represented by the complement of AND Operator.
Truth Table: Logic Symbols:
INPUT OUTPUT
X Y Z
X
0 0 1 Z
Y
0 1 1
1 0 1 Z=(XY)’

1 1 0
Condition: At least there is low input signal to make the output be high or the complement of output signals
in AND Truth Table.
₰ NAND –represented by the complement of AND Operator.
Truth Table: Logic Symbols:
INPUT OUTPUT
X Y Z
X
0 0 1 Z
Y
0 1 1
1 0 1 Z=(XY)’

1 1 0
Condition: At least there is low input signal to make the output be high or the complement of output signals
in AND Truth Table.
₰ XOR –represented the EXCLUSIVE OR
Truth Table: Logic Symbols:
INPUT OUTPUT
X Y Z
X
0 0 0 Z
Y
0 1 1
1 0 1 Z=A  B

1 1 0
Condition: The sum of input signals must be an odd integer to make the output signal high
 ₰ XNOR –represented the complement of EXCLUSIVE OR
Truth Table: Logic Symbols:
INPUT OUTPUT
X Y Z
X
0 0 1 Z
Y
0 1 0
1 0 0 Z=(A  B)’

1 1 1
Condition: The sum of input signals must be an even integer to make the output signal high

Boolean Expressions
₰ A BOOLEAN ALGEBRA is an algebra dealing with binary variables (A, B, C, …) and logic operations AND, OR,
NOT).
₰ A BOOLEAN FUNCTION consists of a binary variable denoting the function, an equal sign, and an algebraic
expression formed by using binary variables, the constants 0 and 1, the logic operation symbol, and
parentheses (added as needed to specify the order in which the operations are performed)
Example:
F  X  Y'Z
X Y Z F
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1

₰ A Boolean function can be transformed from an algebraic expression into a circuit diagram composed of
logic gates
Example: Determine the circuit diagram of F=X+Y’Z

X
Y F
Z
Laws and Theorems of Boolean algebra
₰ Operations with 0 and 1
X+0=X X.1=X
X + 1 =1 X.0=0
₰ Idempotent Law
X+X=X X.X=X
₰ Involution Law
(X’)’ = X
₰ Laws of Complementary
X+X’=1 X.X’=0
₰ Commutative Laws
X+Y=Y+X X.Y=Y.X
₰ Associative Laws
(X+Y)+Z = X+(Y+Z) = X+Y+Z (XY) Z = X (YZ) = XYZ
₰ Distributive Laws
X(Y+Z) = XY + XZ X+YZ = (X+Y) (X+Z)
₰ Simplification Theorems
XY + XY’ = X (X+Y) (X+Y’) = X
X+XY = X X (X+Y) = X
(X+Y’)Y = XY XY’+Y = X+Y
₰ De Morgan’s Laws
(X+Y+Z+….)’ = X’Y’Z’… (XYZ…)’ = X’ +Y’ + Z’ +…
₰ Duality
(X+Y+Z+…)D = X Y Z ... (X Y Z ...) D = X+Y+Z+…
₰ Theorems for Multiplying Out and Factoring
(X+Y)(X’+Z) = XZ + X’Y XY + X’Z = (X+Z)(X’+Y)
₰ Consensus Theorem
XY+YZ+X’Z = XY + X’Z (X+Y)(Y+Z)(X’+Z) = (X+Y) (X’+Z)

Algebraic Manipulation
₰ Example: Derive the Boolean expression F = X’YZ + X’YZ’ + XZ
Solution:
F = X’YZ + X’YZ’ + XZ
= X’Y(Z+Z’) + XZ by Distributive Law
= X’Y . 1 + XZ
F = X’Y + XZ
Logic Design Using Truth Table
₰ Example: A switching circuit has three inputs and one output as shown. The input signals A, B, and C
represent the first, second, and third bits respectively of a binary number N and f represents the output
signal of the circuit. The output f = 1 if N is equal to or greater than 011(3) and f = 0 if N is less than 011(3).
₰ Solution:
A B C f
0 0 0 0
A
0 0 1 0
B f
0 1 0 0
C
0 1 1 1
1 0 0 1
1 0 1 1 f=A’BC + AB’C’ + AB’C + ABC’ + ABC

1 1 0 1 = A’BC + B’ + AB

1 1 1 1 = A’BC + A
f = A + BC

Minterm Expansion
₰ A LITERAL is a variable or its complement.
₰ When a function f is written as a sum of minterms, this is referred to as a minterm expansion or a standard
sum of products
₰ In general, a MINTERM of n variables is a product of n literals in which each variable appears exactly once in
either true form or complemented form.
₰ If f = 1 for row I of the truth table, then mi must be present in the expansion because m i = 1 only for the
combination of values of the variables corresponding to row i of the table.
₰ Example: f=A’BC + AB’C’ + AB’C + ABC’ + ABC
Row No. ABC Minterm Designation
0 000 A’B’C’ m0
1 001 A’B’C m1
f = A’BC + AB’C’ + AB’C + ABC’ + ABC
2 010 A’BC’ m2
3 011 A’BC m3 f (A, B, C) = m3 + m4 + m5 + m6 + m7

4 100 AB’C’ m4 f (A, B, C) = Σ m(3, 4, 5, 6, 7)

5 101 AB’C m5
6 110 ABC’ m6
7 111 ABC m7

Maxterm Expansion
₰ A MAXTERM of n variables is the sum of n literals in which each variable appears exactly once in either true
or complemented form.
₰ Each maxterm has a value of 0 for exactly one combination of values for A, B, and C
₰ When a function f is written as a product of maxterms, this is referred to as a maxterm expansion or
standard product of sums.
 ₰ If f = 0for row i of the truth table, then Mi must be present in the maxterm expansion because Mi = 0 only for
the combination of values of the variables corresponding to row i of the table.
₰ Each maxterm has a value of 0 for exactly one combination of values for A, B, and C
₰ Each maxterm is the complement of the corresponding minterm, that is, M i = m’i
₰ Example: f = (A + B +C)(A+B+C’)(A+B’+C)
Row No. ABC Minterm Designation
0 000 A+B+C m0
1 001 A+B+C’ m1 f = (A + B +C) (A+B+C’) (A+B’+C)
2 010 A+B’+C m2 f (A, B, C) = M0M1M2
3 011 A+B’+C’ m3 f (A, B, C) = Π M(0,1,2)
4 100 A’+B+C m4
5 101 A’+B+C’ m5
6 110 A’+B’+C m6
7 111 A’+B’+C’ m7

Complementary of Minterm and Maxterm Expansion

₰ Given the minterm or maxterm expansions for f, the minterm or maxterm expansions for the complement of
f are easy to obtain.
₰ Because f’ = 1 when f = 0, the minterm expansion for f’ contains the minterms not present in f.
₰ Example:
f (A,B,C) = m3 + m4 + m5 + m6 + m7
f’ = (m3 + m4 + m5 + m6 + m7)’ = m’3 m’4 m’5 m’6 m’7 = M3 M4 M5 M6 M7

f (A, B, C) = Π M(0,1,2) = M0M1M2

f’ = (M0M1M2)’ = M’0 + M’1 + M’2 = m0 + m1 + m2

Application of Minterm and Maxterm Expansion of the function

₰ Example 1: Find the minterm expansion of the function f(X, Y, Z) based on the given truth table
Row No. XYZ f Designation
0 000 1 m0
1 001 0 m1 f (X, Y, Z) = X’Y’Z’ + X’YZ’ + XY’Z + XYZ
2 010 1 m2 f (X, Y, Z) = m0 + m2 + m5 + m7
3 011 0 m3 f (X, Y, Z) = Σ m(0,2,5,7)
4 100 0 m4
5 101 1 m5
6 110 0 m6
7 111 1 m7
₰ Example 2: Find the minterm expansion of f’ based on the given truth table of the function f(X, Y, Z)
Row No. XYZ f Minterm f’
0 000 1 m0 0 f’ (X, Y, Z) = X’Y’Z + X’YZ + XY’Z’ + XYZ’
1 001 0 m1 1 f’ (X, Y, Z) = m1 + m3 + m4 + m6
2 010 1 m2 0
f’ (X, Y, Z) = Σ m(1,3,4,6)
3 011 0 m3 1
4 100 0 m4 1
5 101 1 m5 0
6 110 0 m6 1
7 111 1 m7 0
₰ Example 3: From the previous Example, find the maxterm expansion of the function f’ (X, Y, Z) = Σ m(1,3,4,6)
Row No. XYZ f Minterm f’ Maxterm
f’ (X, Y, Z) = m1 + m3 + m4 + m6
0 000 1 m0 0 M0
Taking the complement of f’:
1 001 0 m1 1 M1
2 010 1 m2 0 M2 f (X, Y, Z) = (m1 + m3 + m4 + m6)’ = m’1 m’3 m’4 m’6

3 011 0 m3 1 M3 but m’I = Mi

4 100 0 m4 1 M4 f (X, Y, Z) = M1 M3 M4 M6

5 101 1 m5 0 M5 f (X, Y, Z) = (X+Y+Z’)(X+Y’+Z’)(X’+Y+Z)(X’+Y’+Z)

6 110 0 m6 1 M6 f (X, Y, Z) = Π M (1,3,4,6)
7 111 1 m7 0 M7
₰ Example 4: Find the minterm expansion of f(a,b,c,d) = a’(b’+d) + acd’
f = a’(b’+d) + acd’
f = a’b’ + a’d + acd’
f = a’b’(c + c’)(d +d’) + a’d(b+b’)(c+c’) + acd’(b+b’)
f = a’b’(cd + cd’ + c’d + c’d’) + a’d(bc + bc’ + b’c + b’c’) + abcd’ + ab’cd’
f = a’b’cd+ a’b’cd’ + a’b’c’d+ a’b’c’d’ + a’bcd + a’bc’d + a’b’cd+ a’b’ + abcd’ + ab’cd’
f = a’b’cd+ a’b’cd’ + a’b’c’d+ a’b’c’d’ + a’bcd + a’bc’d + abcd’ + ab’cd’
0011 0010 0001 0000 0111 0101 1110 1010
3 2 1 0 7 5 14 10
f (a,b,c,d) = Σ m(0,1,2,3,5,7,10,14)
₰ Example 5: Design an adder which adds two 2-bit binary numbers to give a 3-bit binary sum. Find the truth
table for the circuit. The circuit has four inputs and three outputs as shown. Express the output signals as
minterm expansions
A
Adder X
B
C Circuit Y

D Z

N1 = AB AB
N2 = CD + CD
N3 = XYZ XYZ
 N1 N2 N3
Minterm
A B C D X Y Z
0 0 0 0 0 0 0 m0
X = Σ m(7,10,11,13,14,15)
0 0 0 1 0 0 1 m1
Y = Σ m(2,3,5,6,8,9,12,15)
0 0 1 0 0 1 0 m2
Z = Σ m(1,3,4,6,9,11,12,14)
0 0 1 1 0 1 1 m3

0 1 0 0 0 0 1 m4

0 1 0 1 0 1 0 m5

0 1 1 0 0 1 1 m6

0 1 1 1 1 0 0 m7

1 0 0 0 0 1 0 m8

1 0 0 1 0 1 1 m9

1 0 1 0 1 0 0 m10

1 0 1 1 1 0 1 m11

1 1 0 0 0 1 1 m12

1 1 0 1 1 0 0 m13

1 1 1 0 1 0 1 m14

1 1 1 1 1 1 0 m15

Incompletely Specified Function

₰ A large digital system is usually divided into many sub circuits.

W A
X Ckt. A B Ckt. B
Y F
C
Z

₰ If it is assumed that there are no values for w, x, y, and z which will cause A, B, and C to assume values of
001 or 110, the function F is then INCOMPLETELY SPECIFIED.
₰ Either the value is 0 or 1, it will be denoted as X for “don’t care” term
₰ Example: If X1 = 0 and X2 = 0
ABC F Minterm F = A’B’C’ + A’BC + ABC = A’B’C’ + BC
000 1 A’B’C’ m0
If X1 = 1 and X2 = 0
001 X A’B’C m1 F = A’B’C’ + A’B’C + A’BC + ABC = A’B’+BC
010 0 A’BC’ m2 (Simplest Solution)
011 1 A’BC m3 If X1 = 1 and X2 = 1
100 0 AB’C’ m4 F = A’B’C’ + A’B’C + A’BC + ABC’ + ABC
101 0 AB’C m5 F = A’B’ + BC + AB
110 X ABC’ m6 F = Σ m(0,3,7) + Σ d(1,6) -Minterm Expansion
111 1 ABC m7 F = Π M(2,4,5) · Π D(1,6) –Maxterm Expansion
Problems in using Algebraic Procedures
₰ Procedures are difficult to apply in a systematic way
₰ Difficult to tell when you have arrived at a minimum solution

Map
₰ A diagram made up of squares, with each square representing one minterm of the function. A Boolean
function is recognized graphically by those squares whose minterms are included in the function.
₰ Presents a visual diagram of all possible ways a function may be expressed in a standard form. By
recognizing various patterns, the user can derive alternative algebraic expressions for the same function
₰ The simplified expressions produced by the map are always in the sum-of-products or product-of-sums form.

Karnaugh Map
₰ The KARNAUGH MAP is a useful tool for simplifying and manipulating switching functions of three or four
variables, but it can be extended to functions of five or more variables.

2-Variable Map
₰ Consists of 4 squares, one for each minterm
₰ Map: Truth Table:
Y X Y Minterm
0 1
X 0 0 m0 X’Y’
0 m0 m1 0 1 m1 X’Y
1 m2 m3 1 0 m2 XY’
1 1 m3 XY
₰ Example: Derive the equation of the Boolean function F based on the given map
Y
0 1
X
0 1
1 1 1

F = m1 + m2 + m3
F = X’Y + XY’ + XY
F = X’Y + X(Y’+Y)
F = X’Y + X = (X+X’)(X+Y)
F = XY
3-Variable Map
₰ Consists of 8 squares, one for each minterm
₰ Map: Truth Table:
YZ X Y Z Minterm
00 01 11 10 0 0 0 m0 X’Y’Z’
X
0 m0 m1 m3 m2 0 0 1 m1 X’Y’Z
1 m4 m5 m7 m6 0 1 0 m2 X’YZ’
0 1 1 m3 X’YZ
1 0 0 m4 XY’Z’
1 0 1 m5 XY’Z
1 1 0 m6 XYZ’
1 1 1 m7 XYZ
 ₰ Basic Properties of Adjacent squares: Any two (2) adjacent squares placed horizontally or vertically (but not
diagonally) to form a rectangle correspond to minterms that differ in only a single variable.
₰ Simplification Process:
1. One square represents a minterm of 3 literals
2. A rectangle of 2 squares represents a product term of 2 literals
3. A rectangle of 4 squares represents a product term of 1 literal
4. A rectangle of 8 squares produces a function that is equal to 1
₰ Example: Simplify the given Boolean function using a map F (X,Y,Z) = Σ m(2,3,4,5)
YZ
00 01 11 10
X
0 1 1
1 1 1

F = X’Y + XY’
₰ Example: Simplify the given Boolean function using a map F (X,Y,Z) = Σ m(0,2,4,6)
YZ
00 01 11 10
X
0 1 1
1 1 1

F = Z’

4-Variable Map
₰ Consists of 16 squares, one for each minterm
₰ Map: Truth Table:
YZ W X Y Z Minterm
00 01 11 10 0 0 0 0 m0 W’X’Y’Z’
WX
00 m0 m1 m3 m2 0 0 0 1 m1 W’X’Y’Z
01 m4 m5 m7 m6 0 0 1 0 m2 W’X’YZ’
11 m12 m13 m15 m14 0 0 1 1 m3 W’X’YZ
10 m8 m9 m11 m10 0 1 0 0 m4 W’XY’Z’
0 1 0 1 m5 W’XY’Z
0 1 1 0 m6 W’XYZ’
0 1 1 1 m7 W’XYZ
1 0 0 0 m8 WX’Y’Z’
1 0 0 1 m9 WX’Y’Z
1 0 1 0 m10 WX’YZ’
1 0 1 1 m11 WX’YZ
1 1 0 0 m12 WXY’Z’
1 1 0 1 m13 WXY’Z
1 1 1 0 m14 WXYZ’
1 1 1 1 m15 WXYZ
 ₰ Simplification Process:
1. One square represents a minterm of 4 literals
2. A rectangle of 2 squares represents a product term of 3 literals
3. A rectangle of 4 squares represents a product term of 2 literals
4. A rectangle of 8 squares represents a product term of 1 literal
5. A rectangle of 16 squares produces a function that is equal to 1
₰ Example: Simplify the given Boolean function using a map. F (W,X,Y,Z) = Σ m(0,1,2,4,5,6,8,9,12,13,14)
YZ
00 01 11 10
WX
00 1 1 1 F = Y’ + W’Z’ + XZ’
01 1 1 1
11 1 1 1
10 1 1

Prime Implicants
₰ A product term obtained by combining the maximum possible number of adjacent squares in the map.
₰ A single 1 on a map represents a prime Implicants if it is not adjacent to any other 1’s.
₰ Two adjacent 1’s form a prime implicants, provided they are not within a group of 4 adjacent squares.
₰ Four adjacent 1’s form a prime implicants if they are not within a group of 8 adjacent squares.
₰ If a minterm in a square is covered only by one prime implicant, that prime implicant is said to be essential.
₰ Example: Simplify the given Boolean function using a map. F (A,B,C,D) = Σ m(1,3,4,5,6,7,12,14)
CD
00 01 11 10
AB
00 1 1
01 1 1 1 1 F = A’D + BD’
11 1 1
10
₰ Example: Simplify the given Boolean function using a map. F (A,B,C,D) = Σ m(0,5,10,11,12,13,15)
CD
00 01 11 10
AB
00 1
01 1 F = A’B’C’D’ + BC’D + ABC’ + ACD + AB’C
11 1 1 1
10 1 1

Product-of-Sums Simplification
₰ The procedure for obtaining a simplified expression from sum-of-product to the product-of-sum form can be
obtained from the basic properties of Boolean functions
₰ The 1’s placed in the squares of the map represent the minterms of the function. The minterms not included
in the function represents the complement of the function.
₰ The minterms not included in the function is represented in the map by the squares not marked by 1’s
₰ The simplified expression of the function is obtained by marking the empty squares with 0’s and combining
them into valid rectangles
₰ To obtain the function F as a product of sums, take the complement of F’ (by taking the dual and
complementing each literal).
 ₰ Example: Simplify the given Boolean function in POS form. F (W,X,Y,Z) = Σ m(0,1,2,5,8,9,10)
YZ
00 01 11 10
WX F’ = WX + YZ + XZ’
00 1 1 0 1
(F’ = WX + YZ + XZ’)’
01 0 1 0 0
11 0 0 0 0 F=(W’+X’)(Y’+Z’)(X’+Z)
10 1 1 0 1

Don’t Care Conditions

₰ The minterms of a Boolean function specify all combinations of variable values for which a function is equal
to 1. The function is assumed to be equal to 0 for the rest of the minterms.
₰ This assumption, however, is not always valid, since there are applications n which the function is not
specified for certain variable combinations
₰ Case 1: THE INPUT COMBINATIONS NEVER OCCUR
₰ Example: The 4-bit binary code for the decimal digit has six combinations that are not used and not
expected to occur
₰ Case 2: THE INPUT COMBINATIONS ARE EXPECTED TO OCCUR, BUT WE DO NOT CARE WHAT THE OUTPUTS
ARE IN RESPONSE TO THESE COMBINATIONS.
₰ Functions that have unspecified outputs for some input combinations are called INCOMPLETELY
UNSPECIFIED FUNCTIONS
₰ It is customary to call the unspecified minterms of a function don’t-care conditions.
₰ A don’t-care condition is represented by X.
₰ In choosing adjacent squares to simplify the function in the map, the don’t-care minterms may be assumed
to be either 0 or 1.
₰ Example: Consider the incompletely unspecified function F that has three(3) don’t-care conditions:
F(W,X,Y,Z) = ∑ m(1,3,7,11,15)
d(W,X,Y,Z) = ∑ m(0,2,5)
YZ
00 01 11 10
WX
00 X 1 1 X
F=W’X’ + YZ
01 X 1
11 1
10 1

YZ
00 01 11 10
WX
00 X 1 1 X
F=W’Z + YZ
01 X 1
11 1
10 1
5-Variable Map
₰ Consists of 32 squares, one for each minterm
₰ consists of two(2) 4-variable maps (V,W,X,Y,Z)
₰ Variable V distinguishes between the two maps.
₰ One 4-variable map represents the 16 squares where V = 0.
₰ The other 4-variable map represents the other 16 squares where V = 1.
₰ Minterms 0 through 15 belong with V = 0. Minterms 16 through 31 belong with V = 1.
₰ Each 4-variable map retains the previously defined adjacency when taken separately.
₰ Each square in the V = 0 map is adjacent to the corresponding square in the V = 1 map.
₰ Map: Truth Table:
YZ V W X Y Z V W X Y Z
00 01 11 10 0 0 0 0 0 m0 1 0 0 0 0 m16
WX
00 m0 m1 m3 m2 0 0 0 0 1 m1 1 0 0 0 1 m17
01 m4 m5 m7 m6 0 0 0 1 0 m2 1 0 0 1 0 m18
11 m12 m13 m15 m14 0 0 0 1 1 m3 1 0 0 1 1 m19
10 m8 m9 m11 m10 0 0 1 0 0 m4 1 0 1 0 0 m20
V=0 0 0 1 0 1 m5 1 0 1 0 1 m21
0 0 1 1 0 m6 1 0 1 1 0 m22
0 0 1 1 1 m7 1 0 1 1 1 m23
YZ 0 1 0 0 0 m8 1 1 0 0 0 m24
00 01 11 10
WX 0 1 0 0 1 m9 1 1 0 0 1 m25
00 m16 m17 m19 m18 0 1 0 1 0 m10 1 1 0 1 0 m26
01 m20 m21 m23 m22 0 1 0 1 1 m11 1 1 0 1 1 m27
11 m28 m29 m31 m30 0 1 1 0 0 m12 1 1 1 0 0 m28
10 m24 m25 m27 m26 0 1 1 0 1 m13 1 1 1 0 1 m29
V=1 0 1 1 1 0 m14 1 1 1 1 0 m30
0 1 1 1 1 m15 1 1 1 1 1 m31

₰ Example: Simplify the given Boolean function using a map. F (V,W,X,Y,Z) = Σ m(0,2,4,6,9,13,21,23,25,29,31)
YZ
00 01 11 10
WX
00 1 1
01 1 1
11 1
10 1
V=0

F=V’W’Z’ + VXZ + WY’Z

YZ
00 01 11 10
WX
00
01 1 1
11 1 1
10 1
V=1
6-Variable Map
₰ Consists of 32 squares, one for each minterm
₰ Map:
DEF
ABC 000 001 011 010 110 111 101 100
000 m0 m1 m3 m2 m6 m7 m5 m4
001 m8 m9 m11 m10 m14 m15 m13 m12
011 m24 m25 m27 m26 m30 m31 m29 m28
010 m16 m17 m19 m18 m22 m23 m21 m20
110 m48 m49 m51 m50 m54 m55 m53 m52
111 m56 m57 m59 m58 m62 m63 m61 m60
101 m40 m41 m43 m42 m46 m47 m45 m44
100 m32 m33 m35 m34 m38 m39 m37 m36

Quine-Mc Clusky Minimization Technique

₰ The Quine-McClusky algorithm is useful for minimizing Boolean expressions and therefore logic gates.
₰ It is easily implemented as an automated computer aided design (CAD) tool while the Karnaugh map
method is not.
₰ Parts of Quine-McClusky Method
1. Determination of prime implicants
2. Selection of a set of prime implicants that covers the given function and has the lowest cost
Seatwork Compilation
Problem 1: Simplify the given Boolean expression to a minimum number of literals.
(a) xyz + x’y + xyz’ (b) (x + y)’ (x’ + y’)
Solution: Solution:
xyz + x’y + xyz’ (x+y)’(x’+y’)
xy(z+z’) + x’y but (z+z’) = 1 (x’y’)(x’+y’)
xy + x’y x’y’+x’y’
y(x+x’) but (x+x’) = 1 Answer: x’y’
Answer: y
Problem 2: Using algebraic manipulation, reduce the given Boolean Expression to its simplest form.
A’B (D’+C’D) + B (A+A’CD)
Solution:
A’B (D’+C’D) + B (A+A’CD)
A’BD’ + A’BC’D + AB + A’BCD
A’B (CD+C’D) + AB + A’BD’
A’BD+AB+ A’BD’
A’B(D+D’)+AB
A’B+AB
B(A+A’)
Answer: B
Problem 3: Using scientific means, determine the minterm expansion for the given function F = X’Y +XY’ + Y’Z’
Solution:
F = X’Y +XY’ + Y’Z’
F = X’Y(Z+Z’) + XY’(Z+Z’) + Y’Z’(X+X’)
F = X’YZ + X’YZ’ + XY’Z + XY’Z’ + XY’Z’ + X’Y’Z’
F = X’YZ + X’YZ’ + XY’Z + XY’Z’ + X’Y’Z’
011 010 101 100 000
3 2 5 4 0
Answer: F(X,Y,Z) = Σm (0,2,3,4,5)
Problem 4: Using scientific means, simplest the given Boolean expression using 3-variable map. F(X,Y,Z) = YZ + X’Y’Z’ +
X’YZ’
Solution:
F(X,Y,Z) = YZ + X’Y’Z’ + X’YZ’ YZ
00 01 11 10
X
= YZ(X+X’) + X’Y’Z’ + X’YZ’ 0 1 1 1
=XYZ + X’YZ + X’Y’Z’ + X’YZ’ 1 1

111 011 000 010

Answer: F = X’Z’+ YZ
7 3 0 2
F(X,Y,Z) = Σm (0,2,3,7)
Problem 5: Find the complement of XY’ + X’Y
Solution:
F = XY’ + X’Y
F’ = (XY’ + X’Y)’
Answer: F’ = (X’+Y)(X+Y’)
Problem 6: Simplify the given Boolean expression to a minimum number of literals.
(a) xyz + x’y + xyz’ (b) (A + B)’ (A’ + B’)’
Solution: Solution:
xyz + x’y + xyz’ (A + B)’ (A’ + B’)’
xy(z+z’) + x’y but (z+z’) = 1 (A’B’)(AB)
xy + x’y Answer: 0
y(x+x’) but (x+x’) = 1
Answer: y
Problem 7: Using algebraic manipulation, reduce the given Boolean Expression to its simplest form.
a. A’C’ + ABC + AC’
Solution:
A’C’ + A (C+C’) (C’+B)
A’C’ + AC’ +AB
C’(A+A’) + AB
Answer: AB + C’
b. A’B (D’+C’D) + B (A’+A’CD)
Solution:
A’B (D’+C’D) + B (A’+A’CD)
A’BD’ + A’BC’D + A’B + A’BCD
A’B (CD+C’D) + A’B + A’BD’
A’BD+A’B+ A’BD’
A’B(D+D’)+A’B
A’B+A’B
B(A’+A’)
Answer: A’B
Problem 8: Using scientific means, determine the minterm expansion for the given function F = X’Y +XY’ + Y’Z’
Solution:
F = XY +XY’ + Y’Z
F = XY(Z+Z’) + XY’(Z+Z’) + Y’Z(X+X’)
F = XYZ + XYZ’ + XY’Z + XY’Z’ + XY’Z + X’Y’Z
F = XYZ + XYZ’ + XY’Z + XY’Z’ + X’Y’Z
111 110 101 100 001
7 6 5 4 1
Answer: F(X,Y,Z) = Σm (1,4,5,6,7)
Problem 9: Using scientific means, simplest the given Boolean expression using 3-variable map. F(X,Y,Z) = XY + X’Y’Z’
+ X’YZ’
Solution:
F(X,Y,Z) = XY + X’Y’Z’ + X’YZ’ YZ
00 01 11 10
X
= XY (Z+Z’) + X’Y’Z’ + X’YZ’ 0 1 1
=XYZ + XYZ’ + X’Y’Z’ + X’YZ’ 1 1 1

111 110 000 010

Answer: F = XY + X’Z’
7 6 0 2
F(X,Y,Z) = Σm (0,2,6,7)
Quiz Compilation
Problem 1 SET A: Simplify the given Boolean Expression to a minimum number of literals in POS form. X’Y’ + XYZ + X’Y
Note. Show step by step process and box your final answer.
Solution:
F = X’Y’ + XYZ + X’Y
F = X’ (Y+Y’) + XYZ
F = X’ + XYZ
F = (X’+X) (X’+YZ)
F = X’ + YZ
F = (X’+Y) (X’+Z)
Answer: F = (X’+Y) (X’+Z)
Problem 2 SET A: Reduce the given Boolean Expression to its simplest form
a. (A’+C)(A’+C’)(A+B+C’D) express your answer in SOP form.
b. A’B + A’C’D express your answer in POS form.
Solution:
a. (A’+C)(A’+C’)(A+B+C’D)
= (A’A’ + A’C’ + A’C + CC’) (A+B+C’D) but A’.A’ = A’; CC’ = 0
= (A’C’ + A’C) (A + B +C’D)
= (A’ (C+C’)) (A + B + C’D) but C+C’=1
= A’ (A+B+C’D)
= AA’ + A’B + A’C’D but A.A’=0
Answer: A’B + A’C’D
b. A’B + A’C’D
= A’ (B+C’D)
= A’ (B+C’) (B+D)
Answer: A’ (B+C’) (B+D)
Problem 3 SET A: Determine the complement of the given expressions (V’W+X)Y + Z’
Solution:
(V’W+X)Y + Z’
=[(V’W+X)Y + Z’]’
=[(V+W’)(X’)+Y’]Z
Answer: [(V+W’) (X’) + Y’] Z
Problem 4 SET A: Determine the minterm expansion of the given Boolean expression. F (A, B, C, D) = A’B’C’D’ + AC’D’
+ B’CD’ + A’BCD + BC’D
Solution:
F (A, B, C, D) = A’B’C’D’ + AC’D’ + B’CD’ + A’BCD + BC’D
F (A, B, C, D) = A’B’C’D’ + AC’D’ (B + B’) + B’CD’ (A + A’) + A’BCD + BC’D (A+A’)
F (A, B, C, D) = A’B’C’D’ + ABC’D’ + AB’C’D’ + AB’CD’ + A’B’CD’ + A’BCD + ABC’D + A’BC’D
0000 1100 1000 1010 0010 0111 1101 0101
0 12 8 10 2 7 13 5
Answer: F (A, B, C, D) = Σ m (0, 2, 5, 7, 8, 10, 12, 13)
Problem 5 SET A: Using a 4-variable map, determine the simplest expression in POS form for the given function in
Problem 4. Your answer should conform to your minterm expansion in Problem 4.

Solution:
F (A, B, C, D) = Σ m (0, 2, 5, 7, 8, 10, 12, 13)

CD
00 01 11 10
AB
00 1 0 0 1
01 0 1 1 0
11 1 1 0 0
10 1 0 0 1

F’ = A’BD’ + ABC + B’D

F’ = [A’BD’ + ABC + B’D]’
Answer: F = (A+B’+D) (A’ + B’ + C’) (B + D’)
Problem 1 SET B: Using algebraic manipulation simplify the given Boolean expression to a minimum number of
literals in POS. F = X’Y’ + XYZ + X’Y
Solution:
F = X’Y’ + XYZ + X’Y
F = X’ (Y+Y’) + XYZ
F = X’ + XYZ
F = (X’+X) (X’+YZ)
F = X’ + YZ
F = (X’+Y) (X’+Z)
Answer: F = (X’+Y) (X’+Z)
Problem 2 SET B: Determine the complement of the given Boolean expression. F = WX (Y’Z + YZ’) + W’X’ (Y’ + Z) (Y+Z’)
Solution:
F = WX (Y’Z + YZ’) + W’X’ (Y’ + Z) (Y+Z’)
F’ = [WX (Y’Z + YZ’) + W’X’ (Y’ + Z) (Y+Z’)]’
F’ = [W’+X’ + (Y+Z’)(Y’+Z)][(W+X)+(YZ’)+(Y’Z)]
Answer: F’ = [W’+X’ + (Y+Z’) (Y’+Z)] [W+X + YZ’ + Y’Z]
Problem 3 SET B: Simplify the given Boolean function in POS form F (W, X, Y, Z) = Σ m (0, 1, 2, 6, 8, 9, 10, 13)
Solution:
F (W, X, Y, Z) = Σ m (0, 1, 2, 6, 8, 9, 10, 13)

YZ
00 01 11 10
WX
00 1 1 0 1
01 0 0 0 1
11 0 1 0 0
10 1 1 0 1

F’ = WXZ’ + W’XY’ + YZ
F = [WXZ’ + W’XY’ + YZ]’
F = (W’ + X’ + Z) (W + X’ + Y) (Y’ + Z’)
Answer: F = (W’ + X’ + Z) (W + X’ + Y) (Y’ + Z’)
Problem 4 SET B: Determine the non-essential prime implicants of a (specific product terms) for each of the given
Boolean function
a. F (W, X, Y, Z) = Σ m (0, 2, 4, 5, 6, 7, 8, 10, 13, 15)
Solution:

YZ 00 01 11 10
WX
00 1 1
01 1 1 1 1
11 1 1
10 1 1

F = XZ + W’Z’ + X’Z’
Answer: The non-essential prime implicants are W’Z’, X’Z’
b. F (A, B, C, D) = Σ m (1, 3, 4, 5, 9, 10, 11, 12, 13, 14, 15)
Solution:

CD 00 01 11 10
AB
00 1 1
01 1 1
11 1 1 1 1
10 1 1 1

F = BC’ + AC + B’D
Answer: The non-essential prime implicants are B’D, AC
c. F (A, B, C, D) = Σ m (1, 3, 4, 5, 10, 11, 12, 13, 14, 15)
Solution:

CD 00 01 11 10
AB
00 1 1
01 1 1
11 1 1 1 1
10 1 1

F = A’B’D + BC’ + AC
Answer: There are no non-essential prime implicants
Problem 1 SET C: Using a map, determine the simplest expression in SOP form for the given function.
F (W, X, Y, Z) = X’Z + W’XY’ + W (X’Y + XY’)
Solution:
F (W, X, Y, Z) = X’Z + W’XY’ + W (X’Y + XY’)
F (W, X, Y, Z) = X’Z + W’XY’ + WX’Y + WXY’
F (W, X, Y, Z) = X’Z (W+W’) (Y+Y’) + W’XY’ (Z+Z’) + WX’Y (Z+Z’) + WXY’ (Z+Z’)
F (W, X, Y, Z) = (WX’Z + W’X’Z) (Y+Y’) + W’XY’Z+ W’XY’Z’ + WX’YZ+ WX’Y Z’ + WXY’Z+ WXY’Z’
F (W, X, Y, Z) = WX’YZ + WX’ Y’Z + W’X’YZ + W’X’Y’Z + W’XY’Z+ W’XY’Z’ + WX’YZ+ WX’Y Z’ + WXY’Z+ WXY’Z’
F (W, X, Y, Z) = WX’YZ + WX’Y’Z + W’X’YZ + W’X’Y’Z + W’XY’Z+ W’XY’Z’ + WX’Y Z’ + WXY’Z+ WXY’Z’
1011 1001 0011 0001 0101 0100 1010 1101 1100
11 9 3 1 5 4 10 13 12
F (W, X, Y, Z) = Σ m (1, 3, 4, 5, 9, 10, 11, 12, 13)

YZ 00 01 11 10
WX
00 1 1
01 1 1
11 1 1
10 1 1 1

Answer: F = XY’ + X’Z + WX’Y

Problem 2 SET C: Reduce the given Boolean Expression to its simplest form and express your answer in SOP form.
(A’+C)(A’+C’)(A+B+C’D)
Solution:
(A’+C)(A’+C’)(A+B+C’D)
= (A’A’ + A’C’ + A’C + CC’) (A+B+C’D) but A’.A’ = A’; CC’ = 0
= (A’C’ + A’C) (A + B +C’D)
= (A’ (C+C’)) (A + B + C’D) but C+C’=1
= A’ (A+B+C’D)
= AA’ + A’B + A’C’D but A.A’=0
Answer: A’B + A’C’D
Problem 3 SET C: Given F (A, B, C, D) = Σ m (2, 6, 11, 13) and d (A, B, C, D) = Σ m (4, 5, 7, 9, 10, 15), simplify in POS
form. Find the logic diagram (must conform with the answer)
Solution:

YZ 00 01 11 10
WX
00 0 0 0 1
01 X X X 1
11 0 1 X 0
10 0 X 1 X

F = A’C’ + A’D + AD’

F’ = (A’C’ + A’D + AD’)’
F’ = (A+C) (A +D’) (A’ + D)
Answer: F’ = (A+C) (A +D’) (A’ + D)
 A
(A+C)
C

(A+D') F'=(A+C)(A+D')(A'+D)
D

(A'+D)

Problem 4 SET C: Determine the essential prime implicants of a (specific product terms) for each of the given Boolean
function
a. F (W, X, Y, Z) = Σ m (0, 2, 4, 5, 6, 7, 8, 10, 13, 15)
Solution:

YZ 00 01 11 10
WX
00 1 1
01 1 1 1 1
11 1 1
10 1 1

F = XZ + W’X + X’Z’
Answer: The essential prime implicants are XZ
b. F (A, B, C, D) = Σ m (1, 3, 4, 5, 9, 10, 11, 12, 13, 14, 15)
Solution:

CD 00 01 11 10
AB
00 1 1
01 1 1
11 1 1 1 1
10 1 1 1

F = BC’ + AC + B’D
Answer: The essential prime implicants are BC’
c. F (A, B, C, D) = Σ m (1, 3, 4, 5, 10, 11, 12, 13, 14, 15)
Solution:

CD 00 01 11 10
AB
00 1 1
01 1 1
11 1 1 1 1
10 1 1

F = A’B’D + BC’ + AC Answer: There essential prime implicants are BC’, A’B’D and AC
Problem 1 SET C: In consideration with the most economical design of digital circuits, determine the essential prime
implicants (if there is any) for the given Boolean expression
a. F (W, X, Y, Z) = Σ m (0, 2, 4, 5, 6, 7, 8, 10, 13, 15)
Solution:

YZ 00 01 11 10
WX
00 1 1
01 1 1 1 1
11 1 1
10 1 1

F = XZ + W’X + X’Z’
Answer: The essential prime implicants are XZ
b. F (A, B, C, D) = Σ m (1, 3, 4, 5, 9, 10, 11, 12, 13, 14, 15)
Solution:

CD 00 01 11 10
AB
00 1 1
01 1 1
11 1 1 1 1
10 1 1 1

F = BC’ + AC + B’D
Answer: The essential prime implicants are BC’
c. F (A, B, C, D) = Σ m (1, 3, 4, 5, 10, 11, 12, 13, 14, 15)
Solution:

CD 00 01 11 10
AB
00 1 1
01 1 1
11 1 1 1 1
10 1 1

F = A’B’D + BC’ + AC
Answer: There essential prime implicants are BC’, A’B’D and AC
Problem 2 SET C: Determine the complement of the given expression WX (Y’Z+YZ’) + W’X’(Y’+Z)(Y+Z’). Show the step-
by-step solution
Solution:
F = WX (Y’Z + YZ’) + W’X’ (Y’ + Z) (Y+Z’)
F’ = [WX (Y’Z + YZ’) + W’X’ (Y’ + Z) (Y+Z’)]’
F’ = [W’+X’ + (Y+Z’) (Y’+Z)][(W+X)+(YZ’)+(Y’Z)]
Answer: F’ = [W’+X’ + (Y+Z’) (Y’+Z)] [W+X + YZ’ + Y’Z]
Problem 3 SET C: Given F (A, B, C, D) = Σ m (2, 6, 11, 13) and d (A, B, C, D) = Σ m (4, 5, 7, 9, 10, 15), simplify the
Boolean Function with the Don’t Care conditions in POS form. Show clearly how you arrived at your answer truth
table, maps Find the logic diagram (must conform with the answer)
Solution:
W X Y Z Minterm F
0 0 0 0 m0 0
0 0 0 1 m1 0
CD 00 01 11 10
0 0 1 0 m2 1
AB
0 0 1 1 m3 0
00 0 0 0 1
0 1 0 0 m4 X
01 X X X 1
0 1 0 1 m5 X
11 0 1 X 0
0 1 1 0 m6 1
10 0 X 1 X
0 1 1 1 m7 X
1 0 0 0 m8 0
F = A’C’ + A’D + AD’
1 0 0 1 m9 X
F’ = (A’C’ + A’D + AD’)’ 1 0 1 0 m10 X
F’ = (A+C) (A +D’) (A’ + D) 1 0 1 1 m11 1
1 1 0 0 m12 0
Answer: F’ = (A+C) (A +D’) (A’ + D) 1 1 0 1 m13 1
1 1 1 0 m14 0
1 1 1 1 m15 X

Problem 4 SET C: Simplify the given Boolean function by using a map in SOP form
F (A, B, C, D, E)= Σ m (0, 1, 4, 5, 16, 17, 21, 25, 29)
Solution:
DE DE
00 01 11 10 00 01 11 10
BC BC
00 1 1 00 1 1
01 1 1 01 1
11 11 1
10 10 1
A=0 A=1
Answer: F = A’BD’ + AD’E + B’C’D’

Problem 5 SET C: [[(X+Y+Z) (X’Y’)’] XZ] + X’Y + YZ Given that X+Y=1 and XY=0, reduce the given expression to a
minimum number of literals in SOP in the least number of steps.
Solution:
F = [[(X+Y+Z) . (X’Y’)’] XZ] + X’Y + YZ
Since X+Y=1 and XY=0
F = [[(1+Z). (X+Y)] XZ] + X’Y + YZ but X+Y = 1 and Z+1= 1
F = [[(1). (1)] XZ] + X’Y + YZ but 1.1=1
F = [1.XZ] + X’Y+YZ
F = XZ + X’Y + YZ
F = Z(X+Y) + X’Y but X+Y = 1
F = Z + X’Y
Answer: F = Z+X’Y
Problem 1 SET D: Given that X+Y=1 and XY=0, reduce the given expression to a minimum number of literals in SOP in
the least number of steps. [[(X+Y+Z) (X’Y’)’] XZ] + X’Y + YZ
Solution:
F = [[(X+Y+Z) . (X’Y’)’] XZ] + X’Y + YZ
Since X+Y=1 and XY=0
F = [[(1+Z). (X+Y)] XZ] + X’Y + YZ but X+Y = 1 and Z+1= 1
F = [[(1). (1)] XZ] + X’Y + YZ but 1.1=1
F = [1.XZ] + X’Y+YZ
F = XZ + X’Y + YZ
F = Z(X+Y) + X’Y but X+Y = 1
F = Z + X’Y Answer: F = Z+X’Y
Problem 2 SET D: In consideration with the most economical design of digital circuits, determine the essential prime
implicants (if there is any) for the given Boolean expression
a. F (W, X, Y, Z) = Σ m (0, 2, 4, 5, 6, 7, 8, 10, 13, 15)
Solution:

YZ 00 01 11 10
WX
00 1 1
01 1 1 1 1
11 1 1
10 1 1

F = XZ + W’X + X’Z’
Answer: The essential prime implicants are XZ
b. F (A, B, C, D) = Σ m (1, 3, 4, 5, 9, 10, 11, 12, 13, 14, 15)
Solution:

CD 00 01 11 10
AB
00 1 1
01 1 1
11 1 1 1 1
10 1 1 1

F = BC’ + AC + B’D
Answer: The essential prime implicants are BC’
c. F (A, B, C, D) = Σ m (1, 3, 4, 5, 10, 11, 12, 13, 14, 15)
Solution:

CD 00 01 11 10
AB
00 1 1
01 1 1
11 1 1 1 1
10 1 1

F = A’B’D + BC’ + AC Answer: There essential prime implicants are BC’, A’B’D and AC
Problem 3 SET D: Determine the complement of the given expression WX (Y’Z+YZ’) + W’X’(Y’+Z)(Y+Z’). Show the step-
by-step solution
Solution:
F = WX (Y’Z + YZ’) + W’X’ (Y’ + Z) (Y+Z’)
F’ = [WX (Y’Z + YZ’) + W’X’ (Y’ + Z) (Y+Z’)]’
F’ = [W’+X’ + (Y+Z’) (Y’+Z)][(W+X)+(YZ’)+(Y’Z)]
Answer: F’ = [W’+X’ + (Y+Z’) (Y’+Z)] [W+X + YZ’ + Y’Z]
Problem 4 SET D: Given F (A, B, C, D) = Σ m (2, 6, 11, 13) and d (A, B, C, D) = Σ m (4, 5, 7, 9, 10, 15), simplify the
Boolean Function with the Don’t Care conditions in POS form. Show clearly how you arrived at your answer truth
table, maps Find the logic diagram (must conform with the answer)

Solution:
W X Y Z Minterm F
0 0 0 0 m0 0
0 0 0 1 m1 0
CD 00 01 11 10
0 0 1 0 m2 1
AB
0 0 1 1 m3 0
00 0 0 0 1
0 1 0 0 m4 X
01 X X X 1
0 1 0 1 m5 X
11 0 1 X 0
0 1 1 0 m6 1
10 0 X 1 X
0 1 1 1 m7 X
1 0 0 0 m8 0
F = A’C’ + A’D + AD’
1 0 0 1 m9 X
F’ = (A’C’ + A’D + AD’)’ 1 0 1 0 m10 X
F’ = (A+C) (A +D’) (A’ + D) 1 0 1 1 m11 1
1 1 0 0 m12 0
Answer: F’ = (A+C) (A +D’) (A’ + D) 1 1 0 1 m13 1
1 1 1 0 m14 0
1 1 1 1 m15 X

Problem 5 SET D: Simplify the given Boolean function by using a map in POS form
F (A, B, C, D, E)= Σ m (0, 1, 4, 5, 16, 17, 21, 25, 29)
Solution:
DE DE
00 01 11 10 00 01 11 10
BC BC
00 1 1 0 0 00 1 1 0 0
01 1 1 0 0 01 0 1 0 0
11 0 0 0 0 11 0 1 0 0
10 0 0 0 0 10 0 1 0 0
A=0 A=1
F’= D + A’B + BE’ + ACE’
[F’= D + A’B + BE’ + ACE’]’
F = (D’) (A+B’) (B’+E) (A’+C’+E)
Answer: F = (D’) (A+B’) (B’+E) (A’+C’+E)
Problem 1 SET B: Determine the complement of the given expression WX (Y’Z+YZ’) + W’X’(Y’+Z)(Y+Z’). Show the step-
by-step solution
Solution:
F = WX (Y’Z + YZ’) + W’X’ (Y’ + Z) (Y+Z’)
F’ = [WX (Y’Z + YZ’) + W’X’ (Y’ + Z) (Y+Z’)]’
F’ = [W’+X’ + (Y+Z’) (Y’+Z)][(W+X)+(YZ’)+(Y’Z)]
Answer: F’ = [W’+X’ + (Y+Z’) (Y’+Z)] [W+X + YZ’ + Y’Z]
Problem 2 SET B: Reduce to Boolean expression to minimum number of literals in SOP. (AB+A’B’) (CD+C’D’) + (AC)’
Solution:
= (AB+A’B’) (CD+C’D’) + (AC)’
= ABCD + ABC’D’ + A’B’CD + A’B’C’D’ + A’ + C’
= ABCD + ABC’D’ + A’(B’CD + B’C’D’ + 1) + C’ but B’C’D’ + 1 = 1
= ABCD + ABC’D’ + A’ (B’CD + 1) + C’ but B’CD + 1 = 1
= ABCD + ABC’D’ + A’ + C’
= ABCD + A’ + C’ (ABD’ + 1) but ABD’ + 1 = 1
= ABCD + A’ + C’
= (A + A’) (A’ + BCD) + C’ but A + A’ = 1
= A’ + BCD + C’
= A’ + (C + C’) (C’ + BD) but C + C’ = 1
= A’ + (C’ + BD)
= A’ + C’ + BD
Answer: A’ + C’ + BD
Problem 3 SET B: Using a map, determine the simplest expression in SOP form for the given function.
F (W, X, Y, Z) = X’Z + W’XY’ + W (X’Y + XY’)
Solution:
F (W, X, Y, Z) = X’Z + W’XY’ + W (X’Y + XY’)
F (W, X, Y, Z) = X’Z + W’XY’ + WX’Y + WXY’
F (W, X, Y, Z) = X’Z (W+W’) (Y+Y’) + W’XY’ (Z+Z’) + WX’Y (Z+Z’) + WXY’ (Z+Z’)
F (W, X, Y, Z) = (WX’Z + W’X’Z) (Y+Y’) + W’XY’Z+ W’XY’Z’ + WX’YZ+ WX’Y Z’ + WXY’Z+ WXY’Z’
F (W, X, Y, Z) = WX’YZ + WX’ Y’Z + W’X’YZ + W’X’Y’Z + W’XY’Z+ W’XY’Z’ + WX’YZ+ WX’Y Z’ + WXY’Z+ WXY’Z’
F (W, X, Y, Z) = WX’YZ + WX’Y’Z + W’X’YZ + W’X’Y’Z + W’XY’Z+ W’XY’Z’ + WX’Y Z’ + WXY’Z+ WXY’Z’
1011 1001 0011 0001 0101 0100 1010 1101 1100
11 9 3 1 5 4 10 13 12
F (W, X, Y, Z) = Σ m (1, 3, 4, 5, 9, 10, 11, 12, 13)
Answer: F (W, X, Y, Z) = Σ m (1, 3, 4, 5, 9, 10, 11, 12, 13)
Problem 4 SET B: Using 4 Variable map, POS of Problem 3
Solution:
F (W, X, Y, Z) = Σ m (1, 3, 4, 5, 9, 10, 11, 12, 13)

YZ 00 01 11 10
WX
00 0 1 1 0
01 1 1 0 0
11 1 1 0 0
10 0 1 1 1

F’ = XY + W’X’Z’ + X’Y’Z’
[F’ = XY + W’X’Z’ + X’Y’Z’]’
F = (X’+Y’) (W + X + Z) ( X + Y + Z)
Answer: F = (X’+Y’) (W + X + Z) ( X + Y + Z)
Problem 5 SET B: Determine the essential prime implicants of a (specific product terms) for each of the given Boolean
function
a. F (S, T, U, V) = Σ m (0, 2, 4, 5, 6, 7, 8, 10, 13, 15)
Solution:

UV 00 01 11 10
ST
00 1 1
01 1 1 1 1
11 1 1
10 1 1

F = TV + S’V’ + T’V’
Answer: The essential prime implicants are TV
b. F (E, F, G, H) = Σ m (1, 3, 4, 5, 9, 10, 11, 12, 13, 14, 15)
Solution:

GH 00 01 11 10
EF
00 1 1
01 1 1
11 1 1 1 1
10 1 1 1

F = FG’ + EG + F’H
Answer: The essential prime implicants are FG’
c. F (A, B, C, D) = Σ m (1, 3, 4, 5, 10, 11, 12, 13, 14, 15)
Solution:

CD 00 01 11 10
AB
00 1 1
01 1 1
11 1 1 1 1
10 1 1
F = A’B’D + BC’ + AC Answer: The essential prime implicants are A’B’D, BC’, AC
Problem 1 SET B: Using algebraic manipulation, simplify the given Boolean expression to a minimum number of
literals: (BC’ + A’D) (AB’ + CD’)

Solution:
= AB’BC’ + BC’CD’ + A’DAB’ + A’DCD’
= 0(AC’) + 0(BD’) + 0(B’D) + 0 (A’C)
=0
Answer: 0
Problem 2 SET B: Using algebraic manipulation, reduce the given Boolean expression to 3 literals:
(X’Y’ + Z)’ + Z +XY + WZ
Solution:
= (X’Y’ + Z)’ + Z +XY + WZ
= (X + Y) (Z’) + Z +XY +WZ
= XZ’ + YZ’ + Z +XY +WZ
= (Z+Z’) (Z+Y) + XZ’ + XY + WZ but Z+Z’ = 1
= Z + Y + XZ’ + XY + WZ
= (Z+Z’)(Z+X) + Y + WZ but Z+Z’ = 1
= X + Y + Z + WZ
= X + Y + Z (W+1) but W + 1 = 1
=X + Y + Z
Answer: X + Y + Z
Problem 3 SET B: Using scientific means, determine minterm expansion of the given Boolean expression:
F (W, X, Y, Z) = X’Z + W’XY’ + W (X’Y + XY’)
Solution:
F (W, X, Y, Z) = X’Z + W’XY’ + W (X’Y + XY’)
F (W, X, Y, Z) = X’Z + W’XY’ + WX’Y + WXY’
F (W, X, Y, Z) = X’Z (W+W’) (Y+Y’) + W’XY’ (Z+Z’) + WX’Y (Z+Z’) + WXY’ (Z+Z’)
F (W, X, Y, Z) = (WX’Z + W’X’Z) (Y+Y’) + W’XY’Z+ W’XY’Z’ + WX’YZ+ WX’Y Z’ + WXY’Z+ WXY’Z’
F (W, X, Y, Z) = WX’YZ + WX’ Y’Z + W’X’YZ + W’X’Y’Z + W’XY’Z+ W’XY’Z’ + WX’YZ+ WX’Y Z’ + WXY’Z+ WXY’Z’
F (W, X, Y, Z) = WX’YZ + WX’Y’Z + W’X’YZ + W’X’Y’Z + W’XY’Z+ W’XY’Z’ + WX’Y Z’ + WXY’Z+ WXY’Z’
1011 1001 0011 0001 0101 0100 1010 1101 1100
11 9 3 1 5 4 10 13 12
F (W, X, Y, Z) = Σ m (1, 3, 4, 5, 9, 10, 11, 12, 13)
Answer: F (W, X, Y, Z) = Σ m (1, 3, 4, 5, 9, 10, 11, 12, 13)
Problem 4 SET B: Using a 4-variable map, determine the simplest expression in SOP for the given function in Problem
3. Your answer should conform with your minterm expansion in Problem 3
Solution:

YZ 00 01 11 10
WX
00 1 1
01 1 1
11 1 1
10 1 1 1

F = XY’ + X’Z + WX’Y

Answer: F = XY’ + X’Z + WX’Y
Problem 5 SET B: In consideration with the most economical design of digital circuits, determine the essential prime
implicants (if there is any) for the given Boolean expression
a. F (W, X, Y, Z) = Σ m (0, 2, 4, 5, 6, 7, 8, 10, 13, 15)
Solution:

YZ 00 01 11 10
WX
00 1 1
01 1 1 1 1
11 1 1
10 1 1

F = XZ + W’X + X’Z’
Answer: The essential prime implicants are XZ
b. F (A, B, C, D) = Σ m (1, 3, 4, 5, 9, 10, 11, 12, 13, 14, 15)
Solution:

CD 00 01 11 10
AB
00 1 1
01 1 1
11 1 1 1 1
10 1 1 1

F = BC’ + AC + B’D
Answer: The essential prime implicants are BC’
c. F (A, B, C, D) = Σ m (1, 3, 4, 5, 10, 11, 12, 13, 14, 15)
Solution:

CD 00 01 11 10
AB
00 1 1
01 1 1
11 1 1 1 1
10 1 1

F = A’B’D + BC’ + AC Answer: There essential prime implicants are BC’, A’B’D and AC