- 2075 Chaitra · 6 marks
K-map Σ(0,1,4,8,10,11,12)+d, NAND-only
Short answer
The simplified expression is F = B' + C'D'. Using NAND gates: generate C' and D' with NAND inverters, compute (C' NAND D') as P1, then F = B NAND P1, requiring four 2-input NAND gates.
Simplify the function using K-map F = Σ(0,1,4,8,10,11,12) and D = Σ(2,3,6,9,15). Also convert the result into only NAND gates.
Given .
K-map simplification
CD
AB 00 01 11 10
+---+---+---+---+
00 | 1 | 1 | X | X |
+---+---+---+---+
01 | 1 | 0 | 0 | X |
+---+---+---+---+
11 | 1 | 0 | X | 0 |
+---+---+---+---+
10 | 1 | X | 1 | 1 |
+---+---+---+---+
Groups (don't-cares 2, 3, 9 complete the octet; 6 and 15 are not used):
- Octet m(0,1,2,3,8,9,10,11) →
- Quad m(0,4,8,12) →
Check: the octet covers 0, 1, 8, 10, 11 and the quad covers 0, 4, 8, 12.
Conversion to NAND gates only
So = NAND(, NAND(, )). The complements and come from NAND gates with tied inputs. The single literal enters the output NAND as plain .
C ──[NAND]── C' (inputs tied)
D ──[NAND]── D' (inputs tied)
C', D' ──[NAND]── P1 ─┐
├──[NAND]── F
B ────────── ─┘
Total: 4 two-input NAND gates (two as inverters).
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- K-map Π(0,1,4,7,8,10,11,12)+d, NAND · Digital Logic, chapter 3
- K-map Σ(1,2,3,8,9,10,11,14)+d(0,4,12), NAND · Digital Logic, chapter 3 · asked 5×
- K-map Σm(0,1,2,4,7,8,9,10,12,15)+d, NOR-only · Digital Logic, chapter 3
- Minterms/maxterms; K-map Σm(0,1,2,4,5,9,12,15)+d, NAND · Digital Logic, chapter 3
- K-map ΠM(0,2,3,8,10,11,12,15)+d, NOR · Digital Logic, chapter 3
- K-map Σ(1,3,7,11,15)+d, NAND · Digital Logic, chapter 3 · asked 5×
- K-map with don't cares, NAND only · Basic Electronics Engineering, chapter 6
- X-OR gate using NAND gates only · Basic Electronics Engineering, chapter 6
- K-map: x'yz + x'y'z + xyz with gates · Basic Electronics Engineering, chapter 6 · asked 2×
- Asphalt Institute design: 5.11×10⁴ ESAL/year, 12 years · Transportation Engineering II, chapter 2