SAMSON: A Generalized Second-order Arnoldi Method for Reducing Multiple Source Linear Network with Susceptance Yiyu Shi, Hao Yu and Lei He EE Department,

Slides:



Advertisements
Similar presentations
Steady-state heat conduction on triangulated planar domain May, 2002
Advertisements

Variation Aware Gate Delay Models Dinesh Ganesan.
Non-Gaussian Statistical Timing Analysis Using Second Order Polynomial Fitting Lerong Cheng 1, Jinjun Xiong 2, and Lei He 1 1 EE Department, UCLA *2 IBM.
Minimal Skew Clock Synthesis Considering Time-Variant Temperature Gradient Hao Yu, Yu Hu, Chun-Chen Liu and Lei He EE Department, UCLA Presented by Yu.
Minimal Skew Clock Embedding Considering Time-Variant Temperature Gradient Hao Yu, Yu Hu, Chun-Chen Liu and Lei He EE Department, UCLA Presented by Yu.
The continuous scaling trends of smaller devices, higher operating frequencies, lower power supply voltages, and more functionalities for integrated circuits.
Statistical Full-Chip Leakage Analysis Considering Junction Tunneling Leakage Tao Li Zhiping Yu Institute of Microelectronics Tsinghua University.
Linear Transformations
A Fast Block Structure Preserving Model Order Reduction for Inverse Inductance Circuits Hao Yu, Yiyu Shi, Lei He Electrical Engineering Dept. UCLA David.
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 3 Model Order Reduction (1) Spring 2008 Prof. Chung-Kuan Cheng.
Non-Linear Statistical Static Timing Analysis for Non-Gaussian Variation Sources Lerong Cheng 1, Jinjun Xiong 2, and Prof. Lei He 1 1 EE Department, UCLA.
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Notes 3 Model Order Reduction (1) Spring 2008 Prof. Chung-Kuan Cheng.
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.
Chapter 7 Reading on Moment Calculation. Time Moments of Impulse Response h(t) Definition of moments i-th moment Note that m 1 = Elmore delay when h(t)
Department of EECS University of California, Berkeley EECS 105 Fall 2003, Lecture 2 Lecture 2: Transfer Functions Prof. Niknejad.
Primary Contributions  Derive inversion based VPEC (Vector Potential Equivalent Circuit) model from first principles.  Replace inductances with effective.
UCSD CSE 245 Notes – SPRING 2006 CSE245: Computer-Aided Circuit Simulation and Verification Lecture Notes 3 Model Order Reduction (1) Spring 2006 Prof.
Off-chip Decoupling Capacitor Allocation for Chip Package Co-Design Hao Yu Berkeley Design Chunta Chu and Lei He EE Department.
UCSD CSE 245 Notes – SPRING 2006 CSE245: Computer-Aided Circuit Simulation and Verification Lecture Notes 4 Model Order Reduction (2) Spring 2006 Prof.
6 1 Linear Transformations. 6 2 Hopfield Network Questions.
Circuit Simulation Based Obstacle-Aware Steiner Routing Yiyu Shi, Paul Mesa, Hao Yu and Lei He EE Department, UCLA Partially supported by NSF Career Award.
Efficient Reluctance Extraction for Large-Scale Power Grid with High- Frequency Consideration Shan Zeng, Wenjian Yu, Jin Shi, Xianlong Hong Dept. Computer.
THEORETICAL LIMITS FOR SIGNAL REFLECTIONS DUE TO INDUCTANCE FOR ON-CHIP INTERCONNECTIONS F. Huret, E. Paleczny, P. Kennis F. Huret, E. Paleczny, P. Kennis.
Worst-Case Timing Jitter and Amplitude Noise in Differential Signaling Wei Yao, Yiyu Shi, Lei He, Sudhakar Pamarti, and Yu Hu Electrical Engineering Dept.,
1 Introduction to Model Order Reduction Luca Daniel Massachusetts Institute of Technology
Stability and Passivity of the Super Node Algorithm for EM modelling of ICs Maria Ugryumova Supervisor : Wil Schilders Technical University Eindhoven,
ECE 546 – Jose Schutt-Aine 1 ECE 546 Lecture -13 Latency Insertion Method Spring 2014 Jose E. Schutt-Aine Electrical & Computer Engineering University.
PiCAP: A Parallel and Incremental Capacitance Extraction Considering Stochastic Process Variation Fang Gong 1, Hao Yu 2, and Lei He 1 1 Electrical Engineering.
EE 201C Modeling of VLSI Circuits and Systems
Scalable Symbolic Model Order Reduction Yiyu Shi*, Lei He* and C. J. Richard Shi + *Electrical Engineering Department, UCLA + Electrical Engineering Department,
Maria Ugryumova Model Order Reduction for EM modeling of IC's CASA day, November 2007.
Decentralized Model Order Reduction of Linear Networks with Massive Ports Boyuan Yan, Lingfei Zhou, Sheldon X.-D. Tan, Jie Chen University of California,
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.
Motivation Thus far we have dealt primarily with the input/output characteristics of linear systems. State variable, or state space, representations describe.
Forward modelling The key to waveform tomography is the calculation of Green’s functions (the point source responses) Wide range of modelling methods available.
Distributed Computation: Circuit Simulation CK Cheng UC San Diego
Xuanxing Xiong and Jia Wang Electrical and Computer Engineering Illinois Institute of Technology Chicago, Illinois, United States November, 2011 Vectorless.
QuickYield: An Efficient Global-Search Based Parametric Yield Estimation with Performance Constraints Fang Gong 1, Hao Yu 2, Yiyu Shi 1, Daesoo Kim 1,
Motivation For analytical design of control systems,
EE 201C Modeling of VLSI Circuits and Systems
Chapter 2 Interconnect Analysis Prof. Lei He Electrical Engineering Department University of California, Los Angeles URL: eda.ee.ucla.edu
I.4 - System Properties Stability, Passivity
In-Place Decomposition for Robustness in FPGA Ju-Yueh Lee, Zhe Feng, and Lei He Electrical Engineering Dept., UCLA Presented by Ju-Yueh Lee Address comments.
Inductance Screening and Inductance Matrix Sparsification 1.
Circuit Simulation using Matrix Exponential Method Shih-Hung Weng, Quan Chen and Chung-Kuan Cheng CSE Department, UC San Diego, CA Contact:
Pieter Heres, Aday Error control in Krylov subspace methods for Model Order Reduction Pieter Heres June 21, 2005 Eindhoven.
QD C QD C QD C QD C Chapter 2 Interconnect Analysis Model Order Reduction Prof. Lei He Electrical Engineering Department.
DAC, July 2006 Model Order Reduction of Linear Networks with Massive Ports via Frequency-Dependent Port Packing Peng Li and Weiping Shi Department of ECE.
Fault-Tolerant Resynthesis for Dual-Output LUTs Roy Lee 1, Yu Hu 1, Rupak Majumdar 2, Lei He 1 and Minming Li 3 1 Electrical Engineering Dept., UCLA 2.
Laplace Transforms Chapter 3 Standard notation in dynamics and control
DEPT.:-ELECTRONICS AND COMMUNICATION SUB: - CIRCUIT & NETWORK
Chapter 2 Interconnect Analysis
Chapter 2 Interconnect Analysis
Chapter 2 Interconnect Analysis Model Order Reduction
EE 201C Homework 2 (due Feb 3 ) Wei Wu
Wei Yao Homework 3 Wei Yao
Model Order Reduction for Parametric Systems
CSE245: Computer-Aided Circuit Simulation and Verification
Chapter 2 Interconnect Analysis Delay Modeling
Latency Insertion Method
Yiyu Shi*, Wei Yao*, Jinjun Xiong+ and Lei He*
Inductance Screening and Inductance Matrix Sparsification
EE 201C Modeling of VLSI Circuits and Systems
EE 201C Homework 2 Fang Gong
Yiyu Shi*, Jinjun Xiong+, Chunchen Liu* and Lei He*
EE 201C Homework 2 (due Feb 3 ) Wei Wu
Model Order Reduction Slides adopted from Luca Daniel
August 8, 2006 Danny Budik, Itamar Elhanany Machine Intelligence Lab
Chapter 3 Modeling in the Time Domain
Fang Gong Homework 3 Fang Gong
Presentation transcript:

