1. CSE245: Computer-Aided Circuit Simulation and Verification Lecture 1: Introduction and Formulation Winter 2013 Chung-Kuan Cheng

2. Administration CK Cheng, CSE 2130, tel. 858 534-6184, ckcheng@ucsd.educkcheng@ucsd.edu Lectures: 5:00 ~ 6:20pm MW CSE2154 References –1. Electronic Circuit and System Simulation Methods, T.L. Pillage, R.A. Rohrer, C. Visweswariah, McGraw-Hill, 1998 –2. Interconnect Analysis and Synthesis, CK Cheng, J. Lillis, S.Lin and N. Chang, John Wiley, 2000 –3. Computer-Aided Analysis of Electronic Circuits, L.O. Chua and P.M. Lin, Prentice Hall, 1975 –4. A Friendly Introduction to Numerical Analysis, B. Bradie, Pearson/Prentice Hall, 2005, http://www.pcs.cnu.edu/~bbradie/textbookanswers.html –5. Numerical Recipes: The Art of Scientific Computing, Third Edition, W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery, Cambridge University Press, 2007. Grading –Homework: 60% –Project Presentation: 20% –Final Report: 20%

3. CSE245: Course Outline Content: 1. Introduction 2. Problem Formulations: circuit topology, network regularization 3. Linear Circuits: matrix solvers, explicit and implicit integrations, matrix exponential methods, convergence 4. Nonlinear Systems: Newton-Raphson method, Nesterov methods, homotopy methods 5. Sensitivity Analysis: direct method, adjoint network approach 6. Various Simulation Approaches: FDM, FEM, BEM, multipole methods, Monte Carlo, random walks 7. Applications: power distribution networks, IO circuits, full wave analysis, Boltzmann machines

4. Motivation: Analysis Energy: Fission, Fusion, Fossil Energy, Efficiency Optimization Astrophysics: Dark energy, Nucleosynthesis Climate: Pollution, Weather Prediction Biology: Microbial life Socioeconomic Modeling: Global scale modeling Nonlinear Systems, ODE, PDE, Heterogeneous Systems, Multiscale Analysis.

5. Motivation: Analysis Exascale Calculation: 10 18, Parallel Processing at 20MW 10 Petaflops 2012 100 PF 2017 1000 PF 2022

6. Motivation: Analysis Modeling: Inputs, outputs, system models. Simulation: Time domain, frequency domain, wavelet simulation. Sensitivity Calculation: Optimization Uncertainty Quantification: Derivation with partial information or variations User Interface: Data mining, visualization,

7. Motivation: Circuit Analysis Why –Whole Circuit Analysis, Interconnect Dominance What –Power, Clock, Interconnect Coupling Where –Matrix Solvers, Integration Methods –RLC Reduction, Transmission Lines, S Parameters –Parallel Processing –Thermal, Mechanical, Biological Analysis

8. Circuit Simulation Simulator: Solve numerically Input and setup Circuit Output Types of analysis: –DC Analysis –DC Transfer curves –Transient Analysis –AC Analysis, Noise, Distortions, Sensitivity

9. Program Structure (a closer look) Numerical Techniques: – Formulation of circuit equations – Solution of ordinary differential equations – Solution of nonlinear equations – Solution of linear equations Input and setup Models Output

10. Lecture 1: Formulation Derive from KCL/KVL Sparse Tableau Analysis (IBM) Nodal Analysis, Modified Nodal Analysis (SPICE) *some slides borrowed from Berkeley EE219 Course

11. Conservation Laws Determined by the topology of the circuit Kirchhoff’s Current Law (KCL): The algebraic sum of all the currents flowing out of (or into) any circuit node is zero. –No Current Source Cut Kirchhoff’s Voltage Law (KVL): Every circuit node has a unique voltage with respect to the reference node. The voltage across a branch v b is equal to the difference between the positive and negative referenced voltages of the nodes on which it is incident –No voltage source loop

12. Branch Constitutive Equations (BCE) Ideal elements ElementBranch EqnVariable parameter Resistorv = R·i- Capacitori = C·dv/dt- Inductorv = L·di/dt- Voltage Sourcev = v s i = ? Current Sourcei = i s v = ? VCVSv s = A V · v c i = ? VCCSi s = G T · v c v = ? CCVSv s = R T · i c i = ? CCCSi s = A I · i c v = ?

13. Formulation of Circuit Equations Unknowns –B branch currents(i) –N node voltages(e) –B branch voltages(v) Equations –N+B Conservation Laws –B Constitutive Equations 2B+N equations, 2B+N unknowns => unique solution

14. Equation Formulation - KCL 0 1 2 R1R1 G2v3G2v3 R3R3 R4R4 I s5 A i = 0 Kirchhoff’s Current Law (KCL) N equations Law:State Equation: Node 1: Node 2: Branches

15. Equation Formulation - KVL 0 1 2 R1R1 G2v3G2v3 R3R3 R4R4 I s5 v - A T e = 0 Kirchhoff’s Voltage Law (KVL) B equations Law:State Equation: v i = voltage across branch i e i = voltage at node i

