Professional Documents
Culture Documents
04 Logic Gates
04 Logic Gates
0=1 _ 1=0
0+0 = 0 0+1 = 1 1+0 = 1 1+1 = 1
Or is a plus
And is multiplication
___
(xyz)(xyz)
F(x,y) = (xy)(xy)
1
1 0 0
1
0 1 0
0
0 0 0
4
Quick survey
a)
b) c) d)
I understand the basics of Boolean algebra Absolutely! More or less Not really Boolean what?
Todays demotivators
x y
x y
xy
x+y
x y z x y z
xyz
x+y+z
x y
x y x y
xy
x+y xy
7
x y y
Answer: (x+y)y
x+y (x+y)y y
__
Or (xy)y
x y
Answer: xy
xy
y
xy
___ __
Or (xy) xy
Quick survey
a) b) c) d)
I understand how to figure out what a logic gate does Absolutely! More or less Not really Not at all
10
x y
x+y
11
x y
x+y
x+y
(x+y)x
12
x 1 1 0 0
y 1 0 1 0
xy 0 1 1 0
x y
x+y xy xy
(x+y)(xy)
13
Quick survey
a) b) c) d)
I understand how to write a logic circuit for simple Boolean formula Absolutely! More or less Not really Not at all
14
211= 128 + 64 + 16 + 2 + 1
= 27 + 26 + 24 + 21 + 20 = 1*27 + 1*26 + 0*25 + 1*24 + 0*23 + 0*22 + 1*21 + 1*20 = 11010011 in binary
15
17
Quick survey
a) b) c) d)
I understand the basics of converting numbers between decimal and binary Absolutely! More or less Not really Not at all
18
Carry is x AND y Sum is x XOR y The circuit to compute this is called a half-adder
x 0 0 1 1
y 0 1 0 1
Carry Sum 0 0 0 1 0 1 1 0
19
The half-adder
Sum = x XOR y Carry = x AND y
x y
x y
Sum Carry
Sum Carry
20
21
Quick survey
a)
b) c) d)
I understand half adders Absolutely! More or less Not really Not at all
22
Inputs: x, y, carry in Outputs: sum, carry out Will add x and y with a half-adder Will add the sum of that to the carry in Its 1 if either (or both): x+y = 10 x+y = 01 and carry in = 1
x y c carry sum 1 1 1 1 1 1 1 0 1 0 1 0 1 1 0 0 0 1 1 1 0 1 0 1 0
0 1 0 0 0 1 0 0 0
0 0 0
1 1 0
23
c x y
X
HA
S S
s c
C C
HA
24
25
x0 y0 x1 y1 x2 y2 x3 y3
HA
s0
C X Y C
FA
s1
C X Y C
FA
s2
C X Y C
FA
s3 c
26
To add n bit binary numbers, you need 1 HA and n-1 FAs To add 32 bit binary numbers, you need 1 HA and 31 FAs
Quick survey
a) b) c) d)
I understand (more or less) about adding binary numbers using logic gates Absolutely! More or less Not really Not at all
28
29
Graph of z = y/x
Intel reluctantly agreed to replace them in 1994
30
10 Your old PC is too accurate 8.9999163362 Provides a good alibi when the IRS calls 7.9999414610 Attracted by Intel's new "You don't need to know what's inside" campaign 6.9999831538 It redefines computing--and mathematics! 5.9999835137 You've always wondered what it would be like to be a plaintiff 4.9999999021 Current paperweight not big enough 3.9998245917 Takes concept of "floating point" to a new level 2.9991523619 You always round off to the nearest hundred anyway 1.9999103517 Got a great deal from the Jet Propulsion Laboratory 31 0.9999999998 It'll probably work!!
Flip-flops
Consider the following circuit:
Memory
A flip-flop holds a single bit of memory
In reality, those transistors are split into 9 ICs of about 5 million transistors each
33
Quick survey
a)
b) c) d)
I felt I understood the material in this slide set Very well With some review, Ill be good Not really Not at all
34
Quick survey
a)
b) c) d)
The pace of the lecture for this slide set was Fast About right A little slow Too slow
35