RESISTIVE CIRCUITS MULTI NODE/LOOP CIRCUIT ANALYSIS

Similar documents
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

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

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

NODAL AND LOOP ANALYSIS TECHNIQUES. Develop systematic techniques to determine all the voltages and currents in a circuit NODE ANALYSIS

ELECTRICAL CIRCUIT AND MACHINE ENT 249/3. Methods of 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) ˆ

NODAL AND LOOP ANALYSIS TECHNIQUES

Support Vector Machines

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

Mesh and Node Equations: Circuits Containing Dependent Sources

Hermite Splines in Lie Groups as Products of Geodesics

The Codesign Challenge

kccvoip.com basic voip training NAT/PAT extract 2008

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.

y and the total sum of

The mesh-current method

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

Programming in Fortran 90 : 2017/2018

CS240: Programming in C. Lecture 12: Polymorphic Sorting

5.0 Quality Assurance

S1 Note. Basis functions.

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

An Optimal Algorithm for Prufer Codes *

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

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

Method of analysis. Bởi: Sy Hien Dinh

AP PHYSICS B 2008 SCORING GUIDELINES

CHAPTER 2 DECOMPOSITION OF GRAPHS

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

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

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

Storage Binding in RTL synthesis

K-means and Hierarchical Clustering

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Chapter 3 Methods of Analysis: 2) Mesh Analysis

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

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

Biclique Cryptanalysis Of PRESENT, LED, And KLEIN

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach

Cache Memories. Lecture 14 Cache Memories. Inserting an L1 Cache Between the CPU and Main Memory. General Org of a Cache Memory

Machine Learning. Topic 6: Clustering

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

Object-Based Techniques for Image Retrieval

Outline. Third Programming Project Two-Dimensional Arrays. Files You Can Download. Exercise 8 Linear Regression. General Regression

Hybrid Non-Blind Color Image Watermarking

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

MATHEMATICS FORM ONE SCHEME OF WORK 2004

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

AMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis

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

Brave New World Pseudocode Reference

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

Fitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.

Analysis of Continuous Beams in General

New Extensions of the 3-Simplex for Exterior Orientation


A fault tree analysis strategy using binary decision diagrams

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

Giving credit where credit is due

Introduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2

RELATIVE ORIENTATION ESTIMATION OF VIDEO STREAMS FROM A SINGLE PAN-TILT-ZOOM CAMERA. Commission I, WG I/5

Support Vector Machines. CS534 - Machine Learning

Solving two-person zero-sum game by Matlab

Lecture 3. ELECTRICAL ENGINEERING: PRINCIPLES AND APPLICATIONS, Fourth Edition, by Allan R. Hambley, 2008 Pearson Education, Inc.

Solving Route Planning Using Euler Path Transform

ECONOMICS 452* -- Stata 11 Tutorial 6. Stata 11 Tutorial 6. TOPIC: Representing Multi-Category Categorical Variables with Dummy Variable Regressors

Intro. Iterators. 1. Access

Smoothing Spline ANOVA for variable screening

Cluster Analysis of Electrical Behavior

Reading. 14. Subdivision curves. Recommended:

CE 221 Data Structures and Algorithms

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005

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

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

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Nachos Project 3. Speaker: Sheng-Wei Cheng 2010/12/16

GSLM Operations Research II Fall 13/14

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

Intra-Parametric Analysis of a Fuzzy MOLP

3D vector computer graphics

A New Approach For the Ranking of Fuzzy Sets With Different Heights

Classification / Regression Support Vector Machines

USING GRAPHING SKILLS

A Flexible Technique for Accurate Omnidirectional Camera Calibration and Structure from Motion

Dynamic Programming. Example - multi-stage graph. sink. source. Data Structures &Algorithms II

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

Mathematics 256 a course in differential equations for engineering students

Hierarchical clustering for gene expression data analysis

such that is accepted of states in , where Finite Automata Lecture 2-1: Regular Languages be an FA. A string is the transition function,

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Transcription:

RESSTE CRCUTS MULT NODE/LOOP CRCUT ANALYSS

DEFNNG THE REFERENCE NODE S TAL 4 THESTATEMENT 4 S MEANNGLES UNTL THE REFERENCE PONT S DEFNED BY CONENTON THE GROUND SYMBOL SPECFES THE REFERENCE PONT. ALL NODE OLTAGES ARE MEASURED WTH RESPECT TO THAT REFERENCE PONT?

THE STRATEGY FOR NODE ANALYSS S a b c. DENTFY ALL NODES AND SELECT A REFERENCE NODE. DENTFY KNOWN NODE OLTAGES @ a : a s a a b 9k 6k k @ b : 4 5 b a b b c k 4k 9k @ c : 6 c b c 9k k 5 REFERENCE. AT EACH NODE WTH UNKNOWN OLTAGE WRTE A KCL EQUATON (e.g.,sum OF CURRENT LEANG ) 4. REPLACE CURRENTS N TERMS OF NODE OLTAGES AND GET ALGEBRAC EQUATONS N THE NODE OLTAGES... SHORTCUT: SKP WRTNG THESE EQUATONS... AND PRACTCE WRTNG THESE DRECTLY

