TECHNIQUES OF

CIRCUIT ANALYSIS

C.T. Pan 1

4.1 Introduction
4.2 The Node-Voltage Method ( Nodal Analysis )
4.3 The Mesh-Current Method ( Mesh Analysis )
4.4 Fundamental Loop Analysis
4.5 Fundamental Cutset Analysis

C.T. Pan 2
 4.1 Introduction
A circuit consists of b branches and n nodes.
A direct algebraic approach：2b method
Example.

C.T. Pan 3

4.1 Introduction
b=6，n=4 3 independent equations only (n-1)
KCL：
node A： I1+I4+I6=0
node B：－I4+I2+I5=0
node C： I3-I5-I6=0
node D： I1+I2+I3=0

C.T. Pan 4
 4.1 Introduction

KVL：
loop ABDA：V4+V2－V1=0
loop BCDB：V5+V3－V2=0
C.T. Pan
loop ACBA：V6－V5－V4=0 5

4.1 Introduction

Component model (b branches)

V1 = E1 , V4 = R4I4 ,
V2 = R2I2 , V5 = R5I5 ,
V3 = E3 , V6 = R6I6 ,

C.T. Pan 6
 4.1 Introduction
Want to find Vk , Ik , K=1,2,3, … ,6
There are 2b unknowns.
number of KCL eqs：n-1
number of KVL eqs：b-(n-1)
number of component model：b
The total number of equations.
n-1+[b-(n-1)]+b=2b

C.T. Pan 7

4.1 Introduction
Just enough information to find the solution.
Problem：Too many variables !!
It is not efficient !
Question：Is it possible to find an optimal
method with minimum unknowns？

C.T. Pan 8
 4.1 Introduction

n Nodal analysis is based on a systematic application

of KCL and is a general method.

n Mesh Analysis is based on a systematic application

of KVL and can be used for planar circuits only.

C.T. Pan 9

4.1 Introduction
n Fundamental loop analysis is based on a
systematic application of KVL to the
fundamental loops. It requires the definition of
tree.

n Fundamental cutset analysis is based on a

systematic application of KCL to the
fundamental cutsets. It also requires the
definition of tree.
C.T. Pan 10
 4.1 Introduction
n Node: A point where two or more elements join
n Path: A trace of adjoining basic elements with

no elements included more than once

n Branch: A path that connects two nodes

n Essential node: A node where three or more

elements join
n Essential branch: A path that connects two

essential nodes without

passing through an essential
C.T. Pan node 11

4.1 Introduction

n Loop: A path whose last node is the same as the

starting node
n Mesh: A loop that does not enclose any other

loops
n Planar circuit: A circuit that can be drawn on a

plane with no crossing branches

C.T. Pan 12
 4.1 Introduction
n Example 4.1.1

The nodes are { a , b , c , d , e , f }

The essential nodes are { b , d , e , f }
The branches are { R1 , R2 , R3 , R4 , R5 , R6 , V7 , R8 }
The essential branches are { R4 , R6 , V7 , R8 ,
R2 − R3 , R1 − R5 }
C.T. Pan 13

4.1 Introduction
n Example 4.1.1

The meshes are

m1 : b – c – d – e – b
m2 : a – b – e – f – a
m3 : f – e – d – f
C.T. Pan 14
 4.1 Introduction
A graph G is defined as a set: G(B , N , F)

B: set of branches

N: set of nodes

F: a function specifying how a branch is connected.

^
Oriented (directed) graph G ,
if each branch of G is assigned a direction.
C.T. Pan 15

4.1 Introduction
n Example 4.1.2

Gˆ ( B, N , F )

B = { b1 , b2 , b3 , b4 , b5 , b6 , b7 , b8 }
N={a,b,c,d,e,f}
F = { f1 , f2 , f3 , f4 , f5 , f6 , f7 , f8 }
f1 : a → b
f2 : b → c
C.T. Pan 16
 4.1 Introduction
^
For each oriented graph G one can construct a tree T.
^
A tree T of G is a connected graph which
(a) contains all the nodes.
(b) without forming any loop.

The branches which do not belong to tree T are called links.

Each tree branch defines a unique cutset (or super node) ,

called fundamental cutset.

C.T. Pan 17

4.1 Introduction
Each link together with its unique path connecting the two
nodes of the link defines a unique loop , called
fundamental loop.