SAMSON: A Generalized Second-order Arnoldi Method for Reducing Multiple Source Linear Network with Susceptance Yiyu Shi, Hao Yu and Lei He EE Department, UCLA Partially supported by NSF and UC MICRO Analog Devices, Intel and Mindspeed Address comments to

Outline Review and Motivation SAMSON Algorithm Experimental Results Conclusions

Motivation for Model Order Reduction Deep submicron design needs to consider a large number of linear elements  Interconnect, Substrate, P/G grid, and Package Accurate extraction leads to the explosion of data storage and runtime Need efficient macro-model Nonlinear Elements Linear Elements Nonlinear Elements Reduced Model

Non-RHS MOR vs. RHS MOR Non-RHS MOR reduces transfer function H(s)  First Order Method to handle L PRIMA [Pileggi et al, TCAD’98]  Second Order Methods to handle S (susceptance) ENOR [Sheehan, DAC’99] SMOR [Pileggi et al, ICCAD’02] SAPOR [Su et al, ICCAD’04] [Liu et al, ASPDAC’05] Main Limitation  Can only match up to ceil(n/n p ) moments  Accuracy is significantly limited when the port number n p is large RHS MOR reduces output vector y(s)  [Chiprout, ICCAD’04] explicit moment matching is used (lack in numerical stability)  EKS [J. M. Wang et al, DAC’00] Implicit moment matching based on Incremental orthonormalization frequency domain shifting to deal with 1/s and 1/s 2 terms  IEKS [Y. Lee et al, TCAD’05] Based on the observation that there are no 1/s and 1/s 2 terms for PWL sources in finite time

