Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)

Similar documents
BFF1303: ELECTRICAL / ELECTRONICS ENGINEERING. Direct Current Circuits : Methods of Analysis

RESISTIVE CIRCUITS MULTI NODE/LOOP CIRCUIT ANALYSIS

LOOP ANALYSIS. determine all currents and Voltages in IT IS DUAL TO NODE ANALYSIS - IT FIRST DETERMINES ALL CURRENTS IN A CIRCUIT

LOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit

ELECTRICAL CIRCUIT AND MACHINE ENT 249/3. Methods of Analysis

Method of analysis. Bởi: Sy Hien Dinh

Chapter 3 Methods of Analysis: 2) Mesh Analysis

i v v 6 i 2 i 3 v + (1) (2) (3) (4) (5) Substituting (4) and (5) into (3) (6) = 2 (7) (5) and (6) (8) (4) and (6) ˆ

Mesh and Node Equations: Circuits Containing Dependent Sources

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

TN348: Openlab Module - Colocalization

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

An Optimal Algorithm for Prufer Codes *

Parallelism for Nested Loops with Non-uniform and Flow Dependences

A fault tree analysis strategy using binary decision diagrams

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

Programming in Fortran 90 : 2017/2018

AP PHYSICS B 2008 SCORING GUIDELINES

CPE 628 Chapter 2 Design for Testability. Dr. Rhonda Kay Gaede UAH. UAH Chapter Introduction

S1 Note. Basis functions.

High-Boost Mesh Filtering for 3-D Shape Enhancement

Lecture - Data Encryption Standard 4

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

CHAPTER 2 DECOMPOSITION OF GRAPHS

Intra-Parametric Analysis of a Fuzzy MOLP

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

Hermite Splines in Lie Groups as Products of Geodesics

Positive Semi-definite Programming Localization in Wireless Sensor Networks

A Binarization Algorithm specialized on Document Images and Photos

Loop Transformations for Parallelism & Locality. Review. Scalar Expansion. Scalar Expansion: Motivation

mquest Quickstart Version 11.0

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

The Codesign Challenge

USING GRAPHING SKILLS

Load Balancing for Hex-Cell Interconnection Network

Assembler. Building a Modern Computer From First Principles.

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

On Some Entertaining Applications of the Concept of Set in Computer Science Course

Analysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR

Electrical analysis of light-weight, triangular weave reflector antennas

Topology Design using LS-TaSC Version 2 and LS-DYNA

Parallel matrix-vector multiplication

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

Cluster Analysis of Electrical Behavior

Loop Transformations, Dependences, and Parallelization

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Storage Binding in RTL synthesis

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

CE 221 Data Structures and Algorithms

Welcome to the Three Ring %CIRCOS: An Example of Creating a Circular Graph without a Polar Axis

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements

Mathematics 256 a course in differential equations for engineering students

Categories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms

Unsupervised Learning

CS1100 Introduction to Programming

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Load-Balanced Anycast Routing

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

An Image Fusion Approach Based on Segmentation Region

Notes on Organizing Java Code: Packages, Visibility, and Scope

Solving two-person zero-sum game by Matlab

Control strategies for network efficiency and resilience with route choice

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp

Problem Set 3 Solutions

CHARUTAR VIDYA MANDAL S SEMCOM Vallabh Vidyanagar

Reading. 14. Subdivision curves. Recommended:

Outline. Digital Systems. C.2: Gates, Truth Tables and Logic Equations. Truth Tables. Logic Gates 9/8/2011

An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane

Pictures at an Exhibition

Preconditioning Parallel Sparse Iterative Solvers for Circuit Simulation

BITPLANE AG IMARISCOLOC. Operating Instructions. Manual Version 1.0 January the image revolution starts here.

Comparison of traveltime inversions on a limestone structure

Efficient Content Representation in MPEG Video Databases

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Chapter 4. Non-Uniform Offsetting and Hollowing by Using Biarcs Fitting for Rapid Prototyping Processes

Lecture #15 Lecture Notes

Lossless Compression of Map Contours by Context Tree Modeling of Chain Codes

Related-Mode Attacks on CTR Encryption Mode

Analysis of Continuous Beams in General

Efficient Distributed File System (EDFS)

Interpolation of the Irregular Curve Network of Ship Hull Form Using Subdivision Surfaces

ROBOT KINEMATICS. ME Robotics ME Robotics

CACHE MEMORY DESIGN FOR INTERNET PROCESSORS

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning

Run-Time Operator State Spilling for Memory Intensive Long-Running Queries

Transcription:

Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL)

Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut, the number of smultaneous equatons to sole for can be reduced. Gen a crcut wth n nodes, wthout oltage sources, the nodal analyss s accomplshed a three steps:. Select a node as the reference node. Assgn oltages,, n to the remanng n- nodes, oltages are relate to the reference node.. Apply KCL to each of the n- non-reference nodes. Use Ohm s law to express the branch currents n terms of node oltages. Sole the resultng n- smultaneous equatons to obtan the unknown node oltages. The reference, or datum, node s commonly referred to as the ground snce ts oltage s by default zero.

Applyng Nodal Analyss Let s apply nodal analyss to ths crcut to see how t works. Ths crcut has a node that s desgned as ground. We wll use that as the reference node (node 0) The remanng two nodes are desgned and and assgned oltages and. Now apply KCL to each node: At node At node I I I

Apply Nodal Analyss II We can now use OHM s law to express the unknown currents,, and n terms of node oltages. In dong so, keep n mnd that current flows from hgh potental to low From ths we get: The last step s to sole the system of equatons 4 or 0 or or 0 G G G Substtutng back nto the node equatons I I I G G I G G I I or

