/
Computer Organization and Design Computer Organization and Design

Computer Organization and Design - PowerPoint Presentation

cheryl-pisano
cheryl-pisano . @cheryl-pisano
Follow
424 views
Uploaded On 2018-03-18

Computer Organization and Design - PPT Presentation

Transistors and all that a brief overview Montek Singh Oct 25 2017 Lecture 9 1 Todays Topics Where are we in this course Todays topics Why go digital E ncoding bits using voltages ID: 656117

input output gate digital output input digital gate cmos inputs conducts pull gates voltage network elements harris source high

Share:

Link:

Embed:

Download Presentation from below link

Download Presentation The PPT/PDF document "Computer Organization and Design" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.


Presentation Transcript

Slide1

Computer Organization and DesignTransistors and all that…a brief overview

Montek SinghOct 25, 2017Lecture 9

1Slide2

Today’s TopicsWhere are we in this course?Today’s topicsWhy go digital?Encoding bits using voltagesDigital design primitivestransistors and gates

2Slide3

Let’s go digital!Why DIGITAL?… because it helps guarantee a reliable system

The price we pay for this robustness?All the information that we transfer between components is only 1 crummy bit!But, in exchange, we get a guarantee of a reliable system.

0 or 1

3Slide4

The Digital AbstractionReal World

“Ideal”Abstract World

Volts or

Electrons or

Ergs or Gallons

Bits

0/1

Keep in mind,

the world is not digital, we engineer it to behave so.

We must use real physical phenomena to implement digital designs!

Noise

Manufacturing

Variations

4Slide5

Types of Digital ComponentsTwo categories of componentsthose whose output only depends on their current inputscalled COMBINATIONALthey are “memory-less”, don’t remember the pastthose who output depends also on their past statecalled SEQUENTIALthey are “state-holding”, remember their pastkey to building memories

5Slide6

TerminologySystema reasonably large assembly of componentsdivision of a system into components is typically arbitrary but almost always hierarchicalComponent/Elementan individual part of a bigger systemclearly-defined function and interfaceimplement it and put a black-box around itlarger components created using smaller componentsCircuita small (often leaf-level) component consisting of a network of gates

6Slide7

Combinational ComponentsA circuit is combinational if-and-only-if it has:one or more digital inputsone or more digital outputsa functional specification that details the value of each output for every possible combination of valid input valuesoutput depends only on the

latest inputsa timing specification consisting (at minimum) of an upper bound tpd on the time

this circuit will

take to produce the output value

once stable

valid input

values are applied

Output a

1

if at

least 2 out of 3 of

my inputs are a “1”.Otherwise, output “0”.I will generate a validoutput in no more than2 minutes after seeing valid inputs

input A

input Binput C

output Y7tpd =“propagation delay”Slide8

A Combinational Digital SystemTheorem: A system of interconnected elements is combinational if-and-only-if:each primitive circuit element is combinationalevery input is connected to exactly one output or directly to a source of 0’s or 1’

sthe circuit contains no directed cyclesno feedback (yet!)Proof: By inductionStart with the rightmost level of elementstheir output only depends on their inputs, which in turn are outputs of the level of element just to their leftand so on… until you arrive at the leftmost inputs

But, in order to realize digital processing

elements we have one more requirement!

8Slide9

Noise MarginsKey idea: Keep “0”s distinct from the “1”ssay, “

0” is represented by min voltage (e.g., 0 volts)… “1” is represented by high voltage (e.g., 1.8 volts)use the same voltage representation throughout the entire system!

For reliability, outlaw

close calls

forbid a range of voltages between

0

and

1

”voltsForbidden ZoneValid“0”Valid“1”

InvalidCONSEQUENCE: Notion of “VALID” and “INVALID” logic levels

Min VoltageMax Voltage

9Slide10

AND

Digital Processing Elements

Some digital processing elements occur so frequently that we give them special names and symbols

A

Y

I will

only

output

a

1

if

all

my

inputs are ‘1’A

BY

OR

I will output a

‘1’ if any of myinputs are ‘1’A

BYA

YABY

XOR

I will only output a

1

if an odd number

of my inputs are

1’buffer

inverterI will output thecomplement ofmy input

I will copy andrestore my inputto my output

10Slide11

AND

Digital Processing Elements

Some digital processing elements occur so frequently that we give them special names and symbols

A

Y

A

B

Y

OR

A

B

Y

A

Y

A

B

Y

XOR

buffer

inverter

11Slide12

Most common technology today… is called CMOSeverything built using transistorsa transistor is just a switch2 types of transistorsn-typecalled “NFET”, or “nMOS” or “n channel transistor” or “n transistor”switch is on (i.e., conducts) when its control input is ‘1’p-typecalled “PFET”, or “pMOS”, or “p channel transistor” or “p transistor”switch is on (i.e., conducts) when its control input is ‘0’need both types to build useful gates

12Slide13

Transistors as switchesAt an abstract level, transistors are merely switches3-ported voltage-controlled switchn-type: conduct when control input is 1p-type: conduct when control input is 013Slide14

Silicon as a semiconductorTransistors are built from siliconPure Si itself does not conduct wellImpurities are added to make it conductingAs provides free electrons  n-typeB provides free “holes”  p-typeSilicon lattice and dopant

atoms (from Harris and Harris)Slide15