16. Equation Formulation - BCE 0 1 2 R1R1 G2v3G2v3 R3R3 R4R4 I s5 K v v + K i i = i s B equations Law: State Equation:

17. Equation Formulation Node-Branch Incidence Matrix A 1 2 3 j B 12iN12iN branches nodesnodes (+1, -1, 0) { A ij = +1 if node i is + terminal of branch j -1 if node i is - terminal of branch j 0 if node i is not connected to branch j

18. Equation Assembly (Stamping Procedures) Different ways of combining Conservation Laws and Branch Constitutive Equations –Sparse Table Analysis (STA) –Nodal Analysis (NA) –Modified Nodal Analysis (MNA)

19. Sparse Tableau Analysis (STA) 1.Write KCL: Ai=0 (N eqns) 2.Write KVL:v - A T e=0 (B eqns) 3.Write BCE:K i i + K v v=S(B eqns) N+2B eqns N+2B unknowns N = # nodes B = # branches Sparse Tableau

20. Sparse Tableau Analysis (STA) Advantages It can be applied to any circuit Eqns can be assembled directly from input data Coefficient Matrix is very sparse Disadvantages Sophisticated programming techniques and data structures are required for time and memory efficiency

21. Nodal Analysis (NA) 1.Write KCL Ai=0 (N equations, B unknowns) 2.Use BCE to relate branch currents to branch voltages i=f(v)(B equations  B unknowns) 3.Use KVL to relate branch voltages to node voltages v=h(e)(B equations  N unknowns) Y n e=i ns N eqns N unknowns N = # nodes Nodal Matrix

22. Nodal Analysis - Example R3R3 0 1 2 R1R1 G2v3G2v3 R4R4 I s5 1.KCL:Ai=0 2.BCE:K v v + i = i s  i = i s - K v v  A K v v = A i s 3.KVL:v = A T e  A K v A T e = A i s Y n e = i ns Y n = AK v A T I ns = Ai s

23. Nodal Analysis Example shows how NA may be derived from STA Better Method: Y n may be obtained by direct inspection (stamping procedure) –Each element has an associated stamp –Y n is the composition of all the elements’ stamps

24. Spice input format: R k N+ N- R k value Nodal Analysis – Resistor “Stamp” N+ N- N+ N- N+ N- i RkRk KCL at node N+ KCL at node N- What if a resistor is connected to ground? …. Only contributes to the diagonal

25. Spice input format: G k N+ N- NC+ NC- G k value Nodal Analysis – VCCS “Stamp” NC+ NC- N+ N- N+ N- GkvcGkvc NC+ NC- +vc-+vc- KCL at node N+ KCL at node N-

26. Spice input format: I k N+ N- I k value Nodal Analysis – Current source “Stamp” N+ N- N+ N- N+ N- IkIk

27. Nodal Analysis (NA) Advantages Yn is often diagonally dominant and symmetric Eqns can be assembled directly from input data Yn has non-zero diagonal entries Yn is sparse (not as sparse as STA) and smaller than STA: NxN compared to (N+2B)x(N+2B) Limitations Conserved quantity must be a function of node variable –Cannot handle floating voltage sources, VCVS, CCCS, CCVS

28. Modified Nodal Analysis (MNA) i kl cannot be explicitly expressed in terms of node voltages  it has to be added as unknown (new column) e k and e l are not independent variables anymore  a constraint has to be added (new row) How do we deal with independent voltage sources? i kl k l +- E kl klkl

29. MNA – Voltage Source “Stamp” N+ ikik N- +- EkEk Spice input format: V k N+ N- E k value 001 00 1 0 N+ N- Branch k N+ N- i k RHS

30. Modified Nodal Analysis (MNA) How do we deal with independent voltage sources? Augmented nodal matrix Some branch currents In general:

31. MNA – General rules A branch current is always introduced as an additional variable for a voltage source or an inductor For current sources, resistors, conductors and capacitors, the branch current is introduced only if: –Any circuit element depends on that branch current –That branch current is requested as output

32. MNA – CCCS and CCVS “Stamp”

33. MNA – An example Step 1: Write KCL 0 1 2 G2v3G2v3 R4R4 I s5 R1R1 E S6 -+ R8R8 3 E7v3E7v3 -+ 4 + v 3 - R3R3 (1) (2) (3) (4)

34. MNA – An example Step 2: Use branch equations to eliminate as many branch currents as possible Step 3: Write down unused branch equations (1) (2) (3) (4) (b6) (b7)

35. MNA – An example Step 4: Use KVL to eliminate branch voltages from previous equations (1) (2) (3) (4) (b6) (b7)

36. MNA – An example

37. Modified Nodal Analysis (MNA) Advantages MNA can be applied to any circuit Eqns can be assembled directly from input data MNA matrix is close to Y n Limitations Sometimes we have zeros on the main diagonal