Week 7-8 NAND and NOR Implementation

We found that we could implement general Boolean equations with these three primitives: • AND • OR • NOT  In this section we will find that either of two gates, the NAND gate or the NOR gate can be used to implement arbitrary logic functions.  We use the Positive Logic Convention (where all signals are active high) and a small circle to on a symbol to represent NOT or invert.

Download Files

week-7-8-nand-and-nor-implementation.pdf (0.09 MB )