ese 570: digital integrated circuits and vlsi …ese570/spring2019/handouts/...gate layout algorithm...

80
ESE 570: Digital Integrated Circuits and VLSI Fundamentals Lec 16: March 19, 2019 Euler Paths and Energy Basics & Optimization Penn ESE 570 Spring 2019 – Khanna

Upload: others

Post on 17-Feb-2020

6 views

Category:

Documents


1 download

TRANSCRIPT

Page 1: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

ESE 570: Digital Integrated Circuits and VLSI Fundamentals

Lec 16: March 19, 2019 Euler Paths and Energy Basics &

Optimization

Penn ESE 570 Spring 2019 – Khanna

Page 2: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Lecture Outline

!  Pass Transistor Logic !  Logic Comparison !  Transmission Gates !  Euler Paths !  Energy Basics & Optimization

2 Penn ESE 570 Spring 2019 – Khanna

Page 3: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Pass Transistor Logic

Penn ESE 570 Spring 2019 – Khanna

Page 4: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Restore Output

4 Penn ESE 570 Spring 2019 – Khanna

Page 5: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Voltage of Chain

!  What is voltage at output?

5 Penn ESE 570 Spring 2019 - Khanna

Vdd=1V Vthn=-Vthp=0.3V

Page 6: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

How compare

!  Compare

6 Penn ESE 570 Spring 2019 - Khanna

Page 7: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

DC Analysis – chain of 3

7 Penn ESE 570 Spring 2019 - Khanna

Page 8: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

DC Analysis – chain of 6

8 Penn ESE 570 Spring 2019 - Khanna

Page 9: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Conclude

!  Can chain any number of pass transistors and only drop a single Vth

9

Penn ESE 570 Spring 2019 - Khanna

Page 10: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Transient

10 Penn ESE 570 Spring 2019 - Khanna

Page 11: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Transient: Zoomed Closeup

11 Penn ESE 570 Spring 2019 - Khanna

Page 12: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Gate Cascade?

!  What are voltages?

12 Penn ESE 570 Spring 2019 - Khanna

Vdd=1V Vthn=-Vthp=0.3V

Page 13: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Chain Together

13 Penn ESE 570 Spring 2019 – Khanna

Page 14: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Cascaded Pass Gates

14 Penn ESE 570 Spring 2019 – Khanna

Page 15: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Delay A=1, B=0, CDB=Cdiff=Cd?

!  What’s the equivalent RC circuit?

15 Penn ESE 570 Spring 2019 – Khanna

3Cd 2Cd+2Cg

2Cg

Page 16: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Delay A=1, B=0, CDB=Cdiff=Cd?

!  What’s the equivalent RC circuit? "  What is the total delay?

"  From A to Y

16 Penn ESE 570 Spring 2019 – Khanna

3Cd 2Cd+2Cg

2Cg

Page 17: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

17

!  What’s the equivalent RC circuit?

Delay A=1, B=1, CDB=Cdiff=Cd?

Penn ESE 570 Spring 2019 – Khanna

2Cg

Page 18: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Cascading Pass Gates

/b

b

/b

W=1 L=1

W=1 L=1

/c

c

/c

/d

d

/d

y

/y

W=1 L=1

W=1 L=1

W=1 L=1

W=1 L=1

A

one stage

W=1 L=1

W=1 L=1

Penn ESE 3570 Spring 2019 - Khanna 18

Page 19: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

!  Extract key path

19

Chain without Inverters

Penn ESE 570 Spring 2019 - Khanna

/a

a

Page 20: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Logic Types

!  CMOS Gates "  Dual pull-down and pull-up networks, only one enabled at a time "  Performance of gate is strong function of the fanin of gate

"  Techniques to improve performance include sizing, input reordering, and buffering (staging)

!  Ratioed Gates "  Have active pull-down (-up) network connected to load device "  Reduced gate complexity at expense of static power asymmetric transfer

function "  Techniques to improve performance include sizing to improve noise margins and reduce

static power

!  Pass Gates "  Implement logic gate as switch network for reduced area and load

capacitance "  Long cascades of switches result in quadratic increase in delay "  Also suffer from reduced noise margins (VT drop)

"  Use level-restoring buffers to improve noise margins

!  Dynamic logic … coming up soon 20 Penn ESE 570 Spring 2019 – Khanna

Page 21: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Transmission Gates

Penn ESE 570 Spring 2019 – Khanna

Page 22: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

CMOS Transmission Gates

22

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

Penn ESE 570 Spring 2019 – Khanna

CLK

CLK

Page 23: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

CMOS Transmission Gates

23

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

Penn ESE 570 Spring 2019 – Khanna

Page 24: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

CMOS Transmission Gates

24

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

