CSE 245: Computer Aided Circuit Simulation and Verification Instructor: Prof. Chung-Kuan Cheng Winter 2003 Lecture 1: Formulation.

Slides:



Advertisements
Similar presentations
Circuits Lecture 4: Superposition
Advertisements

Lecture 6 Controlled Sources (2)
CSE245: Computer-Aided Circuit Simulation and Verification Lecture 1: Introduction and Formulation Winter 2013 Chung-Kuan Cheng.
1 EE 616 Computer Aided Analysis of Electronic Networks Lecture 3 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens, OH,
Lecture 291 More Loop and Nodal Analysis. Lecture 292 Advantages of Nodal Analysis Solves directly for node voltages. Current sources are easy. Voltage.
Fundamentals of Electric Circuits Chapter 10 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
CSE 245: Computer Aided Circuit Simulation and Verification Fall 2004, Nov Nonlinear Equation.
CSE245: Computer-Aided Circuit Simulation and Verification
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 2: State Equations Prof. Chung-Kuan Cheng 1.
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 3 Model Order Reduction (1) Spring 2008 Prof. Chung-Kuan Cheng.
1 EE 616 Computer Aided Analysis of Electronic Networks Lecture 5 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens, OH,
Lecture 71 Nodal Analysis (3.1) Prof. Phillips February 7, 2003.
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Notes 3 Model Order Reduction (1) Spring 2008 Prof. Chung-Kuan Cheng.
Lecture 261 Nodal Analysis. Lecture 262 Example: A Summing Circuit The output voltage V of this circuit is proportional to the sum of the two input currents.
ECE201 Lect-91 Nodal Analysis (3.1) Dr. Holbert February 22, 2006.
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)
Lecture 27: Graph Theory in Circuit Analysis Suppose we wish to find the node voltages of the circuit below. We know how to do this by hand. For large-scale.
CSE245: Computer-Aided Circuit Simulation and Verification Spring 2006 Chung-Kuan Cheng.
UCSD CSE 245 Notes – SPRING 2006 CSE245: Computer-Aided Circuit Simulation and Verification Lecture Notes 3 Model Order Reduction (1) Spring 2006 Prof.
Methods of Analysis PSUT 1 Basic Nodal and Mesh Analysis Al-Qaralleh.
ECE53A RLC Circuits W. Ku 11/29/2007
Lecture 271 More Nodal Analysis. Lecture 272 Where We Are Nodal analysis is a technique that allows us to analyze more complicated circuits than those.
UCSD CSE245 Notes -- Spring 2006 CSE245: Computer-Aided Circuit Simulation and Verification Lecture Notes Spring 2006 Prof. Chung-Kuan Cheng.
1 EE 616 Computer Aided Analysis of Electronic Networks Lecture 5 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens, OH,
ECE53A Introduction to Analog and Digital Circuits Lecture Notes Second-Order Analog Circuit and System.
ECE 552 Numerical Circuit Analysis Chapter Two EQUATION FORMULATION Copyright © I. Hajj 2015 All rights reserved.
1 Chapter 3 Methods of Analysis Copyright © 2013 The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems
EE EE 616 Computer Aided Analysis of Electronic Networks Lecture 2 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens,
Lecture 27 Review Phasor voltage-current relations for circuit elements Impedance and admittance Steady-state sinusoidal analysis Examples Related educational.
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 2: State Equations Prof. Chung-Kuan Cheng.
EENG 2610: Circuit Analysis Class 4: Nodal Analysis
EE212 Passive AC Circuits Lecture Notes 2a EE 212.
METHODS OF CIRCUIT ANALYSIS
Formulation of Circuit Equations Lecture 2 Alessandra Nardi Thanks to Prof. Sangiovanni-Vincentelli and Prof. Newton.
EE484: Mathematical Circuit Theory + Analysis Node and Mesh Equations By: Jason Cho
Loop and cut set Analysis
Graph Theory, Topological Analysis ECE Graph Theory, Topological Analysis - Terms Topological Analysis: General, systematic, suited for CAD Graph:
Network Graphs and Tellegen’s Theorem The concepts of a graph Cut sets and Kirchhoff’s current laws Loops and Kirchhoff’s voltage laws Tellegen’s Theorem.
EMLAB 1 Chapter 3. Nodal and loop analysis techniques
CSE245: Computer-Aided Circuit Simulation and Verification Lecture 1: Introduction and Formulation Spring 2008 Chung-Kuan Cheng.
EE616 Dr. Janusz Starzyk Computer Aided Analysis of Electronic Circuits Innovations in numerical techniques had profound import on CAD: –Sparse matrix.
Lecture 13 Review: Operational amplifier examples Dependent Sources
General Methods of Network Analysis Node Analysis Mesh Analysis Loop Analysis Cutset Analysis State variable Analysis Non linear and time varying network.
CSE245: Computer-Aided Circuit Simulation and Verification Lecture 1: Introduction and Formulation Spring 2010 Chung-Kuan Cheng.
EE EE 616 Computer Aided Analysis of Electronic Networks Lecture 2 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens,
Fundamentals of Electric Circuits Chapter 10 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 8 – Methods of Analysis Lecture 10 by Moeen Ghiyas 05/12/
Net work analysis Dr. Sumrit Hungsasutra Text : Basic Circuit Theory, Charles A. Desoer & Kuh, McGrawHill.
Network topology, cut-set and loop equation
1 Loop (Mesh) Analysis. 2 Loop Analysis Nodal analysis was developed by applying KCL at each non-reference node. Loop analysis is developed by applying.
ECE 4991 Electrical and Electronic Circuits Chapter 3.
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 2: State Equations Spring 2010 Prof. Chung-Kuan Cheng.
CHAPTER 3 Resistive Network Analysis. Figure Branch current formulation in nodal analysis.
D EPARTMENT /S EMESTER (ECE – III SEM) NETWORK THEORY SECTION-D Manav Rachna University 1.
Review of Last Class  Calculation of Input Resistance The Equivalent Change of electric Current source  Voltage source Key Points and Difficult Points.
Techniques of Circuit Analysis 1 Electrical Circuits CEN270.
What have you learned in this lecture until now? Circuit theory Undefined quantities ( , ) Axioms ( , ) Two.
Higher Order Circuits – How To Obtain State Equations? Consider a circuit with capacitor, inductors, n-terminal resistors and independent sources. Aim.
CSE 245: Computer Aided Circuit Simulation and Verification Instructor: Prof. Chung-Kuan Cheng Winter 2003 Lecture 2: Closed Form Solutions (Linear System)
Chapter 2 Interconnect Analysis
Ch. 3 Network Analysis- Part II
CSE245: Computer-Aided Circuit Simulation and Verification
CSE245: Computer-Aided Circuit Simulation and Verification
Current Directions and
ELL100: INTRODUCTION TO ELECTRICAL ENG.
Nodes, Branches, and Loops
Equivalent State Equations
Chapter 8 Second Order Circuits
Annex G.7. A Past Year Exam Paper
Presentation transcript:

