PPT Slide

2 – Combinational Logic

© 1996 Gaetano Borriello

Proving theorems (cont'd)

• Using perfect induction (complete truth table):

  • e.g., de Morgan's:

13

(X + Y)' = X' • Y'NOR is equivalent to AND with inputs complemented

(X • Y)' = X' + Y'NAND is equivalent to OR with inputs complemented

Previous slide

Next slide

Back to first slide

View graphic version