Skip to main content

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 F(A,B,C,D)=Σm(1,2,3,8,9,10,11,14)+d(0,4,12)F(A,B,C,D) = \Sigma m(1,2,3,8,9,10,11,14) + d(0,4,12), 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) → B‾\overline{B}
  • Quad m(8,10,12,14) → AD‾A\overline{D}
F=B‾+AD‾F = \overline{B} + A\overline{D}

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:

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

So FF = NAND(BB, NAND(AA, D‾\overline{D})). D‾\overline{D} is made with a NAND gate whose inputs are tied together. The single literal B‾\overline{B} goes into the output NAND as plain BB.

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)

All Digital Logic chapter 3 questions →