Fundamental Hardware Elements of Computers: Boolean algebra

UNIT 2 - ⇑ Fundamental Hardware Elements of Computers ⇑

← Building circuits Boolean algebra Simplifying boolean equations →

We have met gate logic and combinations of gates. Another way of representing gate logic is through boolean algebra, a way of algebraically representing logic gates. You should have already covered the symbols, below is a quick reminder:

Bitwise Operator NOT(\overline{A}) AND(.) OR(+) XOR(\oplus) NAND(\overline{A . B}) NOR(\overline{A + B})
Description invert input where exactly two 1s where one or more 1s where exactly one 1 where less than two 1s where exactly two 0s

For the exam you might have:

  • to convert logic gates into boolean algebra,
  • build logic gate combinations from boolean algebra,
  • simplify boolean algebra.
Last modified on 1 October 2012, at 12:58