Problems Still Remain Unsolved None of the existing RHS MOR methods can deal with RCS circuits with susceptance elements  Both EKS and IEKS are first order methods  Directly applying them to RCS circuits cannot guarantee passivity There is still much room to improve accuracy  Incremental Orthonormalization causes error to accumulate  When matching high order moments, it becomes inaccurate None of the existing MOR methods can handle arbitrary independent inputs  Especially when they contain 1/s i terms (i>0) frequency domain shifting (inaccurate)  In the existence of infinite PWL sources EKS and IEKS cannot consider s=0 (cannot perform DC analysis)

Major Contributions of SAMSON It is an RHS MOR method  Compare with SAPOR and other non-RHS methods, it is more accurate  Can handle a large number of ports It can deal with all kinds of input sources accurately without frequency domain shifting or incremental orthonormalization  Numerically more stable, more efficient and more accurate in the whole frequency domain, especially at DC (s=0) It is based upon generalized second order Arnoldi method  Can handle RCS circuits with passivity

Outline Review and Motivation SAMSON Algorithm Experimental Results Conclusions

SAMSON Algorithm: Overview Generalized Current Excitation Vector Generation Augmented System Transformation System Linearization Second order state matrices, incidence matrices and arbitrary inputs Projected output vector Projection

Generalized Current Excitation Vector Original system equation Superposed SIMO system equation Define the generalized current excitation vector J ex as J ex can be divided into two categories  Rational  Irrational Can be expanded into Taylor series and take dominant terms. Then it becomes a special case of the Rational category Multiply both sides by

SAMSON Algorithm: Overview Generalized Current Excitation Vector Generation Augmented System Transformation System Linearization Second order state matrices, incidence matrices and arbitrary inputs Projected output vector Projection

