1 / 28
Télécharger la présentation

Transistors, Boolean Algebra

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Transistors, Boolean Algebra Lecture 2 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier, 2007

  2. Overview • Review • Beneath the digital abstraction • Transistors • Boolean expressions • Boolean algebra

  3. Logic Gates

  4. More Two-Input Logic Gates

  5. Multiple-Input Logic Gates

  6. Beneath the Digital Abstraction • Suppose: 5 V = 1, 0 V = 0 • What does 4.99 V = ?

  7. Logic Levels and Noise Margins

  8. Logic Levels and Noise Margins

  9. DC Transfer Characteristics

  10. DC Transfer Characteristics

  11. The Static Discipline

  12. Logic Gates

  13. How do we build logic gates?

  14. Silicon

  15. Transistors: nMOS

  16. Transistors: pMOS

  17. Transistor Function

  18. CMOS Gates: NOT Gate

  19. CMOS Gates: NAND Gate

  20. CMOS Gate Structure

  21. NOR Gate How do you build a two-input NOR gate?

  22. Other CMOS Gates How do you build a two-input AND gate?

  23. Boolean Expressions

  24. Boolean Expressions

  25. Sum-of-Products Form

  26. Boolean Expressions

  27. Product-of-Sums Form

  28. Next Time • Combinational Logic • More Boolean Expressions / Boolean Algebra • Karnaugh maps • X’s and Z’s

More Related