Boolean Algebra Review

Why Is This Useful?

• Logic minimization : reduce complexity at gate level (instead of boolean algebra)

  • Allows us to build smaller and faster hardware

  • we care about

    • of gates

    • of literals (inputs)

    

    Each Gate on The Right Have Less Literals

    • of gate levels

    

    Right Side Have Less Levels

    • types of logic gates.

The Gates Are Not Equal

NAND and NOR gates are UNIVERSAL gates,

Can recreate all other gates using only NAND or only NOR gates

With DeMorgan’s Law, we can convert from AND/OR to NAND/NOR gates

Example

Lecture Notes

Vreilog

• Language for describing hardware
  • Simulate behavior before implementing
  • Find bugs early
  • Enable tools to automatically create implementation