Augmented System Transformation To linearize, we have to make LHS exactly one order higher than RHS by raising the order of LHS by n-m.  Introduce auxiliary variables V 1, V 2, …, V n satisfying  Insert into superposed SIMO system equation => Superposed SIMO system equation Augmented system equation Here we assume m<n. The transformation for the n<m case can be derived similarly

SAMSON Algorithm: Overview Generalized Current Excitation Vector Generation Augmented System Transformation System Linearization Second order state matrices, incidence matrices and arbitrary inputs Projected output vector Projection

System Linearization Expand the augmented system at a given frequency Introduce auxiliary variables Z 1, Z 2, … Z n, satisfying and we can obtain Augmented system equation e.g., Insert it into and we get

System Linearization Expand the augmented system at a given frequency Introduce auxiliary variables Z 1, Z 2, … Z n, satisfying and we can obtain Moment space equation Augmented system equation

SAMSON Algorithm: Overview Generalized Current Excitation Vector Generation Augmented System Transformation System Linearization Second order state matrices, incidence matrices and arbitrary inputs Projected output vector Projection

Find projection matrix using method similar to PRIMA But only take the first N rows (N is the number of the original variables) The moment calculation is efficient because the linearized system is sparse Moment space equation Projection matrix Projected system equation Directly project on J ex instead of B

Outline Review and Motivation SAMSON Algorithm Experimental Results Conclusions

Experimental Setting Experiments are run on a PC with Intel Pentium IV 2.66G CPU and 1G RAM. All methods are implemented in MATLAB Time domain responses are calculated by IFFT (Inverse Fast Fourier Transformation with 1024 sampling points) The examples to be presented are from real industry applications (courtesy of Rio Design Automation)  Power planes and packages are modeled by RCS meshes  On chip power/ground grids are modeled by RC meshes  Vias and bumps are modeled by RC elements  PWL sources are generated from SPICE characterization of FPGA circuits

Moment Matching With the increase of port number (from 1 to 20)  SAPOR (second order non-RHS) matches a decreasing number of moments  SAMSON always matches the same number of moments.

Frequency Domain Accuracy Comparison (a) Frequency domain comparison between SAPOR, EKS, SAMSON and original with attenuated sine waveforms. (b) Frequency domain comparison between SAMSON, Original, IEKS, EKS and SAPOR with PWL sources; All circuits are reduced to the same order.  Only SAMSON is identical to the original  EKS outperforms SAPOR due to the RHS MOR nature (a) (b)

Time Domain Accuracy Comparison (a) Time domain comparison between SAPOR, EKS, SAMSON and original with attenuated sine waveforms. (b) Time domain comparison between SAMSON, Original, IEKS, EKS and SAPOR with PWL sources; All circuits are reduced to the same order.  Again only SAMSON is identical to the original  EKS outperforms SAPOR due to the RHS MOR nature (a) (b)

Scalability and Accuracy Average time domain waveform error of SAMSON, EKS, IEKS and SAPOR with respect to the reduced order Different sizes of circuits from nodes are used. For each circuit 30% ports have independent PWL sources. SAMSON has the fastest waveform convergence  33X more accurate than EKS and IEKS at order 40  48 X more accurate than SAPOR  The non-RHS method, SAPOR, does not converge

Runtime Comparison Comparison of the reduction and simulation time under the same accuracy of up to 50 GHz on an RC mesh with 11,520 nodes and 800 ports SAMSON runs the fastest  25X faster than direct simulation  faster than EKS and IEKS  but have a similar trend

Conclusions and Future work SAMSON is an RHS MOR method  Compare with SAPOR and other non-RHS methods, it is more accurate  Can handle a large number of ports SAMSON can deal with all kinds of input sources accurately without frequency domain shifting or incremental orthonormalization  Numerically more stable, more efficient and more accurate in the whole frequency range, particularly at DC (s=0) SAMSON is based upon generalized second order Arnoldi method  Can handle RCS circuits with passivity

Thank you!