9/14/2012

1
Kirchhoff Laws
Pekik Argo Dahono
Kirchhoff Voltage Law
For all lumped connected
circuits, for all choices of datum
node, for all times t, for all pairs of
nodes k and j
For all lumped connected
circuits, for all closed node
sequences, for all times t, the
algebraic sum of all node-to-node
voltages around the chosen
closed node sequence is equal to
zero.
j k kj
e e v =
9/14/2012
2
Kirchhoff Voltage Law
0
0
52 45 24
51 45 34 23 12
= + +
= + + + +
v v v
v v v v v
D
2 2 5 52
4 2 24
4 5 4 45
4 3 34
3 2 23
2 1 12
1 5 1 15
e e e v
e e v
e e e v
e e v
e e v
e e v
e e e v
= =
=
= =
=
=
=
= =
Kirchhoff Current Law
For all lumped circuits, for all gaussian
surfaces S, for all times t, the algebraic sum
of all currents leaving the gaussian surface
S at time t is equal to zero.
For all lumped circuits, for all times t, the
algebraic sum of the currents leaving any
node is equal to zero.
9/14/2012
3
Kirchhoff Current Law
0
0
0
11 9 8 6 5 4 3
6 5 4 1
2 1
= + + +
= + + +
= +
i i i i i i i
i i i i
i i
11
i
9
i
8
i
10
i
3
i
1
i
2
S
12
i
6
S
4
S
7
i
4
i
3
S
1
S
2
i 5
S
+

