Electrical and Computer Engineering 2277A/B Lecture Notes - Lecture 9: Nand Gate, Logic Gate

• School: Western University
• Department: Electrical and Computer Engineering
• Course: Electrical and Computer Engineering 2277A/B
• Professor: Duane Jacques

Document Summary

All major functions of a computing device can be implemented using only a single type of logic gate. All major functions of a computing device can be specified using boolean logic. All boolean expressions can be implemented using a single type of logic gate. A sum of minterms or product of maxterms can be implemented using not, and gates, and. Multiple-input or gates can be implemented by cascading the above binary or architecture. Nand-only circuits can be designed more easily if some nand gates are drawn as invert-or gates: Example: implement using only nand gates: lay out circuit using and and or gates, replace and gates with conventional nand gates. Boolean algebra and logic gates page 1: if there are any unpaired inversion bubbles, add nand-gate inverters (or obtain complemented inputs from somewhere) to cancel those bubbles, replace invert-or gates with conventional nand gates. Functions in sum-of-products form can be implemented as 2-level nand gate circuits.