1. We know binary We know how to add and subtract in binary –Same as in decimal Next up: learn how apply this knowledge Boolean and Binary Inputs

2. Discrete voltages represented by 1 and 0 For example: 0 = ground (GND) or 0 volts 1 = V DD or 5 volts What about 4.99 volts? Is that a 0 or a 1? What about 3.2 volts? Boolean and Binary Inputs

3. Logic Levels Range of voltages for 1 and 0 Different ranges for inputs and outputs to allow for noise

4. Logic Gates Perform logic functions: –inversion (NOT), AND, OR, etc. Single-input: –NOT gate, buffer Two-input: –AND, OR, etc. Boolean and Binary Inputs

5. The Static Discipline With logically valid inputs, every circuit element must produce logically valid outputs Use limited ranges of voltages to represent discrete values

6. Practical Application NM H = V OH – V IH NM L = V IL – V OL

7. Practical Application - Transistors Logic gates built from transistors 3-ported voltage-controlled switch –2 ports connected depending on voltage of 3rd –d and s are connected (ON) when g is 1

8. Boolean Algebra 8 Boolean algebra is based on the binary number system George Boole (November 2, 1815 – December 8, 1864)

9. Boolean Algebra 9 Truth Tables Boolean operations can be defined using a Truth Table. Inversion:A 01100110 AND: ABA·B 000010100111000010100111 OR: ABA+B 000011101111000011101111 or just AB

10. Boolean Algebra 10 Truth Tables Boolean operations can be defined using a Truth Table. XOR: ABABABAB 000011101110000011101110 NAND: ABA·B 001011101110001011101110 NOR: ABA+B 001010100110001010100110

11. Boolean Algebra 11 DeMorgan’s Theorems ABA·BA·BABA + B 00011110101101100101111100000001111010110110010111110000 A·B = A + BA+B = A · B Proof: ABA+BA+BABA · B 00011110110100101001011100000001111011010010100101110000

12. Boolean Algebra 12 Example ABCABCABBCBCABF 00011100000001110001010101010101101110000011100011100011010101010111000101001111000000000001110000000111000101010101010110111000001110001110001101010101011100010100111100000000 F = AB + BC + BC + AB

13. Boolean Algebra 13 Another Example F = AB + BC + BC + AC ABCCABBCBCACF 000100000001000000010101001011000101100100000101000011110111001111010111000100000001000000010101001011000101100100000101000011110111001111010111

14. Boolean Algebra 14 F = AB + BC + BC + AC ABCCABBCBCACF 000100000001000000010101001011000101100100000101000011110111001111010111000100000001000000010101001011000101100100000101000011110111001111010111 Is there a simpler way to determine how these inputs can produce these outputs? Probably.

15. Boolean Algebra 15 Simplifying logical expression using Boolean algebra is not easy. Obscure identities must be applied in clever ways (this requires LOTS of practice). There is a much easier (and more practical) way: Karnaugh maps ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 F = 0132 457 6 12131514 891110 0000 1000 1011 1111 A B C D

16. Boolean Algebra 16 ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 F = _ 0132 457 6 12131514 891110 0000 1000 1011 1111 A B C D Karnaugh maps Karnaugh Maps - Rules of Simplification Rule 1. Groups may not include any cell containing a zero

17. Boolean Algebra 17 ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 F = _ 0132 457 6 12131514 891110 0000 1000 1011 1111 A B C D Karnaugh maps Karnaugh Maps - Rules of Simplification Rule 2. Groups may be horizontal or vertical, but not diagonal.

18. Boolean Algebra 18 ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 F = 0132 457 6 12131514 891110 0000 1000 1011 1111 A B C D Karnaugh Maps - Rules of Simplification Rule 3. Groups must contain 1, 2, 4, 8, or in general 2 n cells. That is if n = 1, a group will contain two 1's since 2 1 = 2. If n = 2, a group will contain four 1's since 2 2 = 4.

19. Boolean Algebra 19 ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 F = 0132 457 6 12131514 891110 0000 1000 1011 1111 A B C D Karnaugh Maps - Rules of Simplification Rule 4. Each group should be as large as possible. Each cell containing a one must be in at least one group.

20. Boolean Algebra 20 ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 F = 0132 457 6 12131514 891110 0000 1000 1011 1111 A B C D Karnaugh Maps - Rules of Simplification Rule 5. Groups may overlap.

21. Boolean Algebra 21 ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 F = 0132 457 6 12131514 891110 0000 1000 1011 1111 A B C D Karnaugh Maps - Rules of Simplification Rule 6. Groups may wrap around the table. The leftmost cell in a row may be grouped with the rightmost cell and the top cell in a column may be grouped with the bottom cell.

22. Boolean Algebra 22 ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 F = 0132 457 6 12131514 891110 0000 1000 1011 1111 A B C D Karnaugh Maps - Rules of Simplification Rule 7. There should be as few groups as possible, as long as this does not contradict any of the previous rules.

23. Boolean Algebra 23 F = 0132 457 6 12131514 891110 0000 1000 1011 1111 A B C D Karnaugh Maps - Rules of Simplification Rule 7. There should be as few groups as possible, as long as this does not contradict any of the previous rules. Rule 6. Groups may wrap around the table. The leftmost cell in a row may be grouped with the rightmost cell and the top cell in a column may be grouped with the bottom cell. Rule 5. Groups may overlap. http://www.youtube.com/watc h?v=PA0kBrpHLM4 Rule 1. Groups may not include any cell containing a zero Rule 4. Each group should be as large as possible. Each cell containing a one must be in at least one group. Rule 3. Groups must contain 1, 2, 4, 8, or in general 2 n cells. That is if n = 1, a group will contain two 1's since 2 1 = 2. If n = 2, a group will contain four 1's since 2 2 = 4. Rule 2. Groups may be horizontal or vertical, but not diagonal.

24. Boolean Algebra 24 Simplifying logical expression using Boolean algebra is not easy. Obscure identities must be applied in clever ways (this requires LOTS of practice). There is a much easier (and more practical) way: Karnaugh maps ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111ABCDF00000000100010000110010010101001100011101000110011101011011111001110101110111111 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 F = AC + AB + BCD ___ 0132 457 6 12131514 891110 0000 1000 1011 1111 A B C D

25. Implementing Logic with Switches 25 X Y 0 1 1 0 XYL000011101110XYL000011101110 XOR: ABABABAB 000011101110000011101110

26. Logic Gates 26

27. Nicknamed “Mayor of Silicon Valley” Cofounded Fairchild Semiconductor in 1957 Cofounded Intel in 1968 Co-invented the integrated circuit Figured out how to connect multiple transistors on a silicon chip Robert Noyce (1927-1990)

28. Practical Application - MOS Transistors Metal oxide silicon (MOS) transistors: –Polysilicon (used to be metal) gate –Oxide (silicon dioxide) insulator –Doped silicon

29. Practical Application - Transistors: nMos Gate = 0 OFF (no connection between source and drain) Gate = 1 ON (channel between source and drain)

30. Practical Application - Transistors: pMOS pMOS transistor is opposite –ON when Gate = 0 –OFF when Gate = 1

31. Practical Application - Transistor Function

32. Practical Application - nMOS vs pMOS nMOS: pass good 0’s, so connect source to GND pMOS: pass good 1’s, so connect source to V DD V DD GND

33. Practical Application - CMOS Gates: nMOS AP1N1Y 0 1

34. Practical Application - CMOS Gates: nMOS AP1N1Y 0ONOFF1 1 ON0