5
i
6
i
Three Important Remarks
KVL and KCL are the two fundamental
postulates of lumped-circuit theory.
KVL and KCL hold irrespective of the nature of
the elements constituting the circuit. Hence, we
may say that Kirchhoff laws reflect the
interconnection properties of the circuit.
KVL and KCL always lead to homogeneous
linear algebraic equations with constant real
coefficients, 0, 1, and -1, if written in the fashion
as we have discussed.
9/14/2012
4
From Circuits to Graph
A graph is defined by a set of nodes and a set of
branches.
If each branch is given an orientation, indicated
by an arrow on the branch, we call the graph is
directed, or simply digraph.
5
1
1
4
2
2
3
4
5
3 4
5
6 7
The Circuit Graph : Digraph
3 10
4 9
4 8
4 7
4 2 6
4 2 5
2 4
3 3
2 1 2
1 1
e v
e v
e v
e v
e e v
e e v
e v
e v
e e v
e v
=
=
=
=
=
=
=
=
=
=
9/14/2012
5
Two-terminal and three-terminal elements
) ( ) ( ) ( t i t v t p =
+

i
v
i
1
2 2
i
1
1
2
1
i 2
i
32
v

13
v
1
i
2
i
3
i
+ 2
+
1
3
3
+
21
v

Other representations of three-terminal element

+
2
i
1
i
+
2
v
1
v
1
i
3
i
1
i
3
i
2
i
3
i
2
i
3
i
2 1 1 2
3 3
1 2 1 2
3 3
9/14/2012
6
Multiterminal elements

=
=
1
1
) ( ) ( ) (
n
k
k k
t i t v t p
Two-Ports
1
1'
2
2'
1 2
2
v
2 2 1 1
2 2
1 1
'
'
i v i v
i i
i i
=
=
=
9/14/2012
7
Multiports
+
+
+

1
' 1
2
' 2
3
' 3
3
2
1
1
' 1
Hinged Graphs
9/14/2012
8
Grounded Two-Ports
Cut Sets
Given a connected digraph, a set of
branches is called cut set iff
a) The removal of all the branches of the
cut set results in an unconnected
digraph.
b) The removal of all but any one branch
leaves the digraph connected.
9/14/2012
9
Cut Sets
i
4
5
i
6
S
2
S
1
5
i
S
i
3
7
i
1
i
3
i
4
3
2
2
S
1
1
Examples of Cut set
9/14/2012
10
Cut Set Law
For all lumped circuits, for all time t, the
algebraic sum of the currents associated
with any cut set is equal to zero.
2 3
5 6 i i
i i i
i i
4 5
1 2 3
6 7
0
3 2 1
= + + i i i
Independent KCL Equations
1
2 3
4
5
6
3
4
1 2
0
0
0
0
6 5 4
5 3 2
4 3 1
6 2 1
= +
= + +
= +
= +
i i i
i i i
i i i
i i i
9/14/2012
11
Independent KCL Equations
( )
( )
( )
( )
(
(
(
(

=
(
(
(
(
(
(
(

(
(
(
(

0
0
0
0
1 1 1 0 0 0
0 1 0 1 1 0
0 0 1 1 0 1
1 0 0 0 1 1
4
3
2
1
6
5
4
3
2
1
i
i
i
i
i
i
a
matrix A incidence the called is matrix 4x6 The
Incidence Matrix

+
=
(i) node touch not does k branch if 0
(i) node enters k branch if 1 -
(i) node leaves k branch if 1
ik
a
0 i A
a
=
If in A
a
, the incidence matrix of the connected digraph, we delete the row
Corresponding to the datum node, we obtain the reduced incidence matrix A,
which is of dimension (n-1)b. The corresponding KCL equation read
9/14/2012
12
Independence Property of KCL Equations
For any connected digraph with n nodes, the
KCL equations for any n-1 of these nodes
form a set of n-1 linearly independent
equations.
For reduced incidence matrix :
0 Ai =
Independent KVL Equations
If node (4) is used as the reference (datum
node), then
Me v
or
=
=
=
=
+ =
=
=
1 6
3 5
2 4
3 2 3
3 1 2
2 1 1
e v
e v
e v
e e v
e e v
e e v
9/14/2012
13
Independent KVL Equations
The elements of the matrix are
It can be proved that M=A
T
Thus, v=A
T
e

+
=
(i) node touch not does k branch if 0
(i) node enters k branch if 1 -
(i) node leaves k branch if 1
ki
m
Remarks
Note that, in the digraph, (a) we choose current
reference directions, (b) we choose a datum node and
define the reduced incidence matrix A, (c) we write KCL
as Ai=0, (d) then we use associated reference directions
to find that KVL reads v=A
t
e. Thus whenever we invoke
this last equation, we automatically use associated
reference directions for the branch voltages. We also
assume the same datum node is used in writing KCL
and KVL.
When we deal with digraphs which are not connected,
we could either use the concept of the hinged graph to
make the digraph connected or treat each separate part
independently. In the latter, each separate part will have
its own incidence matrix and datum node.
9/14/2012
14
Tellegen Theorem
Background
ips. relationsh specific no
have voltages and currents the that noted be should It
that verify to easy is It
KVL. obey voltages and KCL obey currents the that Note
hence
Let
hence
Let

=
=
= = =
= = =
= = =
= = =
6
1
3 2 1
6 5 4
6 5 4
3 2 1
0
1 1 2
6 5 4
4 1 3
3 2 1
k
k k
i v
v v v
v v v
i i i
i i i
9/14/2012
15
Tellegen Theorem
( )
( )
( ) ( ) 0 (Ai) e i A e i e A i v
then
e A v and 0 Ai Since
: Proof
0 i v ly equivalent or
then KVL, satisfying voltages branch of
set any be v and KCL satisfying
currents branch of set any be i Let
T
T
T T
T
T T
T
T
= = = =
= =
= =
=
=

=
b
k
k k
T
b
T
b
i v
v v v
i i i
1
2 1
2 1
0
, , ,
, , ,
L
L
Remarks on Tellegen Theorem
The only requirement of Tellegen theorem
is that the voltages and currents must
obey KVL and KCL, respectively.
No other assumptions are used. Thus,
v
T
i=0 v
T
i=0 v
T
i=0 v
T
i=0
Tellegen theorem depicts only the
interconnection properties of the circuit or
the topology of the digraph.
9/14/2012
16
Tellegen Theorem and Conservation of Energy
Tellegen theorem is much broader than
conservation energy theory because no time
restriction is used.
( )
0 ) (
) (
0 ) (
) (
0
) (
) ( 0
) (
) (
0 ) ( ) ( 0 ) ( ) (
) 0 )
2
1
1
2
1
1
1
1
2
1
2
1
1 2 2 1
1 1 2
= =
= =
= =
= =

=
= =
= =
t i
dt
t dv
t i
dt
t dv
dt
t di
t v
dt
t di
t v
t i t v t i t v
t t t
k
k
k
k
k
k
b
k
k
k
b
k
k
k
k k k k
and
and
and
Thus,
e A v( and Let Ai(
b
1 k
b
1 k
T
The Relation Between Kirchhoff Law
and Tellegen Theorem
If, for all v satisfying KVL, v
T
i=0 then i
satisfies KCL.
If, for all i satisfying KCL, v
T
i=0 then v
satisfies KVL.
9/14/2012
17
Example

=
=
= + +
= + +
N
k
k Rk Rk
N
k
Rk Rk
R v v R v v i v
i v i v i v
1
2 2 2 1 1
1
2 2 1 1
0

/ /

=
=
= + +
= + +
N
k
k Rk Rk
N
k
Rk Rk
R v v R v v i v
i v i v i v
1
2 2 2 1 1
1
2 2 1 1
0 / /
0
2 2 2 2
1
1 1
5 . 0 8 . 4

/ v R v v i v R v v
N
k
k Rk Rk
= =

=
2 2 2 2
1
1 1
6 / / v R v v i v R v v
N
k
k Rk Rk
= =

=
volts 4 . 2
5 . 0 8 . 4 6
2
2 2
=
=
v
v v
The End