MOS TransistorsMOS = Metal-oxide semiconductor3 terminalsgate: the voltage here controls whether current flowssource and drain: are what the current flows betweenstructurally, source and drain are the samenMOS and pMOS transistors (from Harris and Harris)Slide16

nMOS TransistorsGate = 0OFF = disconnectno current flows between source & drainGate = 1ON= connectcurrent can flow between source & drainpositive gate voltage draws in electrons to form a channel

nMOS transistor operation (from Harris and Harris)Slide17

pMOS TransistorsJust the oppositeGate = 1  disconnectGate = 0  connect17Slide18

Summary: nMOS and pMOS TransistorsSummary:18Slide19

CMOS TopologiesThere is actually more to it than connect/disconnectnMOS: pass good 0’s, but bad 1’sso connect source to GNDpMOS: pass good 1’s, but bad 0’sso connect source to VDDTypically use them incomplementary fashion:nMOS network at bottompulls output value down to 0pMOS network at toppulls output value up to 1only one of the two networks must conduct at a time!or output is undefined (or smoke may be produced!)if neither network conducts  output will be floating

19Slide20

CMOS Gate RecipeUse complementary networks of p- and n-transistorscalled CMOS (“complementary metal-oxide semiconductor”)at any time: either

“pullup” active, or “pulldown” activenever

both!

pullup

:

make this connection

when some combination of inputs

is

near 0 so that

output =

V

DD

pulldown

: make this connectionwhen some combination of inputsis near VDD so that output = 0 (Gnd)Use p-type here

Use

n

-type

here

V

DD

GndSlide21

CMOS Inverter

V

in

V

out

V

in

V

out

A

Y

inverter

Only a narrow range of input voltages result in

invalid

output values. (This diagram is greatly exaggerated)

Valid

1

Valid

0

Invalid

1

0

0

1

”Slide22

CMOS Complements

conducts when A is high

conducts when A is low

conducts when A is high

and

B is high: A

.

B

A

B

A

B

conducts when A is low

or

B is low: A+B = A

.

B

conducts when A is high

or

B is high: A+BA

B

AB

conducts when A is lowand B is low: A.B = A+BA

A

Series N connections:

Parallel N connections:

Parallel P connections:

Series P connections:Slide23

Simplest CMOS gate: Inverter23

A

P1

N1

Y

0

ON

OFF

1

1

OFF

ON

0Slide24

A Two Input Logic GateWhat function doesthis gate compute?

A B Y0 00 1

1 0

1 1

(see next slide)Slide25

NAND25

A

B

P1

P2

N1

N2

Y

0

0

ON

ON

OFF

OFF

1

01ON

OFFOFFON110

OFF

ON

ONOFF111

OFFOFFONON

0Slide26

3-Input NANDSlide27

Here’s Another…What function doesthis gate compute?

A B Y

0 0

0 1

1 0

1 1

2-input NOR gate

1

0

0

0Slide28

3-input NOR Gate?28Slide29

2-input AND Gate?Why can’t we make an AND gate directly, using a single CMOS gate?29Slide30

CMOS Gates Like to InvertObservation: CMOS gates tend to be inverting! One or more “0” inputs are necessary to generate a “1” output

One or more “1” inputs are necessary to generate a “0

output

Why?Slide31

Drawing StyleIndicate inputs and outputs using arrowsor: inputs at left/top, outputs at right/bottomIf possible, gates should flow from left to rightor: top to bottomStraight wires bestor: keep bends at a minimum (preferably 90 deg)Connections:wires always connect at a “T” junctiona dot at a wire crossing indicates connectionwire crossing without a dot means no connection31Slide32

Drawing Style (contd.)Wire connectionsA dot where wires cross indicates a connectionWires crossing without a dot make no connectionWires always connect at a T junction

32Slide33

A More Complex CMOS GateDesign a single gate that computes Step 1. Determine pull-down network that sets output to ‘0’(A OR B) AND C  Y=0Step 2. Determine pull-up network by walking through pulldown hierarchy, andreplacing n-transistors with p-transistorsseries composition with parallel compositionparallel composition with series compositionStep 3. Combine the pull-up and pull-down networks together

C

A

B

C

A

B

C

A

B

C

A

B

YSlide34

A More Complex CMOS Gate (contd.)Single gate that computes called “complex gate” because it is not one of the basic gates (NAND, NOR, NOT, etc.)this one is actually called OR-AND-INVERT (OAI)symbol:

C

A

B

C

A

B

YSlide35

One More ExerciseLets construct a gate to compute:F = A+BC = NOT(OR(A,AND(B,C)))Step 1: Draw the pull-down networkStep 2: The complementary pull-up networkthis one is called AND-OR-INVERT (AOI)

F

A

B

C

V

dd

A

B

CSlide36

One More ExerciseLets construct a gate to compute:F = A+BC = NOT(OR(A,AND(B,C)))Step 1: Draw the pull-down networkStep 2: The complementary pull-up networkStep 3: Combine and Verify

F

A

B

C

V

dd

A

B

C

A

B

C

F

0

0

0

0

0

1

0

1

0

0

1

1

1

0

0

1

0

1

1

10

1

1

1

1

1

1

0

0

0

0

0Slide37

NextThis lecturebasics of transistorsCMOS gatesNext lectureBoolean algebragate-level design37