Given the Boolean function F(A, B, C, D) = Σ(0,2,3,4,6,7,9,13) (a) Use Karnaugh's map to reduce this function F, using the given SOP form. Draw logic gate diagram for the reduced SOP form.
Advertisements
Question
Given the Boolean function F(A, B, C, D) = Σ(0,2,3,4,6,7,9,13)
- Use Karnaugh's map to reduce this function F, using the given SOP form. Draw logic gate diagram for the reduced SOP form. You may use gates with more than two inputs. Assume that variables and their complements are available as inputs.
- Given X(A, B, C, D) = П(2,3,4,5,12,14)
Diagram
Numerical
Advertisements
Solution
(a) Step 1: Draw the 4-variable Karnaugh Map
|
AB\CD |
00 |
01 |
11 |
10 |
|---|---|---|---|---|
|
00 |
1 |
0 |
1 |
1 |
|
01 |
1 |
0 |
1 |
1 |
|
11 |
0 |
1 |
0 |
0 |
|
10 |
0 |
1 |
0 |
0 |
Step 2: Group the Adjacent 1s
- Group 1: (0, 2, 4, 6) = A'D'
- Group 2: (2, 3, 6, 7) = A'C
- Group 3: (9, 13) = AC'D
Step 3: Write the Reduced SOP Expression
Combining all groups:
F = A'D' + A'C + AC'D
Step 4: Draw the Logic Gate Diagram

F = A'D' + A'C + AC'D
The circuit requires two 2-input AND gates, one 3-input AND gate and one 3-input OR gate.
(b) The given function is expressed in Product of Maxterms (POS) notation.
X(A, B, C, D) = Π(2, 3, 4, 5, 12, 14)
This means X = 0 for maxterms 2, 3, 4, 5, 12 and 14.
The equivalent SOP notation is:
X(A, B, C, D) = Σ(0, 1, 6, 7, 8, 9, 10, 11, 13, 15)
shaalaa.com
Is there an error in this question or solution?
Chapter 1: Boolean Algebra - EXERCISE [Page 52]