EXAMPLE WRTE THE KCL EQUATONS @ NODE WE SUALZE THE CURRENTS LEANG AND WRTE THE KCL EQUATON REPEAT THE PROCESS AT NODE i v v v v R4 R OR SUALZE CURRENTS GONG NTO NODE

6mA Node analysis @ : ma 6mA 6 k @ : 6mA 6k k N MOST CASES THERE ARE SEERAL DFFERENT WAYS OF SOLNG A PROBLEM 8mA k (6 ma) ma k 6k 6k (6 ma) 4mA k 6k NODE EQS. BY NSPECTON k ( ) ( 6)mA 6k k ( ) 6 ma Once node voltages are known k 6k k CURRENTS COULD BE COMPUTED DRECTLY USNG KCL AND CURRENT DDER!!

nodes plus the reference. n principle one needs equations... but two nodes are connected to the reference through voltage sources. Hence those node voltages are known!!! Hint: Each voltage source connected to the reference node saves one node equation Only one KCL is necessary 6k k [ ] k 4 THESE ARE THE REMANNG TWO NODE EQUATONS 6[ ] SOLNG THE EQUATONS ( ) 6[ ] (.5[ ] )

THE SUPERNODE TECHNQUE SUPERNODE S Conventional analysis requires all currents at a node 6k @_ 6mA @_ 4 ma S S k eqs, unknowns...panic!! The current through the source is not related to the voltage of the source Math solution: add one equation 6[ ] Efficient solution: enclose the source, and all elements in parallel, inside a surface. Apply KCL to the surface!!! 4mA 6k k 6 ma The source current is interior to the surface and is not required We STLL need one more equation 6[ ] Only eqs in two unknowns!!!

ALGEBRAC DETALS The Equations () () Solution 6mA 6k k 6[ ] 4mA. Eliminate denominators in Eq(). Multiply by... 4[ ] 6[ ]. Add equations to eliminate [ ] [ ]. Use Eq() to compute 6[ ] 4[ ]

Find alue of O SUPERNODE 4 6 SOURCES CONNECTED TO THE REFERENCE 4 CONSTRANT EQUATON KCL @ SUPERNODE 6 k S NOT NEEDED FOR O ( 4) k k k * / k * / and add 5 8 OHM'S LAW O. 8mA k

Apply node analysis to this circuit - R R R R R - 8 There are 4 non reference nodes There is one super node There is one node connected to the reference through a voltage source We need three equations to compute all node voltages R BUT THERE S ONLY ONE CURRENT FLOWNG THROUGH ALL COMPONENTS AND F THAT CURRENT S DETERMNED ALL OLTAGES CAN BE COMPUTED WTH OHM S LAW STRATEGY:. Apply KL (sum of voltage drops ). Use Ohm s Law to express voltages in terms of the loop current. [ ] 8[ ] R R R [ ] R R 8[ ] R RESULT S ONE EQUATON N THE LOOP CURRENT!!! SHORTCUT 4 Skip this equation Write this one directly

LOOPS, MESHES AND LOOP CURRENTS a b 7 c f 6 e 5 d A BASC CRCUT EACH COMPONENT S CHARACTERZED BY TS OLTAGE ACROSS AND TS CURRENT THROUGH A LOOP S A CLOSED PATH THAT DOES NOT GO TWCE OER ANY NODE. THS CRCUT HAS THREE LOOPS fabef ebcde 4 fabcdef A MESH S A LOOP THAT DOES NOT ENCLOSE ANY OTHER LOOP. fabef, ebcde ARE MESHES A LOOP CURRENT S A (FCTCOUS) CURRENT THAT S ASSUMED TO FLOW AROUND A LOOP,, ARE LOOP CURRENTS A MESH CURRENT S A LOOP CURRENT ASSOCATED TO A MESH., ARE MESH CURRENTS CLAM: N A CRCUT, THE CURRENT THROUGH ANY COMPONENT CAN BE EXPRESSED N TERMS OF THE LOOP CURRENTS EXAMPLES FACT: NOT EERY LOOP CURRENT S REQURED TO COMPUTE ALL THE CURRENTS THROUGH COMPONENTS a a f b e b c b 7 c 4 f 6 e 5 d A BASC CRCUT THE DRECTON OF THE LOOP CURRENTS S SGNFCANT USNG TWO LOOP CURRENTS a f be bc FOR EERY CRCUT THERE S A MNMUM NUMBER OF LOOP CURRENTS THAT ARE NECESSARY TO COMPUTE EERY CURRENT N THE CRCUT. SUCH A COLLECTON S CALLED A MNMAL SET (OF LOOP CURRENTS).

