-1

I've been trying to convert this equation $$ S_1\cdot S_3+\bar{A} $$ to NAND only but everytime i do it i get a different result, i will be glad if someone showed me the right way to properly solve this!

Thanks!

mvw
  • 34,562
LineCommander Official
  • 11
  • 2
  • Please add definitions of $S \cdot T,$ also $U +V$ and $\bar{W}.$ Also to avoid ambiguity use parentheses. – coffeemath May 20 '18 at 13:26
  • @coffeemath: these are standard (if old-fashioned) notations for conjunction, disjunction and negation and there are agreed precedence rules for them. – Rob Arthan May 20 '18 at 14:12

1 Answers1

2

Hint: let me write $A \downarrow B$ for the NAND of $A$ and $B$ and use the more modern notation $A \land B$, $A \lor B$ and $\lnot A$ for conjunction, disjunction and negation respectively. Then for any $A$ and $B$ you have $$ \begin{align*} \lnot A &\equiv A \downarrow A\\ A \land B &\equiv \lnot(A \downarrow B)\\ A \lor B &\equiv \lnot(\lnot A \land \lnot B) \end{align*} $$ Using the last rule, get rid of all the disjunctions, using the second rule, get rid of all the conjunctions and, finally, using the first rule, get rid of all the negations. (You can optimise a bit using rules like $\lnot\lnot A \equiv A$, as you go.)

Rob Arthan
  • 48,577