an algorithm for optimal decoupling capacitor sizing and placement for standard cell layouts
Download
Skip this Video
Download Presentation
An Algorithm for Optimal Decoupling Capacitor Sizing and Placement for Standard Cell Layouts

Loading in 2 Seconds...

play fullscreen
1 / 20

An Algorithm for Optimal Decoupling Capacitor Sizing and Placement for Standard Cell Layouts - PowerPoint PPT Presentation


  • 114 Views
  • Uploaded on

An Algorithm for Optimal Decoupling Capacitor Sizing and Placement for Standard Cell Layouts. Haihua Su, Sani R. Nassif IBM ARL. Sachin S. Sapatnekar ECE Department University of Minnesota. Outline. On-chip decap overview Modeling and noise analysis

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' An Algorithm for Optimal Decoupling Capacitor Sizing and Placement for Standard Cell Layouts' - alana-fulton


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
an algorithm for optimal decoupling capacitor sizing and placement for standard cell layouts

An Algorithm for Optimal Decoupling Capacitor Sizing and Placement for Standard Cell Layouts

Haihua Su, Sani R. Nassif

IBM ARL

Sachin S. Sapatnekar

ECE Department

University of Minnesota

ISPD\'02, San Diego, CA

outline
Outline
  • On-chip decap overview
  • Modeling and noise analysis
  • Problem formulation and Adjoint sensitivity analysis
  • Decap sizing and placement scheme
  • Experimental results
  • Conclusion

ISPD\'02, San Diego, CA

on chip decoupling capacitors
On-chip Decoupling Capacitors
  • Non-switching gate capacitance
  • Thin oxide capacitance

w: width of decap

h: height of decap

tox: thickness of thin oxide

ox: permittivity of SiO2

ISPD\'02, San Diego, CA

decoupling capacitor models
Decoupling Capacitor Models
  • 1st order model
  • 2nd order model (non-idealities)

ISPD\'02, San Diego, CA

power network modeling

+

Power Network Modeling
  • Power Grid: resistive mesh
  • Cells: time-varying current sources
  • Decaps: 1st order or 2nd order decap model
  • Package: inductance + ideal constant voltage source

ISPD\'02, San Diego, CA

power grid noise analysis

z(j)

+

Waveform of node j on VDD grid

Power Grid Noise Analysis
  • Noise metric: shaded area

Vj

Z= S z(j)

Reference: A. R. Conn, R. A. Haring and C. Visweswariah, Noise Considerations in Circuit Optimization, ICCAD’98

ISPD\'02, San Diego, CA

slide7

Formulation - Constrained Nonlinear Programming Problem

  • MinimizeZ(wj), j = 1..Ndecap
  • Subject to Swk  (1-ri)Wchip, i = 1..Nrow
  • And0 wjwmax , j = 1..Ndecap
    • ri is the occupancy ratio of row i

Cell

Decap

wj

ISPD\'02, San Diego, CA

solver sequential quadratic programming sqp
Solver – Sequential Quadratic Programming (SQP)
  • QPSOL - Quasi-Newton method to solve the problem of multidimensional minimization of functions with derivatives
  • Requirements
    • evaluation of the objective function and constraint functions
    • calculation of first-order derivatives

ISPD\'02, San Diego, CA

slide9

x(t)and

– nodevoltages, source currents, inductor currents

u(t) – time-dependent sources

i() – current sources applied to all bad nodes

+

Adjoint Sensitivity Analysis

  • Original circuit

Vj(t)

  • Adjoint circuit

ij()

ISPD\'02, San Diego, CA

slide10

Adjoint Sensitivity Analysis (cont’d)

  • Convolve to get sensitivities

Z is thenoise metric for all the grid = S z(j)

ISPD\'02, San Diego, CA

slide11

N linear segments

M linear segments

Adjoint Sensitivity Analysis (cont’d)

  • Fast convolution for piecewise linear waveforms

~O(N+M)

p q

ISPD\'02, San Diego, CA

slide12

Sensitivity w.r.t. Decaps

  • Adjoint sensitivity w.r.t. Cnear, R and Cfar
  • Applying chain rule to find the sensitivity w.r.t. decap width w:

ISPD\'02, San Diego, CA

slide13

Scheme

  • Analyze circuit and store waveforms
  • Compute Z
  • Setup current sources for adjoint circuit
  • Analyze adjoint circuit & store waveforms
  • Compute Z/Ci and Z/wi
  • Evaluate constraint function & gradients
  • Feed to QP solver to get the updated wi
  • According to the new wi , replace cells and decaps one by one

ISPD\'02, San Diego, CA

slide14

Start from equal distribution of decaps:

  • Iteration 1:
  • Iteration 2:

Decap Optimization Process(one row for illustration)

ISPD\'02, San Diego, CA

slide15

Chip

Opt

Num bad nodes

Num of nodes

Vmax

(V)

Z

(Vns)

Num of dcps

Num of rows

CPU time (mins)

1

Before After

105 2

974

0.193 0.176

0.121 0.000

1964

53

0.9

2

Before After

80 63

861

0.230 0.196

0.366 0.063

3288

85

15.2

3

Before After

100 70

828

0.222 0.201

0.649 0.200

3664

132

12.5

Optimization Results

Vdd=1.8V, vdroplimit =10%Vdd, ri = 80%

ISPD\'02, San Diego, CA

slide16

VDD and GND Contour (chip2)

Vmax=0.191V

Vmax=0.190V

Vmax=0.196V

Vmax=0.230V

Z=0.366(V•ns)

Z=0.063(V•ns)

ISPD\'02, San Diego, CA

slide17

Optimal Placement (chip2)

ISPD\'02, San Diego, CA

slide18

Noise Reduction Trend (chip2)

ISPD\'02, San Diego, CA

conclusion
Conclusion
  • Proposed a scheme of decoupling capacitor sizing and placement for standard-cell layouts
  • Applied after placement and before signal routing
  • Formulated into nonlinear programming problem
  • Reduced transient noise
  • Presented a fast piece-wise linear waveform convolution for adjoint sensitivity analysis

ISPD\'02, San Diego, CA

thank you
Thank you!

ISPD\'02, San Diego, CA

ad