CSE 245: Computer Aided Circuit Simulation and Verification Instructor: Prof. Chung-Kuan Cheng Winter 2003 Lecture 1: Formulation

Jan. 24, 2003Cheng & Zhu, Agenda  RCL Network  Sparse Tableau Analysis  Modified Nodal Analysis

Jan. 24, 2003Cheng & Zhu, History of SPICE  SPICE -- Simulation Program with Integrated Circuit Emphasis  1969, CANCER developed by Laurence Nagel on Prof. Ron Roher ’ s class  1970~1972, CANCER program  May 1972, SPICE-I release  July ’ 75, SPICE 2A, …, 2G  Aug 1982, SPICE 3 (in C language)  No new progress on software package since then

Jan. 24, 2003Cheng & Zhu, RCL circuit

Jan. 24, 2003Cheng & Zhu, RCL circuit (II)  General Circuit Equation  Consider homogeneous form first Q: How to Compute A k ? and

Jan. 24, 2003Cheng & Zhu,  Assume A has non-degenerate eigenvalues and corresponding linearly independent eigenvectors, then A can be decomposed as where and Solving RCL Equation

Jan. 24, 2003Cheng & Zhu,  What ’ s the implication then?  To compute the eigenvalues: Solving RCL Equation (II) real eigenvalue Conjugative Complex eigenvalue where

