4 views

Uploaded by cass

- 12291.Algorithms and Complexity by Herbert S. Wilf
- Fibonacci Sequence: From Solving the Recurrence Relation in Exponential Time to The Logarithmic Time Implementation
- Artigo - 1983 - Bodin - Routing and Scheduling of Vehicles and Crews - The State of the Art.pdf
- P versus NP
- focs98
- 2
- DAA-NEW
- neo
- popl02
- Download
- Data Celko
- Algorithm for Constructing Decision Tree
- Asymptotic Notations for Time Efficiency Analysis
- Improved Parallel Algorithm for Time Series Based Forecasting Using OTIS-Mesh
- lnotes linux
- lec4
- Pnp Problems
- Algo Mod1 Introduction
- Complexity
- 10.1.1.35.5512(1)

You are on page 1of 16

Discuss graph theory in the context of electric circuits Argue that nodal analysis results in an independent set of equations Discuss time complexity of problems in this course Discuss approximate algorithms for reducing complexity

Hooray for the CalBot contest winners! Best Functionality: Nathan Sentz1st Terrance Shih and Rita Chu2nd John Breneman, Ian Robertson and Liona Fan-Chiang3rd Kevin JonesHonorable Mention Speed Contest: Dan Tocchini and Waley Liang Hooray for all the participants and their awesome (if unlucky!) bots! Hooray for the last day of EE 40!

GRAPH THEORY IN CIRCUIT ANALYSIS When I enter a circuit like this into PSpice,

it stores the information Node 4 and node 5 are connected, with a resistor.

It creates a graph, with elements as branches.

GRAPH OF A CIRCUIT a

b e f h

c g

TREE a

b

e d f

c

g

h

A tree is defined as any set of connections in a graph that connects every node to every other node without forming any closed paths. Also known as Hamiltonian path!

All connections not in a tree are in the co-tree for that tree.

CUT SET a

b e f h

c g

A cut set is a minimal set of connections that, when broken, breaks the graph into two completely separate parts. Minimal means that the cut set cannot contain another cut set as a subset that would break the graph into the same two parts.

c g

A fundamental cut set is a cut set that only contains one branch of the tree.

HOW TO FIND FUNDAMENTAL CUT SETS 1. Redraw the graph with the tree in a straight line. 2. For each tree branch, 2a) place the tree branch in a new cut set 2b) see what two node groups are formed by that cut branch 2c) place all links in the co-tree that connect these two groups in that cut set.

a

b 1 d 4 2 5 3

Each cut set defines two groups of nodes: 2 supernodes.

Thus, the current in branches of a cut set must sum to zero. Suppose we do this KCL for each fundamental cut set.

Each time we KCL a new fundamental cut set, we introduce a tree branch which is not in any of the other KCL equations.

So each set of KCL equations is independent!*

Thats how many fundamental cut sets there are to do KCL. We get the right number of KCL equations for nodal analysis!

*CONFLICTS

For some circuits on paper (not in real life) we cant solve the KCL equations.

If there are the right number of independent equations, how can this happen?

Answer: This graph theory analysis did not address the information that the elements themselves will contribute to the equations. Sometimes, the elements can give conflicting information (e. g., voltage source in parallel with wire) or redundant information and this leads to no solution. Remember, this doesnt happen in real life!

Suppose I want to find the maximum VOUT possible with given resistor values and tolerances.

A simple calculus proof shows that when VOUT is maximum, each resistor is at its highest or lowest possible value (inbetween values cannot maximize VOUT). So we could just try each possible combination to find max: 6 resistors, each has 2 possible values: 26 combinations.

If we tried to do this maximization for a circuit with n resistors, we would have 2n resistor combinations to test. Not good if n is even somewhat large!

The number of computations it takes to solve this problem is exponential in the size of the problem, n. Prof. Rosss research: Are there ways around this, such as approximate algorithms or probabilistic algorithms?

CIRCUIT SATISFIABILITY

Here is another problem with exponential time complexity. Suppose we have a Boolean function in n variables: F = AB + BCD + ADE +BE (Here, n = 5)

Is there some combination of inputs that will make F = 1 ? We could test all of the possible inputs: 2n of them. Again, exponential complexity!

THE CLASS NP If someone gives you a certificate that a Boolean function produces a 1, namely, the inputs that make F = 1, then it is easy to verify their claim: it takes just one computation of a digital circuit. So an answer to this problem can be verified in polynomial time, but we need exponential time to decide the problem from scratch.

Think of NP as the description of a good exam: Exponentially difficult for the student to solve Polynomially easy for the instructor to check

APPROXIMATE ALGORITHMS The problem of finding a Hamiltonian path (tree) is also in NP. So it could be computationally challenging to come up with the tree that leads to the fundamental cut sets that lead to the KCL in our circuit analysis. What if I just went from node to node in numerical order, a and if there wasnt already a connection, I b c made one with a 10 MW resistor? e f g d How much would this change the h solution?

