TUTORIAL-11

PRE-TUTORIAL ASSIGNMENT – SOLUTION

Problem: Using Karnaugh map, minimize the given logic function into (a) SOP form and (b) POS form.
𝐹(𝐴, 𝐵, 𝐶) = ∏ 𝑀(1, 2, 6, 7)

Solution: 𝐹(𝐴, 𝐵, 𝐶) = ∏ 𝑀(1, 2, 6, 7)

Draw a 3-variable K-map and insert 0s in the cells corresponding to maxterms present in the given
logic function as shown below.
BC 00 01 11 10
A
0 0 0
1 0 0
a) For deriving the minimized SOP form, insert 1s in the empty cells and perform optimal groupings

BC 00 01 11 10
A
0 1 0 1 0
1 1 1 0 0
𝐹(𝐴, 𝐵, 𝐶) = 𝐵̅𝐶̅ + 𝐴𝐵̅ + 𝐴̅𝐵𝐶

[Fact: For any completely specified logic function, the indices of minterms and the indices of
maxterms form a complementary set]

b) For deriving the minimized POS form, perform the optimal grouping 0s and write the reduced sum
terms for each groups in POS

BC 00 01 11 10
A
0 0 0
1 0 0

𝐹 = (𝐴 + 𝐵 + 𝐶̅ )(𝐴̅ + 𝐵̅)(𝐵̅ + 𝐶

Alternately: For optimally grouped 0s, write the SOP expression to get the complementary
form of the logic function as:
𝐹̅ = 𝐴̅𝐵̅𝐶 + 𝐴𝐵 + 𝐵𝐶̅
Using DeMorgan’s Theorem, express each product term as a sum

𝐹̅ = ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
(𝐴 + 𝐵 + 𝐶̅ ) + ̅̅̅̅̅̅̅̅̅̅
(𝐴̅ + 𝐵̅) + ̅̅̅̅̅̅̅̅̅̅
(𝐵̅ + 𝐶)
On taking complement of both the sides, we have

̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
𝐹̿ = ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
(𝐴 + 𝐵 + 𝐶̅ ) + ̅̅̅̅̅̅̅̅̅̅
(𝐴̅ + 𝐵̅) + ̅̅̅̅̅̅̅̅̅̅
(𝐵̅ + 𝐶)

𝐹 = (𝐴 + 𝐵 + 𝐶̅ )(𝐴̅ + 𝐵̅)(𝐵̅ + 𝐶)
 TUTORIAL-11 SOLUTIONS

Problem-1: Using Karnaugh map, minimize the given logic function into SOP form. Also list all possible equivalently
minimized expressions.

𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑ 𝑚(4, 5, 6, 11, 13, 14, 15)

Solution-1: 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑ 𝑚(4, 5, 6, 11, 13, 14, 15), drawing a 4-variable K-map for this logic function

CD 00 01 11 10
AB
00

01 1 1 1
11 1 1 1
10 1

Identifying that ‘1’ in cell index 11 can be grouped in only one way while other 1s can be grouped in
more than one way. So that should be given priority while searching for different possible optimal
groupings.

CD 00 01 11 10 CD 00 01 11 10 CD 00 01 11 10
AB AB AB
00 00
00
01
01 1 1 1 01
1 1 1 1 1 1
11 1 1 1 11 1 1 1 11 1 1 1
10 1 10 1 10 1
𝐹 = 𝐴̅𝐵 𝐶̅ + 𝐵𝐶̅ 𝐷 + 𝐴𝐶𝐷 + 𝐵𝐶𝐷
̅ 𝐹 = 𝐴̅𝐵𝐷
̅ + 𝐵𝐶̅ 𝐷 + 𝐴𝐶𝐷 + 𝐴𝐵𝐶 𝐹 = 𝐴̅𝐵𝐷
̅ + 𝐵𝐶̅ 𝐷 + 𝐴𝐶𝐷 + 𝐵𝐶𝐷
̅

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

𝐹 = 𝐴̅𝐵 𝐶̅ + 𝐴𝐵𝐷 + 𝐴𝐶𝐷 + 𝐵𝐶𝐷

̅

[Note: All four minimized expressions are valid as these have identical complexity in implementation]
Problem-2: Using Karnaugh map, find the minimized SOP expressions of the given logic function.
𝐹(𝑊, 𝑋, 𝑌, 𝑍) = ∑ 𝑚(4, 5, 9, 13, 15) + 𝑑(0, 1, 7, 11, 12)

Solution-2: 𝐹(𝑊, 𝑋, 𝑌, 𝑍) = ∑ 𝑚(4, 5, 9, 13, 15) + 𝑑(0, 1, 7, 11, 12), drawing 4-variable K-map and marking both
true and don’t care minterms in the given logic function

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

Two possible equivalent minimizations of the given logic function:

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

𝐹 = 𝑋𝑌̅ + 𝑊𝑍 ̅ 𝑌̅ + 𝑊𝑍
𝐹=𝑊
Problem-3: Write the truth table of 4-bit binary to Excess-3 code converter and obtain the simplified SOP expression
using the unused combinations as don’t care conditions.

Solution-3: Truth table of 4-bit Binary-to-Excess-3 code converter

K-map for P:
Decimal 4-bit Binary Excess-3
digit A B C D P Q R S CD 00 01 11 10
0 0 0 0 0 0 0 1 1 AB
00
1 0 0 0 1 0 1 0 0
2 0 0 1 0 0 1 0 1 01 1 1 1
3 0 0 1 1 0 1 1 0 11 1 x x x
4 0 1 0 0 0 1 1 1 10 1 1 1 1
5 0 1 0 1 1 0 0 0
6 0 1 1 0 1 0 0 1
7 1 1 1 1 1 0 1 0 𝑃 = 𝐴 + 𝐵𝐷 + 𝐵𝐶
8 1 0 0 0 1 0 1 1
9 1 0 0 1 1 1 0 0
10 1 0 1 0 1 1 0 1
11 1 0 1 1 1 1 1 0 K-map for Q:
12 1 1 0 0 1 1 1 1
13 1 1 0 1 x x x x CD 00 01 11 10
14 1 1 1 0 x x x x AB

15 1 1 1 1 x x x x 00 1 1 1
01 1
11 1 x x x
10 1 1 1

𝑄 = 𝐵𝐶̅ 𝐷
̅ + 𝐵̅𝐷 + 𝐵̅𝐶

K-map for R:
CD 00 01 11 10
K-map for S:
AB
00 1 1 CD 00 01 11 10
AB
01 1 1 00
1 1
11 1 x x x 01 1 1
10 1 1 11 x x x x
10 1 x x
𝑅 = 𝐶̅ 𝐷
̅ + 𝐶𝐷 = 𝐶 ⊙ 𝐷
̅
𝑆=𝐷
Problem-4: A 4-bit BCD code PQRS is given as input to a combinational logic circuit. The circuit should output 1 in
those cases where the decimal digit equivalent of the input BCD code is a number which, when represented in the
seven-segment display ( ), contains the upper left segment of the display.

(a) Write the expression for the above in the Standard Sum of Products (SSOP) form.
(b) Using appropriate don’t care states, reduce the expression in part (a) to minimal SOP
expression using Karnaugh map.
(c) What will be the minimal SOP expression if don’t care states are not used?

Solution-4:

. (a) In 7-segment display, the upper left segment is involved in the display of digits: 0, 4, 5, 6,
8 and 9. The SSOP expression of the combinational circuit that drives the 7-segment display
can be given as

𝐹(𝑃, 𝑄, 𝑅, 𝑆) = Σ 𝑚(0,4,5,6,8,9) = 𝑃̅𝑄̅ 𝑅̅𝑆̅ + 𝑃̅𝑄𝑅̅𝑆̅ + 𝑃̅𝑄𝑅̅𝑆 + 𝑃𝑄𝑅̅𝑆̅ + 𝑃𝑄̅ 𝑅̅𝑆̅ + 𝑃𝑄̅ 𝑅𝑆̅

(b) Using unused states of 4-bits input as don’t-care, the expression in part (a) modifies to

𝐹(𝑃, 𝑄, 𝑅, 𝑆) = Σ 𝑚(0,4,5,6,8,9) + 𝑑(10,11,12,13,14,15)

K-map:

Take note how the

group of variables
chosen across rows and
columns of K-map
impacts the cell indices
indicated on top left
corner of each cell

The minimal SOP expression: 𝐹(𝑃, 𝑄, 𝑅, 𝑆) = 𝑃 + 𝑄𝑅̅ + 𝑄𝑆̅ + 𝑅̅𝑆̅

(c) If don’t-care states are not used, two possible minimal SOP expressions be:

Case-I: 𝐹(𝑃, 𝑄, 𝑅, 𝑆) = 𝑃̅𝑅̅𝑆̅ + 𝑃̅𝑄𝑅̅ + 𝑃̅𝑄𝑆̅ + 𝑃𝑄̅ 𝑅̅

Case-II: 𝐹(𝑃, 𝑄, 𝑅, 𝑆) = 𝑄̅ 𝑅̅𝑆̅ + 𝑃̅𝑄𝑅̅ + 𝑃̅𝑄𝑆̅ + 𝑃𝑄̅ 𝑅̅

Case-I Case-II
Problem-5: The cross-section of the core is 25 cm2. At a particular situation, the flux in branches A and B is
3500 𝜇𝑊𝑏 and that in branch C is zero. Find the required ATs in coil 1 and coil 2. (𝜇𝑟 = 1000)
80 cm 80 cm

A C
i1 B i2
N1 N2
Coil 1 Coil 2
30 cm

Solution-5: The magnetic equivalent circuit:

SA SC

ɸA ɸC
F1=N1i1 SB F2=N2i2

1 ɸB 2

Since ∅𝐶 = 0, ∅𝐴 = ∅𝐵

For loop-1: 𝐹1 − ∅𝐴 𝑆𝐴 − ∅𝐵 𝑆𝐵 = 0

𝐹1 = ∅𝐴 𝑆𝐴 + ∅𝐵 𝑆𝐵
= ∅𝐴 (𝑆𝐴 + 𝑆𝐵 )

𝑙𝐴 80 × 10−2 𝐴𝑇
𝑆𝐴 = = −7 −4
= 2.5465 × 105
𝜇0 𝜇𝑟 𝐴𝐶 4𝜋 × 10 × 1000 × 25 × 10 𝑤𝑏
𝑙𝐵 30 × 10−2 𝐴𝑇 𝐴𝑇
𝑆𝐵 = = −7 −4
= 9.5494 × 104 = 0.955 × 105
𝜇0 𝜇𝑟 𝐴𝐶 4𝜋 × 10 × 1000 × 25 × 10 𝑤𝑏 𝑤𝑏

𝐹1 = ∅𝐴 (𝑆𝐴 + 𝑆𝐵 )

= 3500 × 10−6 (2.5465 + 0.955) × 105

= 1225.5 𝐴𝑇

𝐹2 = ∅𝐵 𝑆𝐵 = 3500 × 10−6 × 0.955 × 105 = 334.25 𝐴𝑇

Problem-6: Find 𝑣0

M = 0.5H

+ +
0.5 F
24 cos 2t 2H 2H v0
- -

Solution-6: Frequency model: 𝜔 = 2 𝑟𝑎𝑑/𝑠

NOTE: All the calculations are based on maximum value of the excitation voltage.

j1

+ +
24 0° j4 j4 I2 -j1 V0
I1
- -

Applying Faraday’s law of electromagnetic induction to mesh-1:

24 − (𝑗4𝐼1 − 𝑗𝐼2 ) = 0
24 − 𝑗4𝐼1 + 𝑗𝐼2 = 0 ------------------- (1)

Similarly for mesh-2:

−(𝑗4𝐼2 − 𝑗𝐼1 ) − (−𝑗1)𝐼2 = 0

−𝑗3𝐼2 + 𝑗𝐼1 = 0
𝐼1 = 3𝐼2 -----------------(2)

Substituting (2) in (1):

24 − 𝑗4𝐼1 + 𝑗𝐼2 = 0
24 − 𝑗4 × 3𝐼2 + 𝑗𝐼2 = 0
24 24
𝐼2 = = −𝑗 𝐴
𝑗11 11
𝑉0 = (−𝑗1)𝐼2
24
= −𝑗1 × −𝑗
11
24
=− 𝑉
11
24
So, 𝑉0 (𝑡) = − 11 cos(2𝑡) 𝑉