- Asked 5/22
- 2079 Bhadra · 4+2 marks
- 2079 Baisakh · 3+3 marks
- 2076 Chaitra · 4+2 marks
K-map Σ(1,2,3,8,9,10,11,14)+d(0,4,12), NAND
Short answer
K-map simplification yields F = B' + A D'. For NAND realization, apply double inversion and DeMorgan: F = NAND(B, NAND(A, D')). Use a NAND gate with tied inputs as an inverter for D; total three NAND gates.
Simplify the function using K-map F = Σ(1,2,3,8,9,10,11,14) and D = Σ(0,4,12). Also realize the simplified circuit using NAND Gates.
Given , where X marks a don't-care cell.
K-map simplification
CD
AB 00 01 11 10
+---+---+---+---+
00 | X | 1 | 1 | 1 |
+---+---+---+---+
01 | X | 0 | 0 | 0 |
+---+---+---+---+
11 | X | 0 | 0 | 1 |
+---+---+---+---+
10 | 1 | 1 | 1 | 1 |
+---+---+---+---+
Groups (don't-cares 0 and 12 are used where they make a group bigger; don't-care 4 is left out):
- Octet m(0,1,2,3,8,9,10,11) →
- Quad m(8,10,12,14) →
Check: the octet covers 1, 2, 3, 8, 9, 10, 11, and the quad covers 8, 10, 14 (with 12). All minterms are covered.
Realization using NAND gates
Take double complement and apply De Morgan's theorem:
So = NAND(, NAND(, )). is made with a NAND gate whose inputs are tied together. The single literal goes into the output NAND as plain .
D ──[NAND]── D' (inputs tied)
A, D' ──[NAND]── P1 ─┐
├──[NAND]── F
B ────────── ─┘
Total: 3 two-input NAND gates (one used as an inverter).
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- K-map Σ(1,3,7,11,15)+d, NAND · Digital Logic, chapter 3 · asked 5×
- K-map Σ(0,1,4,8,10,11,12)+d, NOR · Digital Logic, chapter 3 · asked 5×
- K-map Σ(0,1,4,8,10,11,12)+d, realize circuit · Digital Logic, chapter 3 · asked 2×
- K-map Σ(0,1,4,8,10,11,12)+d, NAND-only · Digital Logic, chapter 3
- K-map Π(0,1,4,7,8,10,11,12)+d, NAND · Digital Logic, chapter 3
- Minterms/maxterms; K-map Σ(1,3,5,8,10,11,12)+d · Digital Logic, chapter 3 · asked 2×
- K-map ΠM(0,2,3,8,10,11,12,15)+d, NOR · Digital Logic, chapter 3
- K-map Σ(1,2,3,8,9,10,11,13,14)+d, POS · Digital Logic, chapter 3
- K-map with don't cares, NAND only · Basic Electronics Engineering, chapter 6
- K-map: x'yz + x'y'z + xyz with gates · Basic Electronics Engineering, chapter 6 · asked 2×
- Class C pool for 10, 12, 8, 14 · Computer Networks and Security, chapter 4 · asked 2×