Includng oltage sources Dependng on what nodes the source s connected to, the approach ares Between the reference node and a non-reference mode: Set the oltage at the nonreference node to the oltage of the source In the example crcut =0V Between two non-reference nodes The two nodes form a supernode. 5

Supernode A supernode s formed by enclosng a oltage source (dependant or ndependent) connected between two nonreference nodes and any elements connected n parallel wth t. Why? Nodal analyss requres applyng KCL The current through the oltage source cannot be known n adance (Ohm s law does not apply) By lumpng the nodes together, the current balance can stll be descrbed In the example crcut node and form a supernode The current balance would be: Or ths can be expressed as: 4 4 0 8 6 0 6

Analyss wth a supernode In order to apply KVL to the supernode n the example, the crcut s redrawn as shown. Gong around ths loop n the clockwse drecton ges: 0 5 5 Note the followng propertes of a supernode:. The oltage source nsde the supernode prodes a constrant equaton needed to sole for the node oltages. A supernode has no oltage of ts own. A supernode requres the applcaton of both KCL and KVL 7

Mesh Analyss Another general procedure for analyzng crcuts s to use the mesh currents as the crcut arables. ecall: A loop s a closed path wth no node passed more than once A mesh s a loop that does not contan any other loop wthn t Mesh analyss uses KVL to fnd unknown currents Mesh analyss s lmted n one aspect: It can only apply to crcuts that can be rendered planar. A planar crcut can be drawn such that there are no crossng branches. 8

Planar s Nonpalanar The fgure on the left s a nonplanar crcut: The branch wth the Ω resstor preents the crcut from beng drawn wthout crossng branches The fgure on the rght s a planar crcut: It can be redrawn to aod crossng branches 9

Mesh Analyss Steps Mesh analyss follows these steps:.assgn mesh currents,, n to the n meshes.apply KVL to each of the n mesh currents..sole the resultng n smultaneous equatons to get the mesh currents 0

Mesh Analyss Example The aboe crcut has two paths that are meshes (abefa and bcdeb) The outer loop (abcdefa) s a loop, but not a mesh Frst, mesh currents and are assgned to the two meshes. Applyng KVL to the meshes: 0 0 V V V V

Mesh Analyss wth Current Sources The presence of a current source makes the mesh analyss smpler n that t reduces the number of equatons. If the current source s located on only one mesh, the current for that mesh s defned by the source. For example: Here, the current s equal to -A

Supermesh Smlar to the case of nodal analyss where a oltage source shared two non-reference nodes, current sources (dependent or ndependent) that are shared by more than one mesh need specal treatment The two meshes must be joned together, resultng n a supermesh. The supermesh s constructed by mergng the two meshes and excludng the shared source and any elements n seres wth t A supermesh s requred because mesh analyss uses KVL But the oltage across a current source cannot be known n adance. Intersectng supermeshes n a crcut must be combned to for a larger supermesh.

Creatng a Supermesh In ths example, a 6A current course s shared between mesh and. The supermesh s formed by mergng the two meshes. The current source and the Ω resstor n seres wth t are remoed. 4

Supermesh Example Usng the crcut from the last slde: Apply KVL to the supermesh 0 6 0 4 0 or 6 4 0 We next apply KCL to the node n the branch where the two meshes ntersect. 6 Solng these two equatons we get:.a.8a Note that the supermesh requred usng both KVL and KCL 5

Selectng an Approprate Approach In prncple both the nodal analyss and mesh analyss are useful for any gen crcut. What then determnes f one s gong to be more effcent for solng a crcut problem? There are two factors that dctate the best choce: The nature of the partcular network s the frst factor The second factor s the nformaton requred 6

Mesh analyss when If the network contans: Many seres connected elements Voltage sources Supermeshes A crcut wth fewer meshes than nodes If branch or mesh currents are what s beng soled for. Mesh analyss s the only sutable analyss for transstor crcuts It s not approprate for operatonal amplfers because there s no drect way to obtan the oltage across an op-amp. 7

Nodal analyss f If the network contans: Many parallel connected elements Current sources Supernodes Crcuts wth fewer nodes than meshes If node oltages are what are beng soled for Non-planar crcuts can only be soled usng nodal analyss Ths format s easer to sole by computer 8

Applcaton: DC transstor crcut Here we wll use the approaches learned n ths chapter to analyze a transstor crcut In general, there are two types of transstors commonly used: Feld Effect (FET) and Bpolar Juncton (BJT). Ths problem wll use a BJT. A BJT s a three termnal dece, where the nput current nto one termnal (the base) affects the current flowng out of a second termnal (the collector). The thrd termnal (the emtter) s the common termnal for both currents 9

KCL and KVL for a BJT The currents from each termnal can be related to each other as follows: I E I B I C The base and collector current can be related to each other by the parameter, whch can range from 50-000 I Applyng KVL to the BJT ges: V C I B CE V EB V BC 0 0

DC model of a BJT A transstor has a few operatng modes dependng on the appled oltages/currents. In ths problem, we wll be nterested n the operaton n acte mode. Ths s the mode used for amplfyng sgnals. The fgure below shows the equalent DC model for a BJT n acte mode Note that nodal analyss can only be appled to the BJT after usng ths model

Settng up a BJT crcut Below are three approaches to solng a transstor crcut. Note when the equalent model s used and when t s not. Orgnal crcut Mesh analyss Nodal analyss PSpce analyss