Experiment 2:
Given a Boolean expression, simplify it using the Karnaugh map and realize it
using the corresponding circuit simulation. Also include don’t care conditions
Ex: Simplify and realize the function in both SOP and POS form
i) F (A, B, C, D) = (5,6,9,13,15) + d (1,7,14)
Rules for k-map simplification:
Groups may not contain zero
We can group 1, 2,4,8, or 2 power n cells
Each group should be as large as possible
Cells containing 1 must be grouped
Groups may overlap
Opposite grouping and corner grouping is allowed
There should be as few groups as possible
i)
Consider the following equation
F (A, B, C, D) = (5,6,9,13,15) + d (1,7,14) =>Sum of product form
Construct the truth table accordingly
A B C D Y
0 0 0 0 0
0 0 0 1 X
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 1
0 1 1 0 1
0 1 1 1 X
1 0 0 0 0
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 0
1 1 0 1 1
1 1 1 0 X
1 1 1 1 1
Now construct the KMAP and group it by applying all the rules and fine the
number of essential prime implicants
00 01 11 10
00
0 X 0 0
0 1 X 1 Green – Prime implicant 1
01
Yellow – Prime implicant 2
11 0 1 1 X
10
0 1 0 0
The non-simplified expression isF (A, B, C, D) = A̅ BC̅ D + A̅ BCD̅ +AB̅ C̅ D
+ABC̅ D+ABCD
The simplified expression in SOP form isF (A, B, C, D) = BC + C̅ D
Create a combinational logic circuit for this using basic gates and simulate the
same as shown below
Verify the logic circuit against the truth table.
Observation:
The non-simplified Boolean expression will be big and uses 4 variables. Hence the
logiccircuit will be very complex. Using K-Map technique, the simplified
expression just containstwovariables and only two terms, and hence a smaller
number of gates are used to design the circuit.
ii)
The same boolean function in POS form is
F(A,B,C,D)=Π(0,2,3,4,8,10,11,12).d(1,7,14) =>Product of sum form
00 01 11 10
00
0 X 0 0
0 1 X 1 Green – Prime implicant 1
01
Yellow – Prime implicant 2
11 0 1 1 X
10
0 1 0 0
F'(A, B, C, D) = B̅ C + C̅ D̅
The simplified expression in POS form isF = (B + C̅ ).(C + D)
Create a combinational logic circuit for this using only NAND gates and simulate
the same.Verify the logic circuit against the truth table.
Additional Problems(To be done in the lab):
1. Find the number of prime implicants, essential prime implicants, redundant
prime implicants for the following Boolean function
f = Σm(1, 2, 3, 6, 7)
2. Minimize the following function in SOP minimal form using K-Maps and
realize the logic circuit. Verify against the truth table:
f = m(1, 5, 6, 11, 12, 13, 14) + d (4)
3. Minimize the following function in POS minimal form using K-Mapsand
realize the logic circuit. Verify against the truth table:
F (A, B, C, D) = Π (0, 1, 2, 3, 4, 5) . d (10, 11, 12, 13, 14, 15)
4. Minimize the following boolean function and verify the truth table:
f(A, B, C, D) = Σm(3, 4, 5, 7, 9, 13, 14, 15)
