1. CSC 110 - Intro. to Computing Lecture 5: Gates, Circuits, & Transistors

2. Announcements Homework available on Blackboard  Homework due Friday at 4:00PM Hand to me or put in my box in Wehle 207  Quiz on this material next Thursday Quiz last week went fairly well  Top was 100; Mean was 77 (σ = 20.7)  Scores available on Blackboard Come to my office to pick up your quiz

3. Announcements CSC tutors are now available  Hours posted outside Wehle 208  Also come to my office hours, make an appointment, or call/e-mail me questions

4. Circuit Design In your group, complete work with circuits  Compute the truth tables for circuits  Draw the diagrams for these equations

5. Truth Table

6. Truth Table

7. Circuit Design

8. Circuit Design

9. Algebraic Properties Law of Double Negation: a’’ = a

10. Improving Circuit Design CircuitProperty Used in this Step Identity Commutative Distributive

11. Improving Circuit Design CircuitProperty Used in this Step Identity DeMorgan’s Law Associativity Commutativity Distributive Identity Distributive Identity

12. Circuit Propagation Delay Time taken for signal to get through circuit  Important measure when building processor  Gate cannot generate results until it has all of its inputs Each gate starts at the time of the latest input  Each gate requires a set amount of time to complete Could be specific amount of time (e.g., 10 ps) Or state result as multiple of gate delays

13. How are these improved? How long will this circuit need to complete?

14. How are these improved? How long will it take for the signal to propagate through?

15. Circuit Delay Propagation What is the propagation delay for this circuit?

16. Circuit Delay Propagation What about this circuit?

17. Transistors Transistors used to implement gates  Uses a semiconductive material Material can serve as both conductor and insulator Silicon is the preferred semiconductor because of cost. Why is it so cheap?

18. Transistors Originally invented by Bell Labs in 1947  Have been improved since then… Can switch on-and-off in nanoseconds Each transistor dissipates energy  Why is this be a problem?

19. My View of Transistor Source

20. My View of Transistor Ground

21. My View of Transistor Output

22. My View of Circuit Input: Franklin “off” flying a kite

23. My View of Circuit Input: Franklin “on” poking key

24. Engineer’s View of a Circuit Source connects system power  Always at +5V (e.g. “high” state or 1) Ground drains transistor’s energy  Leaves transistor at +1V (e.g. 0) When V in controls “base”  Acts like on-off switch  When on, source drains into ground  When off, source signal sent to V out

25. Transistor Design Turns out NOT, NAND, and NOR are easiest gates to turn into transistors  How do these work?

26. Transistor Design Apple wanted NAND-based memory (rather than NOR-based) for iPod Nano. Why?

27. Combinatorial Circuits So far, all circuits have been combinatorial  Output is determined only by input values  Why would we need other circuits?

28. Sequential Circuits Sequential circuits include another feature  Output determine by inputs AND current state  Used when current state is important detail E.g., Memory

29. S-R Latch S-R latch stores single binary digit (1 or 0)  Result is value of X Inputs stand for Set and Reset Could also be implemented with NOR gates Adapted from Computer Science Illuminated, Dale and Lewis, p. 112 X’

30. S-R Latch X’ Normally, S & R = 1  Maintains value of X S = 1, R = 0  X = 0  Called the “set state” S = 0, R = 1  X = 1  Called the “reset state” Latches also called “flip-flop”s

31. For next lecture Start doing the homework Start reading Section 5 Be ready to discuss:  What Individual Computer Component Descriptions Mean Sizes Disks Speed