at t = 0-: Vin = 0, Vout = 0 at t = 0+: Vin = 0 -> VDD

Note

Penn ESE 570 Spring 2019 – Khanna

Page 25: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

CMOS Transmission Gates

25

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

at t = 0-: Vin = 0, Vout = 0 at t = 0+: Vin = 0 -> VDD

Note

- VTp

≥ ≥

Penn ESE 570 Spring 2019 – Khanna

Page 26: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

CMOS Transmission Gates

26

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

at t = 0-: Vin = 0, Vout = 0 at t = 0+: Vin = 0 -> VDD

Note

- VTp

≥ ≥

Penn ESE 570 Spring 2019 – Khanna

Page 27: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

CMOS Transmission Gates

27

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

at t = 0-: Vin = 0, Vout = 0 at t = 0+: Vin = 0 -> VDD

Note

- VTp

≥ ≥

Penn ESE 570 Spring 2019 – Khanna

Page 28: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

CMOS Transmission Gates

28 - VTp

≥ ≥

Penn ESE 570 Spring 2019 – Khanna

Page 29: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Transmission Gate, Req

29

kp (- VDD - VTp)2

kp [2(- VDD - Vtp) (Vout – VDD) - (Vout – VDD)2]

kp [2(- VDD - Vtp) - (Vout – VDD)]

kp [2(- VDD - Vtp) (Vout – VDD) - (Vout – VDD)2]

kp [2(- VDD - Vtp) - (Vout – VDD)]

Penn ESE 570 Spring 2019 – Khanna

Page 30: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

30

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

Transmission Gate, Req

Penn ESE 570 Spring 2019 – Khanna

Page 31: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

31

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

Transmission Gate, Req

Penn ESE 570 Spring 2019 – Khanna

Page 32: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Transmission Gate Layouts

32

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

Penn ESE 570 Spring 2019 – Khanna

Page 33: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Transmission Gate Layouts

33

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

Penn ESE 570 Spring 2019 – Khanna

Page 34: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Euler Paths

Penn ESE 570 Spring 2019 – Khanna

Page 35: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

NOR2 Layout

35

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

Penn ESE 570 Spring 2019 – Khanna

Page 36: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

NAND2 Layout

36 Penn ESE 570 Spring 2019 – Khanna

Page 37: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Layout of Complex CMOS Gate

37

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

DS DSGND

Penn ESE 570 Spring 2019 – Khanna

Page 38: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Layout of Complex CMOS Gate

38

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

Penn ESE 570 Spring 2019 – Khanna

Page 39: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

39

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

d

d d

d

d

i.e. n, p Euler paths with identical sequences of inputs

diffusion breaks

Layout of Complex CMOS Gate

Penn ESE 570 Spring 2019 – Khanna

Page 40: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Minimize Number of Diffusion Paths

40

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

Penn ESE 570 Spring 2019 – Khanna

Page 41: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Minimize Number of Diffusion Paths

41

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

Penn ESE 570 Spring 2019 – Khanna

Page 42: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Minimize Number of Diffusion Paths

42

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

Penn ESE 570 Spring 2019 – Khanna

Page 43: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Minimize Number of Diffusion Paths

43

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

Penn ESE 570 Spring 2019 – Khanna

Page 44: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Gate Layout Algorithm

!  1. Find all Euler paths that cover the graph !  2. Find common n- and p- Euler paths !  3. If no common n- and p- Euler paths are found in

step 2, partition the gate n- and p- graphs into the minimum number of sub-graphs that will result in separate common n- and p- Euler paths

44

Kenneth R. Laker, University of Pennsylvania,

updated 26Feb15

Penn ESE 570 Spring 2019 – Khanna

Page 45: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Energy and Power Basics

Review

Penn ESE 570 Spring 2019 – Khanna

Page 46: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Total Power

!  Ptot ≈ Pstatic + Pdyn + Psc

46 Penn ESE 570 Spring 2019 – Khanna

Page 47: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Static

Leakage Power

47 Penn ESE 570 Spring 2019 – Khanna

Page 48: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Operating Modes

!  Steady-State: Vin=Vdd

"  PMOS: subthreshold "  NMOS: resistive

48

IDSp = −IS#WL

$

% &

'

( ) e

−VGS −VTnkT / q

$

% &

'

( )

1− eVDSkT / q$

% &

'

( )

$

% & &

'

( ) ) 1− λVDS( )

IDSn = µnCOXWL

!

"#

$

%& VGS −VT( )VDS −

VDS2

2(

)*

+

,-

Penn ESE 570 Spring 2019 – Khanna

Page 49: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Static Power – Ratioed Logic

!  Istatic ?

!  Input low-Output high? "  Ileak

49 Penn ESE 570 Spring 2019 - Khanna

Page 50: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Static Power – Ratioed Logic

