Digital Logic

Gates, boolean simplification and memory, built from the ground up. Start with a single NAND gate and end up with circuits that remember.

23 lessons across 3 sections

Start with Implementation of AND Gate from NAND Gate →

Gate & Circuit Implementations

  1. 1Implementation of AND Gate from NAND Gate→
  2. 2Implementation of OR Gate from NAND Gate→
  3. 3Implementation of NOT Gate from NAND Gate→
  4. 4Implementation of XOR Gate from NAND Gate→
  5. 5Implementation of NOR Gate from NAND Gate→
  6. 6Implementation of AND Gate from NOR Gate→
  7. 7Implementation of OR Gate from NOR Gate→
  8. 8Implementation of NOT Gate from NOR Gate→
  9. 9Implementation of XOR Gate from NOR Gate→
  10. 10Implementation of XNOR Gate from NAND Gate→
  11. 11Half Adder: Implementation and Truth Table→
  12. 12Full Adder: Implementation and Truth Table→
  13. 13Half Subtractor: Implementation and Truth Table→
  14. 14Implementation of an SR Latch Using NAND Gates→
  15. 15Implementation of a 2:1 Multiplexer Using Logic Gates→

Intro To Karnaugh Maps

  1. 1From Truth Table to Formula, By Hand→
  2. 22-Variable Karnaugh Maps→
  3. 33-Variable Karnaugh Maps and the Wraparound Rule→
  4. 44-Variable Karnaugh Maps and the Four Corners→

Understanding Sequential Logic

  1. 1Why Circuits Need Memory→
  2. 2The SR Latch: Two Gates Remembering a Bit→
  3. 3The Gated D Latch: Controlling When Memory Updates→
  4. 4The D Flip-Flop: From Level to Edge→