Synthesis using gates

Introduction using Synthesis using AND, OR, and NOT gates

Boolean expressions

• Expanded boolean expression

  • $f=s_1{s}_2+s_3$
    • this is how we represent a “truth table” (table of outputs)
      • we only care about the outputs that are non zero and we put a bar on the s that is a zero

    • after writing the simplified boolean expression

      • to factor we add another term (that already exists in the expression)

        • we add based on the fact we can get 2 common terms for all exept 1

        • then just factor

  • To turn it into gates using the expression

    • addition is and gate
    • multiplication is or

$(\overline{A}=ANANDA)$