FOR A GEN CRCUT LET B NUMBER OF BRANCHES N NUMBER OF NODES THE MNMUM REQURED NUMBER OF LOOP CURRENTS S L B ( N ) MESH CURRENTS ARE ALWAYS NDEPENDENT AN EXAMPLE DETERMNATON OF LOOP CURRENTS KL ON LEFT MESH KL ON RGHT MESH v v v v S 4 5 USNG OHM S LAW v i R, v i R, v ( i i ) R v i R, v i R 4 4 5 5 REPLACNG AND REARRANGNG B 7 N 6 L 7 (6 ) TWO LOOP CURRENTS ARE REQURED. THE CURRENTS SHOWN ARE MESH CURRENTS. HENCE THEY ARE NDEPENDENT AND FORM A MNMAL SET

DEELOPNG A SHORTCUT WRTE THE MESH EQUATONS - R - R R WHENEER AN ELEMENT HAS MORE THAN ONE LOOP CURRENT FLOWNG THROUGH T WE COMPUTE NET CURRENT N THE DRECTON OF TRAEL R 5 R 4 DRAW THE MESH CURRENTS. ORENTATON CAN BE ARBTRARY. BUT BY CONENTON THEY ARE DEFNED CLOCKWSE NOW WRTE KL FOR EACH MESH AND APPLY OHM S LAW TO EERY RESSTOR. AT EACH LOOP FOLLOW THE PASSE SGN CONENTON USNG LOOP CURRENT REFERENCE DRECTON R ( ) R R5 R R4 ( ) R

EXAMPLE: FND o AN ALTERNATE SELECTON OF LOOP CURRENTS SHORTCUT: POLARTES ARE NOT NEEDED. APPLY OHM S LAW TO EACH ELEMENT AS KL S BENG WRTTEN KL @ KL @ KL @ REARRANGE k 6k 6k 9k * / and add k 6. 5mA 5 k 6k ma 4 EXPRESS ARABLE OF NTEREST AS FUNCTON OF LOOP CURRENTS O KL @ NOW O REARRANGE THS SELECTON S MORE EFFCENT k 6k * / 6k 9k 9 * / and substract 4k 8 ma 4

. DRAW THE MESH CURRENTS. WRTE MESH EQUATONS MESH k 4k k) k [ ] ( k (k 6k) (6 MESH ) DDE BY k. GET NUMBERS FOR COEFFCENTS ON THE LEFT AND ma ON THE RHS. SOLE EQUATONS 8 [ ma] 8 9[ ma] * / 4 and add [ ma] O 6k [ ] 5

KL THERE S NO RELATONSHP BETWEEN AND THE SOURCE CURRENT! HOWEER... MESH CURRENT S CONSTRANED MESH EQUATON MESH ma BY NSPECTON k 8k k (ma) ma O 6k 8k 4 9 [ ] CURRENT SOURCES THAT ARE NOT SHARED BY OTHER MESHES (OR LOOPS) SERE TO DEFNE A MESH (LOOP) CURRENT AND REDUCE THE NUMBER OF REQURED EQUATONS TO OBTAN APPLY KL TO ANY CLOSED PATH THAT NCLUDES

CURRENT SOURCES SHARED BY LOOPS - THE SUPERMESH APPROACH. WRTE CONSTRANT EQUATON DUE TO MESH CURRENTS SHARNG CURRENT SOURCES 4mA. WRTE EQUATONS FOR THE OTHER MESHES ma 4. DEFNE A SUPERMESH BY (MENTALLY) REMONG THE SHARED CURRENT SOURCE. SELECT MESH CURRENTS 5. WRTE KL FOR THE SUPERMESH 6 k k k( ) k ( ) SUPERMESH NOW WE HAE THREE EQUATONS N THREE UNKNOWNS. THE MODEL S COMPLETE

FND OLTAGES R 4 R S S 4 R ACROSS S R RESSTORS For loop analysis we notice... - S Three independent current sources. Four meshes. One current source shared by two meshes. Careful choice of loop currents should make only one loop equation necessary. Three loop currents can be chosen using meshes and not sharing any source. 4 Now we need a loop current that does not go over any current source and passes through all unused components. HNT: F ALL CURRENT SOURCES ARE REMOED THERE S ONLY ONE LOOP LEFT S SOLE FOR THE CURRENT 4. USE OHM S LAW TO CMPUTE REQURED OLTAGES MESH EQUATONS FOR LOOPS WTH CURRENT SOURCES s S S KL OF REMANNG LOOP R ( 4 ) R ( 4 ) R4 ( 4 ) R ( 4 ) R ( ) R ( 4 )