- 12291.Algorithms and Complexity by Herbert S. WilfUploaded byAnonymous NcB95G6Xw
- Fibonacci Sequence: From Solving the Recurrence Relation in Exponential Time to The Logarithmic Time ImplementationUploaded byIhab McShea
- Artigo - 1983 - Bodin - Routing and Scheduling of Vehicles and Crews - The State of the Art.pdfUploaded bypgtime
- P versus NPUploaded byJonathan Alonzo Garcia
- focs98Uploaded byKevin Mondragon
- 2Uploaded byLiNu
- DAA-NEWUploaded byIndia Freedom
- neoUploaded byMirtoubine Al
- popl02Uploaded byAnonymous RrGVQj
- DownloadUploaded byEr Mansoor Hussain
- Data CelkoUploaded bycmpatel.chem
- Algorithm for Constructing Decision TreeUploaded byAllison Collier
- Asymptotic Notations for Time Efficiency AnalysisUploaded byKancil Share
- Improved Parallel Algorithm for Time Series Based Forecasting Using OTIS-MeshUploaded byIDES
- lnotes linuxUploaded bypraveen
- lec4Uploaded bySRINIVASA RAO
- Pnp ProblemsUploaded byakg299
- Algo Mod1 IntroductionUploaded byISSAM HAMAD
- ComplexityUploaded byism33
- 10.1.1.35.5512(1)Uploaded byDhelia
- Scimakelatex.79648.Frederick+Johnson.chao Ming+ChenUploaded bySamantha Jackson
- Growth of FunctionsUploaded byIon Ruxandra
- 06200359 (1)Uploaded bybinukiruba
- DSA Multiple ChoiceUploaded byAerith Strike
- Graph ClusteringUploaded byasdasd1_
- a2 HandoutUploaded byethan werther
- hgkUploaded bysabrisin
- 3 Alg Analysis 2 (f3)Uploaded by007phantom
- SCOPFUploaded bymaxcopernico
- Ecolexicon Manual.enUploaded byZivago

- 21174932 History of the Modern Periodic TableUploaded bycass
- lec25_2003Uploaded bycass
- lec24_2003Uploaded bycass
- lec22_2003Uploaded bycass
- lec21_2003Uploaded bycass
- lec20_2003Uploaded bycass
- lec16_2003Uploaded bycass
- lec14_2003Uploaded bycass
- lec13_2003Uploaded bycass
- lec11_2003Uploaded bycass
- lec10_2003Uploaded byHarish Kumar
- lec9_2003Uploaded bycass
- lec7_2003Uploaded bycass
- lec6_2003Uploaded bycass
- lec5_2003Uploaded bycass
- lec4_2003Uploaded bychoppersure
- lec3_2003Uploaded bycass
- lec2_2003Uploaded byklkaranpatel

- Test Bank Chapter 21Uploaded byanonymous
- ELE 211 Fall10 SyllabiUploaded byahmadbashiri5135
- Switching Regulator DemystifiedUploaded byartelse
- ELTR100_sec3Uploaded byifeniyi
- Electromechanical Systems with Simscape3e.pptxUploaded byIulian Calin
- Basic Control System ConceptsUploaded byronakuch
- HiFi Audio Circuit Design.pdfUploaded byleonel montilla
- Syll Elec Engineering 2ndUploaded byAkshMK
- Infineon BTS117TC DS v01 00 EnUploaded byAnonymous xTGQYFr
- Course SyllabusUploaded byEuropez Alaskha
- HW10SolutionsUploaded byShaodong Huang
- EE6201-Circuit Theory.pdfUploaded byKevin Esta
- delta-y, y-deltaUploaded byBalqis yasin
- 1484562533390-qb_elec2_2Uploaded byMallikarjunBhirade
- Lab 5 Ohm's LawUploaded byZachary
- 24 Capacitors (1)Uploaded byJoey the Lifter
- Vorperian IUploaded byMiguel Angel Sicilia
- lap manual pspice.pdfUploaded byred_hearted
- Gatta 2016Uploaded byIka Yume
- Project HvdcUploaded byThiyagugunapalan Gunapalan
- Physics 181 E0Uploaded byJenny Sagisi
- A New Macro-Model for Power Diodes Reverse Recovery.pdfUploaded byElectricEngineering
- Impulse BrUploaded byRatilal M Jadav
- L9Uploaded byKitipong Mano
- Electronic Principles 8th Ed [2015]Uploaded byRykudou Zudyn
- Very High Frequency ConverterUploaded bybravisankar
- Circuit TheoryUploaded byfmtt
- Lab Report SampleUploaded byjustinsong213
- Physics II Problems (100).pdfUploaded byBOSS BOSS
- Silabus SAP Elektronika Industri v2Uploaded byMuhammad Ihsan Aljabbar