Skip to main content

K-map Σm(7,9,12,13,14,15)+d, NOR-only

Short answer

F = AB + BD + A C' D. For NOR-only: invert A,B,D; P1 = NOR(A',B'), P2 = NOR(B',D'), P3 = NOR(A',C,D'); F = NOR( NOR(P1,P2,P3) ) via a final NOR inverter. Total eight NOR gates.

Simplify the following Boolean function using K-map and draw the circuit of simplified expression using NOR gates only. F = Σm(7,9,12,13,14,15) + don't care (0,2,3,5).

Given F(A,B,C,D)=Σm(7,9,12,13,14,15)+d(0,2,3,5)F(A,B,C,D) = \Sigma m(7,9,12,13,14,15) + d(0,2,3,5).

K-map simplification

        CD
AB      00  01  11  10
      +---+---+---+---+
 00   | X | 0 | X | X |
      +---+---+---+---+
 01   | 0 | X | 1 | 0 |
      +---+---+---+---+
 11   | 1 | 1 | 1 | 1 |
      +---+---+---+---+
 10   | 0 | 1 | 0 | 0 |
      +---+---+---+---+

Groups (don't-care 5 is used in the BD quad; 0, 2, 3 are not needed):

  • Quad m(12,13,14,15) → ABAB
  • Pair m(9,13) → AC‾DA\overline{C}D
  • Quad m(5,7,13,15) → BDBD
F=AB+BD+AC‾DF = AB + BD + A\overline{C}D

Check: 12, 13, 14, 15 by AB; 7 (and 5, 13, 15) by BD; 9 by AC‾DA\overline{C}D.

Circuit using NOR gates only

For NOR-only realization of an SOP expression, write each product term as a NOR of complemented literals (De Morgan: X‾ Y‾=X+Y‾\overline{X}\,\overline{Y} = \overline{X+Y}), feed these to a NOR gate (which gives F‾\overline{F}), and invert with one more NOR whose inputs are tied.

AB=A‾+B‾‾BD=B‾+D‾‾AC‾D=A‾+C+D‾‾F=P1+P2+P3‾‾\begin{aligned} AB &= \overline{\overline{A}+\overline{B}} \\ BD &= \overline{\overline{B}+\overline{D}} \\ A\overline{C}D &= \overline{\overline{A}+C+\overline{D}} \\ F &= \overline{\overline{P_1+P_2+P_3}} \end{aligned}
A ──[NOR]── A'   (inputs tied)
B ──[NOR]── B'   (inputs tied)
D ──[NOR]── D'   (inputs tied)

A', B'    ──[NOR]── P1  ─┐
B', D'    ──[NOR]── P2  ─┤──[NOR]── F'
A', C, D' ──[NOR]── P3  ─┘

F' ──[NOR]── F   (inputs tied)

Gates: 3 NOR inverters (A‾,B‾,D‾\overline{A}, \overline{B}, \overline{D}), 3 first-level NORs, a 3-input NOR giving F‾\overline{F} and a final NOR inverter.

✓ Answer checked by Claude Opus 5.5 (high effort)

All Digital Logic chapter 3 questions →