Skip to main content

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 F(A,B,C,D)=Σm(0,1,4,8,10,11,12)+d(2,3,6,9,15)F(A,B,C,D) = \Sigma m(0,1,4,8,10,11,12) + d(2,3,6,9,15).

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) → B‾\overline{B}
  • Quad m(0,4,8,12) → C‾ D‾\overline{C}\,\overline{D}
F=B‾+C‾ D‾F = \overline{B} + \overline{C}\,\overline{D}

Check: the octet covers 0, 1, 8, 10, 11 and the quad covers 0, 4, 8, 12.

Conversion to NAND gates only

F=B‾+C‾ D‾‾‾=B⋅C‾ D‾‾‾\begin{aligned} F &= \overline{\overline{\overline{B}+\overline{C}\,\overline{D}}} \\ &= \overline{B\cdot\overline{\overline{C}\,\overline{D}}} \end{aligned}

So FF = NAND(BB, NAND(C‾\overline{C}, D‾\overline{D})). The complements C‾\overline{C} and D‾\overline{D} come from NAND gates with tied inputs. The single literal B‾\overline{B} enters the output NAND as plain BB.

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)

All Digital Logic chapter 3 questions →