!  Istatic ?

!  Input low-Output high? "  Ileak

!  Input high-Output low? "  Ipmos_on

"  ~Vdd/Rp,on

50 Penn ESE 570 Spring 2019 - Khanna

Page 51: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Total Static Power

!  Pstatit ≈ p(Vout=low)V2/Rp,on

+p(Vout=high)VI’s(W/L)e-Vt/(nkT/q)

p(Vout=low) – probability the output is low p(Vout=high) – probability the output is high p(Vout=high)=1-p(Vout=low)

51 Penn ESE 570 Spring 2019 - Khanna

Page 52: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Switching

Dynamic Power

52 Penn ESE 570 Spring 2019 – Khanna

Page 53: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Switching Currents

!  Iswitch(t) = Isc(t) + Idyn(t)

53

Isc

Idyn

Penn ESE 570 Spring 2019 - Khanna

Isw

Page 54: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Switching Energy

54

!  Do we know what this is?

!  What is Q? Idyn

Q = Idyn (t)dt∫

E = P(t)dt∫= I(t)Vdd dt∫=Vdd I(t)dt∫

Q = CV = I(t)dt∫

E = CVdd2

Capacitor charging energy

Penn ESE 570 Spring 2019 – Khanna

Page 55: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Switching Power

!  Every time output switches 0#1 pay: "  E = CV2