Jan. 24, 2003Cheng & Zhu, Solving RCL Equation (III) In the previous example where hence Let c=r=l=1, we have

Jan. 24, 2003Cheng & Zhu,  What if matrix A has degenerated eigenvalues? Jordan decomposition ! Solving RCL Equation (IV) J is in the Jordan Canonical form And still

Jan. 24, 2003Cheng & Zhu, Jordan Decomposition similarly

Jan. 24, 2003Cheng & Zhu, Agenda  RCL Network  Sparse Tableau Analysis  Modified Nodal Analysis

Jan. 24, 2003Cheng & Zhu, Equation Formulation  KCL Converge of node current  KVL Closure of loop voltage  Brach equations I, R relations

Jan. 24, 2003Cheng & Zhu, Types of elements  Resistor  Capacitor  Inductor L is even dependent on frequency due to skin effect, etc …  Controlled Sources VCVS, VCCS, CCVS, CCCS

Jan. 24, 2003Cheng & Zhu, Cut-set analysis 1. Construct a spanning tree 2. Take as much capacitor branches as tree branches as possible 3. Derive the fundamental cut-set, in which each cut truncates exactly one tree branch 4. Write KCL equations for each cut 5. Write KVL equations for each tree link 6. Write the constitution equation for each branch

Jan. 24, 2003Cheng & Zhu, KCL Formulation #nodes-1 lines #braches columns

Jan. 24, 2003Cheng & Zhu, KCL Formulation (II)  Permute the columns to achieve a systematic form

Jan. 24, 2003Cheng & Zhu, KVL Formulation Remove the equations for tree braches and systemize

Jan. 24, 2003Cheng & Zhu, Cut & Loop relation In the previous example

Jan. 24, 2003Cheng & Zhu, Sparse Tableau Analysis (STA)  n=#nodes, b=#branches (n-1) KCL b KVL b branch relations b b n-1 Totally 2b+n-1 variables, 2b+n-1 equations bbn-1 Due to independent sources

Jan. 24, 2003Cheng & Zhu, STA (II)  Advantages Covers any circuit Easy to assemble Very sparse  K i, K v, I each has exactly b non-zeros. A and A T each has at most 2b non-zeros.  Disadvantages Sophisticated data structures & programming techniques

Jan. 24, 2003Cheng & Zhu, Agenda  RCL Network  Sparse Tableau Analysis  Modified Nodal Analysis

Jan. 24, 2003Cheng & Zhu, Nodal Analysis  Derivation From STA: (1) (2) (3) (3) x K i -1  (4) x A  (4) Using (a)  (5) (6) Tree trunk voltages Substitute with node voltages (to a given reference), we get the nodal analysis equations.

Jan. 24, 2003Cheng & Zhu, Nodal Analysis (II)

Jan. 24, 2003Cheng & Zhu, Modified Nodal Analysis  General Form Node Conductance matrix KCL Independent current source Independent voltage source Due to non-conductive elements  Y n can be easily derived  Add extra rows/columns for each non-conductive elements using templates

Jan. 24, 2003Cheng & Zhu, MNA (II)  Fill Y n matrix according to incidence matrix Choose n 6 as reference node

Jan. 24, 2003Cheng & Zhu, MNA Templates Independent current source Independent voltage source Add to the right-hand side of the equation

Jan. 24, 2003Cheng & Zhu, MNA Templates (II) CCVS CCCS

Jan. 24, 2003Cheng & Zhu, MNA Templates (III) VCVS VCCS

Jan. 24, 2003Cheng & Zhu, MNA Templates (IV) M Mutual inductance Operational Amplifier

Jan. 24, 2003Cheng & Zhu, MNA Example Circuit Topology MNA Equations

Jan. 24, 2003Cheng & Zhu, MNA Summary  Advantages Covers any circuits Can be assembled directly from input data. Matrix form is close to Y n  Disadvantages We may have zeros on the main diagonal. Principle minors could be singular