CSEE 3827: Fundamentals of Computer Systems Lecture 2 January 26, - - PowerPoint PPT Presentation

csee 3827 fundamentals of computer systems
SMART_READER_LITE
LIVE PREVIEW

CSEE 3827: Fundamentals of Computer Systems Lecture 2 January 26, - - PowerPoint PPT Presentation

CSEE 3827: Fundamentals of Computer Systems Lecture 2 January 26, 2009 Martha Kim mak2191@columbia.edu 1 1 Agenda TA office hours Boolean algebra Logic gates Circuit fabrication 2 2 TA Office Hours TA Room, first floor


slide-1
SLIDE 1

CSEE 3827: Fundamentals of Computer Systems

Lecture 2 January 26, 2009 Martha Kim mak2191@columbia.edu

1

1

slide-2
SLIDE 2

Agenda

  • TA office hours
  • Boolean algebra
  • Logic gates
  • Circuit fabrication

2

2

slide-3
SLIDE 3

TA Office Hours

Roopa Kakarlapudi Tuesdays 5-6:30PM Harsh Parekh Mondays 11-12:20PM; Tuesdays 3:30-5PM Nishant Shah Wednesdays 10-11:30AM

TA Room, first floor of Mudd (see: http://ta.cs.columbia.edu/tamap.shtml)

3

slide-4
SLIDE 4

Boolean Logic

  • Binary digits (or bits) have two values: {1,0}
  • All logical functions can be implemented in terms of three logical operations:

x x

1

1 x y x y 1 1 1 1

1

.

x y

x + y

1

1

1

1

1 1

1

NOT AND OR

4

4

slide-5
SLIDE 5

Boolean Logic 2

  • Precedence rules just like decimal system
  • Implied precedence: NOT > AND > OR
  • Use parentheses as necessary

5

AB + C = (AB) + C (A + B)C = ((A) + B)C

5

slide-6
SLIDE 6

Boolean Logic: Example

D X A

L=DX + A

1 1 1 1 1 1 1 1 1 1 1 1

6

6

slide-7
SLIDE 7

Boolean Logic: Example

D X A X DX

L=DX + A

1

1

1 1

1 1 1

1

1

1 1 1

1 1

1 1 1

1 1 1 1 1

1

(M&K Table 2-2)

7

7

slide-8
SLIDE 8

Boolean Logic: Example 2

X Y XY + XY

1 1 1 1

8

8

slide-9
SLIDE 9

Boolean Logic: Example 2

X Y X Y XY XY XY + XY

1 1 1 1

1

1

1

1

1 1

1 1

9

9

slide-10
SLIDE 10

Boolean Algebra: Identities and Theorems

OR AND NOT X+0 = X X1 = X (identity) X+1 = 1 X0 = 0 (null) X+X = X XX = X

(idempotent)

X+X = 1 XX = 0 (complementarity) X = X (involution) X+Y = Y+X XY = YX (commutativity) X+(Y+Z) = (X+Y)+Z X(YZ) = (XY)Z (associativity) X(Y+Z) = XY + XZ X+YZ = (X+Y)(X+Z) (distributive) X+Y = X Y XY = X + Y

(DeMorgan’s theorem)

10

10

slide-11
SLIDE 11

Boolean Algebra: Example

F = XYZ + XYZ + XZ

Simplify this equation using algebraic manipulation.

11

11

slide-12
SLIDE 12

Boolean Algebra: Example

F = XYZ + XYZ + XZ

XY(Z + Z) + XZ (by reverse distribution) XY1 + XZ (by complementarity) XY + XZ (by identity)

Simplify this equation using algebraic manipulation.

12

12

slide-13
SLIDE 13

Boolean Algebra: Example 2

F = AB + AB F =

Find the complement of F.

13

13

slide-14
SLIDE 14

Boolean Algebra: Example 2

F = AB + AB F = AB + AB

(AB) (AB) (by DeMorgan’s) (A + B) (A + B) (by DeMorgan’s) (A + B) (A + B) (by involution)

Find the complement of F.

14

14

slide-15
SLIDE 15

Boolean Algebra: Why? These circuits consume area, power, and time

15

15

slide-16
SLIDE 16

Logic gate area

16

16

slide-17
SLIDE 17

Information signaled through voltage level

1.3 v 0.0 v 0.0 v (AND)

17

17

slide-18
SLIDE 18

Idealized timing diagram of AND gate

(AND)

A B Q

18

18

slide-19
SLIDE 19

Actual signal timing has delays

  • transition time: time required for
  • utput to change (RC delay:
  • hms x farads = time
  • propagation time: time from

input change to output change

19

19

slide-20
SLIDE 20

Returning to boolean algebra...

F = XYZ + XYZ + XZ

XY(Z + Z) + XZ (by reverse distribution) XY1 + XZ (by complementarity) XY + XZ (by identity)

20

20

slide-21
SLIDE 21

Returning to boolean algebra...

21

21

slide-22
SLIDE 22

Universal gates: NAND, NOR

x y z = xy

1

1

1

1

1

1 1

XY

x y z = x+y

1

1 1 1 1

X+Y

22

22

slide-23
SLIDE 23

Universal how?

23

23

slide-24
SLIDE 24

Boolean algebra practice 1

1 = AB + BC + AB + BC

B (A + A) + B (C+C) (by distribution) B + B (by complementarity) 1 (by complementarity)

Prove that this boolean equation is true using algebraic manipulation.

24

24

slide-25
SLIDE 25

Boolean algebra practice 2

X + Y = XY + XY + XY

XY + XY + XY + XY (by idempotence) X (Y + Y) + Y (X + X) (by distribution) X 1 + Y 1 (by null) X + Y (by identity)

Prove that this boolean equation is true using algebraic manipulation.

25

25

slide-26
SLIDE 26

Boolean algebra practice 3

F = (VW + X)Y + Z F = (VW + X)Y + Z

((VW + X)Y)Z (by DeMorgan’s) ((VW + X) + Y)Z

(by DeMorgan’s & involution)

(VW X + Y)Z (by DeMorgan’s) ((V + W)X + Y)Z (by DeMorgan’s) ((V + W)X + Y)Z (by null)

Find the complement of F.

26

26

slide-27
SLIDE 27

Integrated circuit fabrication

raw silicon crystallization

  • f molten silicon

silicon ingots wafer

27

27

slide-28
SLIDE 28

Integrated circuit fabrication 2

wafer processed wafer

28

28

slide-29
SLIDE 29

Integrated circuit fabrication 3

processed wafer dicing packaging

29

29

slide-30
SLIDE 30

Integrated circuit fabrication 4

packaged die test

$$$

30

30

slide-31
SLIDE 31

A more detailed tutorial on integrated circuit fabrication:

31

http://www.necel.com/fab/en/flow.html

31

slide-32
SLIDE 32

Next class: more boolean algebra, duals

32

32