A network with b branches , n nodes , and l links will

satisfy the fundamental theorem of network topology :

b=l+n-1

C.T. Pan 18
 4.1 Introduction
Theorem
Given a connected graph G of n nodes and b
branches, and a tree T of G
n There is unique path along the tree between any
pair of nodes.
n There are n-1 tree branches and b-(n-1) links.

C.T. Pan 19

4.1 Introduction

n Every link of T and the unique tree path between

its nodes constitute a unique loop, called the
fundamental loop associated with the link.
n Every tree branch of T together with some links

defines a unique cut set of G, called the

fundamental cut set associated with the tree branch.

C.T. Pan 20
 4.1 Introduction
^
Example 4.1.3 G (B , N , F) , b=8 , n=5

B={b1 b2 b3 b4 b5 b6 b7 b8}

N={N1 N2 N3 N4 N5}

F=[f1 f2 f3 f4 f5 f6 f7 f8]T

f1: N4 → N1
f2: N1 → N2
f3: N2 → N3
C.T. Pan 21

4.1 Introduction
Example 4.1.4 Fundamental loops :
T={b2 b3 b5 b8}
tree branches b2 , b3 , b5 , b8
no. of tree branches = n-1=4
L={b1 , b4 , b6 , b7}
links b1 , b4 , b6 , b7 no. of
links = b-(n-1)
= 8-(5-1)
=4
C.T. Pan 22
 4.1 Introduction
Example 4.1.4
Fundamental loops :

For l1: N1−N5−N4−N1

For l4: N4−N5−N1−N2−N3−N4

For l6: N5−N1−N2−N5

For l7: N5−N1−N2−N3−N5

C.T. Pan 23

4.1 Introduction
Example 4.1.5 Fundamental cutsets :

Cut set of b8 = {b8 , b1 , b4}

Cut set of b8 = {b3 , b4 , b7}

Cut set of b8 = {b2 , b6 , b7 , b4}

Cut set of b8 = {b5 , b1 , b6 , b7 ,

b4}

C.T. Pan 24
 4.1 Introduction
Example 4.1.5
n=5 , b=8
T2 = {b5 , b6 , b7 , b8}

Fundamental cut sets :

Cut set of b5 = {b1 , b2 , b5}

Cut set of b6 = {b2 , b3 , b6}
Cut set of b7 = {b3 , b4 , b7}
Cut set of b8 = {b1 , b4 , b8}
Choose tree branch current direction as
reference. Cut only one tree branch.
C.T. Pan 25

4.1 Introduction
Example 4.1.5
Set of links = {b1 , b2 , b3 ,b4}

Fundamental loops :

Loop of b1 = N1→ N5 → N4 → N1
Loop of b2 = N 2 → N 5 → N 1 → N 2
Loop of b3 = N 3 → N 5 → N 2 → N 3
Loop of b4 = N 4 → N 5 → N 3 → N 4

Choose link current as loop

current. Contain only one link.
C.T. Pan 26
 4.2 The Node-Voltage Method

For Linear Resistive Circuits (Example)

n KCL
n KVL
n Component Model (Ohm’s Law)

C.T. Pan 27

4.2 The Node-Voltage Method

n Instead of using branch voltages and branch currents
as unknowns, one can choose nodal voltages as
unknowns. Only n-1 nodal voltages are required.
n Each branch voltage can be obtained from nodal voltages
and the corresponding branch currents can be calculated
by its component model.
n KVL is automatically satisfied.

C.T. Pan 28
 4.2 The Node-Voltage Method

n One need only find the independent KCL

equations，and the component model is used to
express the branch current in terms of nodal
voltages.
Ge = Is

n Any unknown can be calculated once the nodal

voltage vector is solved.

C.T. Pan 29

4.2 The Node-Voltage Method

Case 1. Containing current source only

(A) independent current source by inspection

(B) with dependent current source express the

controlling parameter in terms of nodal
voltages

C.T. Pan 30
 4.2 The Node-Voltage Method
Case 2. Containing voltage source (VS)
(A) VS contains datum node
trivial case
(B) VS does not contain datum node
by supernode concept
(C) for dependent VS
express the controlling parameter in terms
of nodal voltages
C.T. Pan 31

4.2 The Node-Voltage Method

Example 4.2.1. (Case 1A) (Basic Case)

