Weiping Shi Department of Computer Science University of North Texas HiCap: A Fast Hierarchical Algorithm for 3D Capacitance Extraction.

Slides:



Advertisements
Similar presentations
Explicit Gate Delay Model for Timing Evaluation Muzhou Shao : University of Texas at Austin D.F.Wong : U. of Illinois at Urbana- Champaign Huijing Cao.
Advertisements

EE 201A Modeling and Optimization for VLSI LayoutJeff Wong and Dan Vasquez EE 201A Noise Modeling Jeff Wong and Dan Vasquez Electrical Engineering Department.
Design Rule Generation for Interconnect Matching Andrew B. Kahng and Rasit Onur Topaloglu {abk | rtopalog University of California, San Diego.
EE141 © Digital Integrated Circuits 2nd Wires 1 The Wires Dr. Shiyan Hu Office: EERC 731 Adapted and modified from Digital Integrated Circuits: A Design.
UCLA Modeling and Optimization for VLSI Layout Professor Lei He
Fast Algorithms For Hierarchical Range Histogram Constructions
Computer Science & Engineering Department University of California, San Diego SPICE Diego A Transistor Level Full System Simulator Chung-Kuan Cheng May.
Chop-SPICE: An Efficient SPICE Simulation Technique For Buffered RC Trees Myung-Chul Kim, Dong-Jin Lee and Igor L. Markov Dept. of EECS, University of.
An Efficient Method for Chip-Level Statistical Capacitance Extraction Considering Process Variations with Spatial Correlation W. Zhang, W. Yu, Z. Wang,
Improving the Efficiency of Full chip Capacitance Extraction
Lecture 101 Introduction to Energy Storage Elements: The Capacitor.
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 2: State Equations Prof. Chung-Kuan Cheng 1.
Chapter 5 Interconnect RLC Model n Efficient capacitance model Efficient inductance model Efficient inductance model RC and RLC circuit model generation.
1 BSMOR: Block Structure-preserving Model Order Reduction http//:eda.ee.ucla.edu Hao Yu, Lei He Electrical Engineering Dept., UCLA Sheldon S.D. Tan Electrical.
EEE340Lecture 151 Per unit length capacitance. EEE340Lecture Multi-conductor Systems This section is very useful in high speed electronics.
Numerical Integration CSE245 Lecture Notes. Content Introduction Linear Multistep Formulae Local Error and The Order of Integration Time Domain Solution.
UCSD CSE245 Notes -- Spring 2006 CSE245: Computer-Aided Circuit Simulation and Verification Lecture Notes Spring 2006 Prof. Chung-Kuan Cheng.
Gate Delay Calculation Considering the Crosstalk Capacitances Soroush Abbaspour and Massoud Pedram University of Southern California Los Angeles CA Asia.
A Solenoidal Basis Method For Efficient Inductance Extraction H emant Mahawar Vivek Sarin Weiping Shi Texas A&M University College Station, TX.
Circuit Characterization Feb 4, Basic Device Equations (p.51)  Cutoff region: V gs  V t  I ds = 0  Linear/non-saturation region: 0
Fast 3-D Interconnect Capacitance Extraction and Related Numerical Techniques Wenjian Yu EDA Lab, Dept. Computer Science & Technology, Tsinghua University.
Monte Carlo Methods in Partial Differential Equations.
More Realistic Power Grid Verification Based on Hierarchical Current and Power constraints 2 Chung-Kuan Cheng, 2 Peng Du, 2 Andrew B. Kahng, 1 Grantham.
A Methodology for Interconnect Dimension Determination By: Jeff Cobb Rajesh Garg Sunil P Khatri Department of Electrical and Computer Engineering, Texas.
On-Chip Inductance Extraction - Concept & Formulae – 2002
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 2: State Equations Prof. Chung-Kuan Cheng.
Parallel Performance of Hierarchical Multipole Algorithms for Inductance Extraction Ananth Grama, Purdue University Vivek Sarin, Texas A&M University Hemant.
1 Miodrag Bolic ARCHITECTURES FOR EFFICIENT IMPLEMENTATION OF PARTICLE FILTERS Department of Electrical and Computer Engineering Stony Brook University.
EE141 © Digital Integrated Circuits 2nd Wires 1 The Wires Dr. Shiyan Hu Office: EERC 731 Adapted and modified from Digital Integrated Circuits: A Design.
Research on Analysis and Physical Synthesis Chung-Kuan Cheng CSE Department UC San Diego
Wim Schoenmaker ©magwel2005 Electromagnetic Modeling of Back-End Structures on Semiconductors Wim Schoenmaker.
CAD for Physical Design of VLSI Circuits
Fast Low-Frequency Impedance Extraction using a Volumetric 3D Integral Formulation A.MAFFUCCI, A. TAMBURRINO, S. VENTRE, F. VILLONE EURATOM/ENEA/CREATE.
Computing a posteriori covariance in variational DA I.Gejadze, F.-X. Le Dimet, V.Shutyaev.
PiCAP: A Parallel and Incremental Capacitance Extraction Considering Stochastic Process Variation Fang Gong 1, Hao Yu 2, and Lei He 1 1 Electrical Engineering.
An Efficient Clustering Algorithm For Low Power Clock Tree Synthesis Rupesh S. Shelar Enterprise Microprocessor Group Intel Corporation, Hillsboro, OR.
The Geometry of Biomolecular Solvation 2. Electrostatics Patrice Koehl Computer Science and Genome Center
1 ELEC 3105 Basic EM and Power Engineering Start Solutions to Poisson’s and/or Laplace’s.
Statistical Sampling-Based Parametric Analysis of Power Grids Dr. Peng Li Presented by Xueqian Zhao EE5970 Seminar.
The Fast Optimal Voltage Partitioning Algorithm For Peak Power Density Minimization Jia Wang, Shiyan Hu Department of Electrical and Computer Engineering.
Accelerating Statistical Static Timing Analysis Using Graphics Processing Units Kanupriya Gulati and Sunil P. Khatri Department of ECE, Texas A&M University,
C GasparAdvances in Numerical Algorithms, Graz, Fast interpolation techniques and meshless methods Csaba Gáspár Széchenyi István University, Department.
Scalable Symbolic Model Order Reduction Yiyu Shi*, Lei He* and C. J. Richard Shi + *Electrical Engineering Department, UCLA + Electrical Engineering Department,
Tarek A. El-Moselhy and Luca Daniel
Analysis and Design of Multi-Wave Dilectrometer (MWD) for Characterization of Planetary Subsurface Using Finite Element Method Manohar D. Deshpande and.
Elliptic PDEs and the Finite Difference Method
On the Use of Sparse Direct Solver in a Projection Method for Generalized Eigenvalue Problems Using Numerical Integration Takamitsu Watanabe and Yusaku.
1 Complex Images k’k’ k”k” k0k0 -k0-k0 branch cut   k 0 pole C1C1 C0C0 from the Sommerfeld identity, the complex exponentials must be a function.
Introduction to CST MWS
Very Fast Chip-level Thermal Analysis Keiji Nakabayashi†, Tamiyo Nakabayashi‡, and Kazuo Nakajima* †Graduate School of Information Science, Nara Institute.
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 2: State Equations Spring 2010 Prof. Chung-Kuan Cheng.
Application: Multiresolution Curves Jyun-Ming Chen Spring 2001.
Data Structures and Algorithms in Parallel Computing Lecture 10.
Monte Carlo Linear Algebra Techniques and Their Parallelization Ashok Srinivasan Computer Science Florida State University
1 An Efficient Optimal Leaf Ordering for Hierarchical Clustering in Microarray Gene Expression Data Analysis Jianting Zhang Le Gruenwald School of Computer.
A Fully Polynomial Time Approximation Scheme for Timing Driven Minimum Cost Buffer Insertion Shiyan Hu*, Zhuo Li**, Charles Alpert** *Dept of Electrical.
Fast BEM Algorithms for 3D Interconnect Capacitance and Resistance Extraction Wenjian Yu EDA Lab, Dept. Computer Science & Technology, Tsinghua University.
An O(bn 2 ) Time Algorithm for Optimal Buffer Insertion with b Buffer Types Authors: Zhuo Li and Weiping Shi Presenter: Sunil Khatri Department of Electrical.
Multipole-Based Preconditioners for Sparse Linear Systems. Ananth Grama Purdue University. Supported by the National Science Foundation.
An O(nm) Time Algorithm for Optimal Buffer Insertion of m Sink Nets Zhuo Li and Weiping Shi {zhuoli, Texas A&M University College Station,
הטכניון - מ.ט.ל. הפקולטה להנדסת חשמל - אביב תשס"ה
Unified Adaptivity Optimization of Clock and Logic Signals Shiyan Hu and Jiang Hu Dept of Electrical and Computer Engineering Texas A&M University.
Monte Carlo Linear Algebra Techniques and Their Parallelization Ashok Srinivasan Computer Science Florida State University
EEE 431 Computational Methods in Electrodynamics
On-Chip Inductance Extraction - Concept & Formulae – 2002
ELEC 3105 Basic EM and Power Engineering
Finite Element Method To be added later 9/18/2018 ELEN 689.
CSE245: Computer-Aided Circuit Simulation and Verification
Supported by the National Science Foundation.
Yiyu Shi*, Wei Yao*, Jinjun Xiong+ and Lei He*
Presentation transcript:

Weiping Shi Department of Computer Science University of North Texas HiCap: A Fast Hierarchical Algorithm for 3D Capacitance Extraction

Outline Introduction Previous Research Integral Equation & N-Body Problem New Algorithm Experimental Results Conclusion Future Work

Introduction Capacitance Extraction: Given a set of conductors in 3-D space, compute the capacitance between all pairs of conductors. 1V C=Q

Signal delay = gate delay + interconnect delay Interconnect delay is caused by RC (resistance and capacitance) parasitic. R C C

Interconnect delay dominates gate delay in deep sub-micron VLSI. Generation (micron) Delay (ps)

Importance in VLSI Fast and accurate capacitance extraction is crucial in the design and verification of VLSI circuits and packaging.  Current 3D tools are too slow. FastCap, Raphael, QuickCap, etc.  2D/2.5D/Quasi-3D tools use 3D engines to generate library. Accuracy depends on 3D engines. Dracula, HyperExtract, Arcordia, Fire&Ice, Star- RC, Columbus, etc.  For critical nets and clock trees, 3D accuracy is necessary.

Importance in MEMS Accurate capacitance extraction of complex 3-D structures is also important in design of MEMS (MicroElectroMechanical Systems).  Design of most motion sensors needs accurate estimate of capacitance.  Design of most drivers needs to solve a similar potential problem.  A recent ARPA report estimates the market of above applications at 1 to 3 billion dollars by 2004.

Enlarged comb driver

Previous Research Differential Maxwell Equation (Finite Difference Method or Finite Element Method)  Raphael Field Solver Integral Laplace Equation (Boundary Element Method)  Multipole algorithm FastCap by Nabors & White. O(N) time. Kernel dependent.  Pre-corrected FFT algorithm by Phillips & White. O(N log N) time. Kernel independent.  SVD algorithm IES3 by Kapur & Long. O(N log N) time. Kernel independent.

Integral Equation Approach where  (x) is the known surface potential,  (x’) is the charge density, da’ is an incremental conductor surface area, x’ is on da’, is the kernel.

where P is an NxN matrix of potential coefficients, q is an N-vector of panel charges, v is an N-vector of known panel potentials. Partition conductor surfaces into N panels and assume uniform charge density on each panel. Then we have a linear system: Pq = v

Each entry pij of potential coefficient matrix P represents the potential at panel Ai due to unit charge on panel Aj: Solution q of the linear system Pq = v gives the capacitance.

Challenge Partition the conductor surfaces into N panels, Calculate and store the dense NxN matrix P, and Solve the linear system Pq = v In O(N) time?

N-body Problem N-body Problem: Given N particles in 3D space, compute all forces between the particles. Hierarchical Algorithm (Appel 85)  O(N) time (Esselink)  Radiosity (Hanrahan, Salzman & Aupperle) Multipole Algorithm (Greengard & Rohklin 87)  O(N) time  FastCap

Appel’s Key Ideas For practical purposes, forces acting on a particle need only be calculated to within the given precision. The force due to a cluster of particles at some distance can be approximated with a single term.

Outline of New Algorithm Adaptively partition conductor surfaces into small panels according to a user supplied error bound Pe. Approximate potential coefficient matrix P and store it in a hierarchical data structure of size O(N). The data structure permits O(N) time matrix-vector product Px for any N-vector x. Solve linear system Pq = v using iterative methods.

Adaptive Panel Partition If the potential coefficient estimate between two panels are greater than Pe, then partition the panels. Otherwise, record the coefficient. A H C B I J C E F G M N L J 12345

Coefficient Matrix Representation A D G H CB E F IJ K L M N Entries of P are are stored in a hierarchical data structure as links.

A B C D E H IJ K L A B C D E H I J L K Matrix with block entries

It can be shown the matrix contains O(N) block entries, where N is the number of panels. If expanded explicitly, the matrix would contain NxN entries. If panel sizes were uniform, the matrix would be much larger than NxN.

Matrix-Vector Product Px A BC DE F G H IJ K L M N Compute charge for all panels in O(N) time.

A BC DE F G H IJ K L M N Compute potential for all panels in O(N) time.

A BC DE F G H IJ K L M N Distribute potential to leaf panels in O(N) time.

Solving Linear Systems Use iterative methods such as GMRES or MINRES. Each iteration requires a matrix-vector product Px and can be completed in O(N) time. Number of iterations needed is very small, normally regardless of N.

Error and Complexity Error of approximation can be controlled by the user supplied error bound Pe. Time complexity is O(N) because each of the above steps is O(N).

Experimental Results Test examples: Bus crossing 2x2, 3x3, …, 6x6. In commercial tools, thousands of these crossings will be computed to build the library. 2x2 Bus crossing

Previous 3D Algorithms FastCap expansion order 2 (assume accurate). FastCap expansion order 0. Pre-corrected FFT. 40% faster than FastCap(2) and uses 1/4 of memory of FastCap(2). IES3. 60% faster than FastCap(2) and uses 1/5 of memory of FastCap(2).

CPU time (in seconds): times faster than FastCap(2), times faster than FastCap(0).

Memory (in MB): 1/60 - 1/100 of memory of FastCap(2), 1/80 - 1/280 of memory of FastCap(0).

Error with respect to FastCap(2): Less than 2.7% error with respect to FastCap(2), 3 times more accurate than FastCap(0).

Conclusion A new algorithm significantly faster than previous best algorithms. It provides the possibility for 3D extraction of clock trees and critical nets. It can also be used to generate libraries for commercial 2D/2.5D tools. Kernel independent. Can be applied to multi-layered dielectrics. Adaptive refinement scheme produces good partition of conductor surfaces. Hierarchical data structure is much more efficient than previous data structures.

Future Research Capacitance Extraction  High order basis function  Bottom-up construction of hierarchy  Full chip and critical net extraction Inductance Extraction  FastHenry is too slow  No commercial tool for mutual inductance. Variational Parasitic Extraction MEMS application