!  Pdyn = (# 0#1 trans) × CV2 / time

!  # 0#1 trans = ½ # of transitions

!  Pdyn = (# trans) × ½CV2 / time

55 Penn ESE 570 Spring 2019 – Khanna

Page 56: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Switching

56

Short Circuit Power

Penn ESE 570 Spring 2019 – Khanna

Page 57: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Short Circuit Power

!  Between VTN and Vdd - VTP

"  Both N and P devices conducting

57 Penn ESE 570 Spring 2019 - Khanna

Page 58: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Short Circuit Power

!  Between VTN and Vdd - VTP

"  Both N and P devices conducting

!  Roughly:

58

Isc

Vin

time

Vout

Isdp

time

time

time

Vthn

Vdd

Vdd

Vdd-Vthp

Isc

tsc tsc Penn ESE 570 Spring 2019 – Khanna

Page 59: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Vin

time

Vout

Isdp

time

time

time

Vthn

Vdd

Vdd

Vdd-Vthp

Isc

tsc tsc

Peak Current

!  Ipeak around Vdd/2 "  If |VTN|=|VTP| and sized equal rise/fall

59

IDS ≈νsatCOXW VGS −VT −VDSAT

2%

& '

(

) *

I(t)dt∫ ≈ Ipeak × tsc ×12%

& ' (

) *

E =Vdd × Ipeak × tsc ×12#

$ % &

' (

Penn ESE 570 Spring 2019 – Khanna

Page 60: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Short Circuit Energy

!  Make it look like a capacitance, CSC

"  Q=I×t "  Q=CV

60

E =Vdd × I peak × tsc ×12"

#$%

&'

"

#$

%

&'

E =Vdd ×QSC

E =Vdd × (CSCVdd ) =CSCV2dd

Penn ESE 570 Spring 2019 - Khanna

Page 61: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Short Circuit Energy

!  Every time switch "  Also dissipate short-circuit energy: E = CV2

"  Different C = Csc

"  Ccs “fake” capacitance (for accounting)

61 Penn ESE 570 Spring 2019 - Khanna

Page 62: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Short Circuit Energy

!  When transistors switch, both nMOS and pMOS networks may be nano-tarily ON at once

!  Leads to a blip of “short circuit” current !  < 10% of dynamic power if rise/fall times are

comparable for input and output !  We will generally ignore this component in hand

analysis, but simulated measured results include it

Penn ESE 570 Spring 2019 - Khanna 62

Page 63: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Switching Waveforms

63 Penn ESE 570 Spring 2019 - Khanna

Page 64: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Switching Waveforms

64 Penn ESE 570 Spring 2019 - Khanna

Page 65: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Switching Power

!  Every time output switches 0#1 pay: "  E = CV2

!  Pdyn = (# 0#1 trans) × CV2 / time

!  # 0#1 trans = ½ # of transitions

!  Pdyn = (# trans) × ½CV2 / time

65 Penn ESE 570 Spring 2019 – Khanna

Page 66: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Charging Power

!  Pdyn = (# trans) × ½CV2 / time !  Often like to think about switching frequency !  Useful to consider per clock cycle

"  Frequency f = 1/clock-period

!  Pdyn = (#trans/clock) ½CV2 f

66 Penn ESE 570 Spring 2019 – Khanna

Page 67: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Charging Power

!  Pdyn = (# 0#1 trans) × CV2 / time !  Often like to think about switching frequency !  Useful to consider per clock cycle

"  Frequency f = 1/clock-period

!  Pdyn = (# 0#1 trans/clock) CV2 f

67 Penn ESE 570 Spring 2019 – Khanna

Page 68: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Switching Power

!  Pdyn = (#0#1 trans/clock) CV2 f !  Let a = activity factor

a = average #tran0#1/clock

!  Pdyn = aCV2 f

68 Penn ESE 570 Spring 2019 - Khanna

Page 69: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Activity Factor

!  Let a = activity factor "  a = average #tran0#1/clock

Penn ESE 570 Spring 2019 - Khanna 69

a = p(outi = 0)p(outi+1 =1)

a =N02NN12N

=N0(2

N − N0 )22N

Page 70: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Activity Factor

!  Let a = activity factor "  a = average #tran0#1/clock

Penn ESE 570 Spring 2019 - Khanna 70

a = p(outi = 0)p(outi+1 =1)

a = N0

2NN12N

=N0 (2

N − N0 )22N

Page 71: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Reduce Dynamic Power?

!  Pdyn = aCV2 f

!  How do we reduce dynamic power?

71 Penn ESE 570 Spring 2019 - Khanna

Page 72: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Reduce Activity Factor

Penn ESE 570 Spring 2019 - Khanna 72

A B

C D

O1

O2

F

A B

C

D

O1

O2

F

Tree Chain

a = p(outi = 0)p(outi+1 =1)

a = N0

2NN12N

=N0 (2

N − N0 )22N

Page 73: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Reduce Activity Factor

Penn ESE 570 Spring 2019 - Khanna 73

A B

C D

O1

O2

F

A B

C

D

O1

O2

F

Tree Chain

a = p(outi = 0)p(outi+1 =1)

a = N0

2NN12N

=N0 (2

N − N0 )22N

3/16

3/16

Page 74: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Reduce Activity Factor

Penn ESE 570 Spring 2019 - Khanna 74

A B

C D

O1

O2

F

A B

C

D

O1

O2

F

Tree Chain

a = p(outi = 0)p(outi+1 =1)

a = N0

2NN12N

=N0 (2

N − N0 )22N

3/16

3/16

15/256

Page 75: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Reduce Activity Factor

Penn ESE 570 Spring 2019 - Khanna 75

A B

C D

O1

O2

F

A B

C

D

O1

O2

F

Tree Chain

3/16

7/64

15/256

a = p(outi = 0)p(outi+1 =1)

a = N0

2NN12N

=N0 (2

N − N0 )22N

Page 76: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Reduce Activity Factor

Penn ESE 570 Spring 2019 - Khanna 76

A B

C D

O1

O2

F

A B

C

D

O1

O2

F

Tree Chain

3/16

7/64

15/256

a = p(outi = 0)p(outi+1 =1)

a = N0

2NN12N

=N0 (2

N − N0 )22N

3/16

3/16

15/256

Page 77: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Total Power

!  Ptot = Pstatic + Psc + Pdyn

!  Psw = Pdyn + Psc ≈ a(CloadV2f)

!  Ptot ≈ a(CloadV2f) + VI’s(W/L)e-Vt/(nkT/q)

!  Let a = activity factor a = average #tran0#1/clock

77 Penn ESE 570 Spring 2019 – Khanna

Page 78: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Idea

!  CMOS "  Design for worst case input switching case and delay

!  There are other logic disciplines "  Ratioed logic "  Can use pass transistors for logic

"  Transmission gates "  Will see in use in dynamic logic

78 Penn ESE 570 Spring 2019 – Khanna

Page 79: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Midterm Exam

!  Midterm – 3/21 "  During class; starts at exactly 1:30pm, ends at exactly 2:50pm (80

minutes) "  Location: College Hall 200 "  Old exams posted on old course websites "  Covers Lec 1- 14 + in-class worksheet "  Closed book, no notes or cheat sheets "  Calculators allowed and recommended, no smart phones

79 Penn ESE 570 Spring 2019 – Khanna

Page 80: ESE 570: Digital Integrated Circuits and VLSI …ese570/spring2019/handouts/...Gate Layout Algorithm ! 1. Find all Euler paths that cover the graph ! 2. Find common n- and p- Euler

Midterm Topics List

!  Identify CMOS/non-CMOS

!  Any logic function $# CMOS gate

!  Noise Margins !  Circuit first order

switching rise/fall times "  Output equivalent

resistance "  Load capacitance

!  Transistor "  Regions of operation "  Parasitic Capacitance

Model

!  Layout and stick diagrams

!  Sizing !  1st order delay

"  Worst case "  Elmore delay

!  Ratioed logic !  Pass logic 80 Penn ESE 570 Spring 2019 – Khanna