3Ω
Step 1
1Ω 4Ω Select a node as datum
node and choose nodal
2Ω variables e1 , e2 , e3 as
unknowns

C.T. Pan 32
 4.2 The Node-Voltage Method
3Ω Step 2
1Ω 4Ω
Apply KCL to n-1 nodes,
use ohm’s law to express
the branch currents in
2Ω terms of nodal voltages

∑i
leaving
k =0

node 1: − i1 − i2 − 3A = 0
node 2 : + i2 + i3 + i4 = 0
node 3 : + i1 − i4 + 4A = 0
C.T. Pan 33

4.2 The Node-Voltage Method

Use ohm’s law
node 1 :
( e1 − e3 ) + ( e1 − e2 ) − 3A = 0 3Ω
3 1

node 2 :
( e2 − e1 ) + ( e2 − 0 ) + ( e2 − e3 ) = 0 1Ω 4Ω
1 2 4
( e − e1 ) + ( e3 − e2 ) + 4A = 0
+ 3
node 3 : 2Ω
3 4

 1 1 
1 + 3 −1 −
3  e   3A 
  1
 −1 1 + 1 + 1 1    
−  e2  =  0 
 2 4 
4   
  e − 4 A 
 − 1 1 1 1  3  
 3 −
3 4 
+
 4
C.T. Pan 34
 4.5 Fundamental Cutset Analysis
Step 5
Solve equation (D) and calculate IB and VB.
Note that
1. Tree branch voltages are used as unknowns.
2. The number of tree branches is the same as that
of the nodal analysis. Because they are all
optimal methods in terms of using minimum
number of unknown voltages.
C.T. Pan 109

4.5 Fundamental Cutset Analysis

3. The resulting cutset equations depend on the
choice of a tree..
4. Compared with nodal analysis, the fundament
loop method requires defining a tree.

C.T. Pan 110

 Summary
Table 1 Comparison of Nodal and Fundamental Cutset Analyses
Fundamental
Methods Nodal Analysis
Cutset Analysis
KCL NI B = 0 CI B = 0
KVL VB = N T e VB = C T et
Component Model I B = I S + [G ](VB − VS ) I B = I S + [G ](VB − VS )

Ax = b Ax = b
Equation to be Solved A = N [G ]N T
A = C[G ]C T
b = N [G ]VS − NI S b = C[G ]VS − CI S
x=e x = et
e : node voltage vector
C.T. Pan et : tree branch voltage vector 111

Summary
Table 2 Comparison of Mesh and Fundamental Loop Analyses
Fundamental
Methods Nodal Analysis
Cutset Analysis
KCL IB = M T Jm I B = LT J
KVL MVB = 0 LVB = 0
Component Model VB = ES + [ R]( I B − I S ) VB = VS + [ R ]( I B − I S )
Ax = b Ax = b
A = M [ R]M T
A = L[ R ]LT
Equation to be Solved
b = M [ R]I S − MES b = L[ R ]I S − LVS
x = Jm x=J
Jm : mesh current vector
C.T. Pan 112
J : link current vector
 Summary
An interesting and practical circuit
[Problem 4.16]

R R R R
vo
v1 v2 v3 vn

C.T. Pan 113

Summary
By using node-voltage method:
Choose node b as the datum node .
Then
vo − v1 vo − v2 vo − v3 v −v
+ + + ... + o n = 0
R R R R
∴ n vo = (v1 + v2 + v3 + ... + vn )
1 n
∴ vo = ∑ vk
n k =1
C.T. Pan 114
 Summary

It is an averaging circuit used to find the average

value of n voltages.
Note that there is a common node and all resisters
are equal , called sharing bus method.

C.T. Pan 115

Summary
nObjective 1 : Understand and be able to use the
node-voltage method to solve a
circuit.
nObjective 2 : Understand and be able to use the
mesh-current method to solve a
circuit.
nObjective 3 : Be able to decide whether the node-
voltage method or the mesh –current
method is preferred approach to
solving a particular circuit.
C.T. Pan 116
 Summary
nObjective 4 : Understand how a circuit is stored in
a computer and some basic graph
theory.
nObjective 5 : Understand the basic principle of
fundamental loop analysis.
nObjective 6 : Understand the basic principle of
fundamental cutset analysis.

C.T. Pan 117

Summary
n Problem : 4.9
4.17
4.24
4.31
4.39
4.43
n Due within one week.

C.T. Pan 118