Digital Logic20805 marksNumerical: K-map simplification NAND circuitDon't Care conditions
If f(P,Q,R,S)=sum(3,4,7,8,14), d(P,Q,R,S)=sum(1,6,9,13) Simplify it using K-map and design circuit using minimum number of NAND gates.
If $f(P,Q,R,S)=\sum(3,4,7,8,14)$, $d(P,Q,R,S)=\sum(1,6,9,13)$ Simplify it using K-map and design circuit using minimum number of NAND gates. [5]
- $f(P,Q,R,S) = \sum(3,4,7,8,14)$ (required minterms) - Don't cares: $d(P,Q,R,S) = \sum(1,6,9,13)$ - P is MSB, S is LSB $$ \begin{array}{ccccc} & RS=00 & 01 & 11 & 10 \ \hline PQ=00 & 0(m0) & X(m1) & 1(m3) & 0(m2) \ 01 & 1(m4) & 0(m5) & 1(m7) & X(m6) \ 11 & 0(m12) & X(m13) & 0(m15) & 1(m14) \...