Download as pdf or txt
Download as pdf or txt
You are on page 1of 63

Matrix Analysis of Networks Professor J R Lucas 1 May 2011

Matrix Analysis of Networks J. R. Lucas



Used to have a compact and neat form of solution.
- necessary to know the structure of a network, and
- formulate the problem based on the structure
Because Large networks are
- tedious to analyse using normal equations
- easier/more convenient to formulate in matrix form.

Matrix Analysis of Networks Professor J R Lucas 2 May 2011
Topology
Deals with structure of an interconnected system
Formulates the problem based on non-measurable
properties of network.
Geometric structure of the interconnection of network
elements completely characterises
number of independent loop currents
number of independent node-pair voltages
that are necessary to study the network.
Matrix Analysis of Networks Professor J R Lucas 3 May 2011
Figure 1 Structure of the network
1(a) and (b) have the same structure (or topology).
However elements are quite different.
R
1

L
1
C

(a)

(b)

Matrix Analysis of Networks Professor J R Lucas 4 May 2011
Graph of Network

Figure 2 Circuit




Figure 2
Circuit of figure 2(a) also has same topology.
Figure 2(b) shows structure corresponding to all 3
circuits.

(a) Network

(b) Graph of Network

Matrix Analysis of Networks Professor J R Lucas 5 May 2011
Does not indicate any of the elements in the networks.
Known as the graph of the network
Has all the nodes of the original network
In obtaining the graph,
each element of the network is represented by a line
each voltage source by a short-circuit
and each current source by an open circuit.
Matrix Analysis of Networks Professor J R Lucas 6 May 2011
Tree of a Network
Which of the diagrams would also represent a normal
tree (without leaves) ? and why ?




Only first diagram would fully satisfy the requirements.
Second diagram has branches closing on itself
only a tree like Nuga might appear to close on itself
Third diagram has branches in mid air not joined to main tree.
Matrix Analysis of Networks Professor J R Lucas 7 May 2011
Properties associated with trees.
1. All branches must be part of the tree
2. There cannot be closed loops formed from branches
3. There cannot be branches isolated from the tree
Same properties apply in defining a tree of a network
can be many trees associated with a given network.
need not have a trunk coming from the ground and
branches coming from the trunk.
a reduced graph of network with some of the links
removed so as to leave all the nodes connected
together by graph, but not to have any loop left.
Matrix Analysis of Networks Professor J R Lucas 8 May 2011
Possible trees for the Graph
When a tree of the network is removed from graph, what remains
is called the co-tree of the network.



Co-tree is graph of removed links compliment of the tree.
A co-tree may contain closed loops, and disconnected branches.
Graph of
Network

Some of the possible trees

Matrix Analysis of Networks Professor J R Lucas 9 May 2011
Analysis structure of network
A single branch is required to join two nodes.

Joining each additional node would require an
additional branch.


Let b = number of branches in the network
n = number of nodes in the network
l = number of independent loops
Thus number of branches in tree = n 1
number of links removed = b (n 1) = b n + 1
Node 1
Node 2
Node 1
Node 2
New Node
Matrix Analysis of Networks Professor J R Lucas 10 May 2011
Formation of Independent Loops
If any one of removed links are added to the tree, then
a new loop is formed.
number of links removed from graph to form the
tree is equal to the number of independent loops.
l = b n + 1
Oriented Graph
Numbered branches with assigned
directions to currents.
Voltage considered to increase in
direction opposite to flow of current
Oriented Graph
1

3
2
4
6
5
Matrix Analysis of Networks Professor J R Lucas 11 May 2011
Matrix Analysis of Networks
To solve circuit problems,
need to write the equations corresponding to
- Ohms Law, and
- Kirchoffs Current Law
- Kirchoffs Voltage Law
Same is true even when there are a large number of
branches.
use matrix analysis
Matrix Analysis of Networks Professor J R Lucas 12 May 2011
k

-1

-1

+1

+1

+1

0

0

i
1
i
2
i
3
i
4
i
6
i
7
i
5
Kirchoffs current Law in matrix form
For any node k
i
1
i
2
i
4
+ i
6
+ i
7
= 0
or
i
1
+ i
2
+ i
4
= i
6
+ i
7

or
i
1
+ i
2
+ i
4
i
6
i
7
= 0
or
+1 . i
1
+ 1 . i
2
+ 0 .i
3
+ 1 .i
4
+ 0 . i
5
1 .i
6
1 .i
7
= 0
Last form is preferred for matrix implementation
all currents in network are included in equation with
different coefficients.
Matrix Analysis of Networks Professor J R Lucas 13 May 2011
For computer implementation, there must be a unique
method (convention) of obtaining the coefficients a
jk
.
I
j
current in j
th
branch
j
th
branch
directed away from k
th
node: a
jk
= +1
directed towards k
th
node: a
jk
= 1
not incident on the k
th
node: a
jk
= 0
Kirchoffs current law may be written, for the k
th
node
a
1k
. i
1
+ a
2k
. i
2
+ a
3k
. i
3
+ a
4k
. i
4
+ ...... ....... ..... a
7k
. i
7
= 0
or

=
=
b
j
j jk
i a
1
0
at k
th
node, for all k
Matrix Analysis of Networks Professor J R Lucas 14 May 2011
Collection of equations, for each node k, would give

| |
) 1 (
) 1 (
) (
0

=
n
b
b
b n
I
t
A

In [A]
t
, row vectors are dependant, since sum is zero.
[A]
t
written with one row less, giving only (n-1) rows.
[A]
t
node-branch incidence matrix, (n-1)b.
[A] branch-node incidence matrix, b (n-1)
a
jk
= +1 if j
th
current is directed away from the k
th
node
a
jk
= 1 if j
th
current is directed towards the k
th
node
a
jk
= 0 if j
th
current is not incident on the k
th
node
Matrix Analysis of Networks Professor J R Lucas 15 May 2011
Kirchoffs voltage Law in matrix form

=
=
b
r
r rs
v b
1
0

for s
th
loop, for all s;
where b
rs
= 1, 0, or +1

| |
) 1 (
) 1 (
) (
0

=
l
b
b
b l
V
t
B

[B]
t
mesh-branch incidence matrix, (lb)
[B] branch-mesh incidence matrix, (bl)
b
rs
= +1 if r
th
current is in same direction as s
th
loop
b
rs
= 1 if r
th
current is in opposite direction to s
th
loop
b
rs
= 0 if r
th
current is in the not part of the s
th
loop
0
0
0
+1
-1
-1
0
-1
+1
s
0
0
0
Matrix Analysis of Networks Professor J R Lucas 16 May 2011
Ohms Law in matrix form







for all branches k = 1, 2, .... ... b
v
k
= e
gk
+ Z
k
i
gk
+ Z
k
i
k

Either voltage source or current source would normally be used.
e
gk
i
gk
Z
k
i
k
+ i
gk
i
k

v
k

Figure - General branch
Matrix Analysis of Networks Professor J R Lucas 17 May 2011
Conversion with either Thevenins Theorem or Nortons Theorem.
With a voltage source only
v
k
= e
gk
+ Z
k
i
k

for all branches k = 1, 2, ....... b
and in matrix form as

| |
b b gb b
I Z E V + =

With a current source only
i
k
= Y
k
v
k
i
gk

for all branches k = 1, 2, .... ... b
and in matrix form as

| |
b b gb b
V Y I I + =
, where [Y
b
] = [Z
b
]
-1

e
gk
Z
k
v
k

i
k

i
gk
Y
k
i
k

v
k


Matrix Analysis of Networks Professor J R Lucas 18 May 2011
I n Summary
From Kirchoffs Laws

| |
) 1 (
) 1 (
) (
0

=
n
b
b
b n
I
t
A
(1) (n-1) independent equations

| |
) 1 (
) 1 (
) (
0

=
l
b
b
b l
V
t
B
(2) l independent equations
and from Ohms Law

| |
b b gb b
I Z E V + =
(3) b independent equations
or
| |
b b gb b
V Y I I + =
(3)* b independent equations
Thus total number of independent equations is
n 1 + l + b = b + b = 2 b
Matrix Analysis of Networks Professor J R Lucas 19 May 2011
2b independent equations
2b unknowns (b branch currents and b branch voltages)
Can be solved.
Not usual to solve for both current and voltage
simultaneously.
Reductions can be done in two ways.
1) Eliminate voltages and solve for currents
mesh analysis
2) Eliminate currents and solve for voltages.
nodal analysis.
Matrix Analysis of Networks Professor J R Lucas 20 May 2011
Mesh Analysis
Eliminate the branch voltages from the equations.
Reduce remaining currents to a minimum using
Kirchoffs current law.
Apply Kirchoffs voltage law for solution.
Define a set of mesh currents,
m
I
.
Branch currents
b
I
related to mesh currents
m
I
by an
algebraic summation.

| |
m b
I B I =
(4)
Eliminate V
b
from the equations,
Matrix Analysis of Networks Professor J R Lucas 21 May 2011
Pre-multiply equation (3) by [B]
t
.

| | | | | | | |
b b
t
gb
t
b
t
I Z B E B V B + =

from equation (2), [B]
t
V
b
= 0.
Also
| |
m b
I B I =


| | | | | || |
m b
t
gb
t
I B Z B E B =

[B]
t
V
b
= 0 sum of voltages around a loop is zero.
i.e. [B]
t
V
b
sum of voltages around a loop.
[B]
t
E
gb
sum of source voltages around a loop.
Defined as mesh source voltage vector E
gm
.
Matrix Analysis of Networks Professor J R Lucas 22 May 2011
i.e. E
gm
=

[B]
t
E
gb

E
gm
=
| | | || | | |
m m m b
t
I Z I B Z B =

where [Z
m
] =
| | | || | B Z B
b
t
corresponds to l equations
[B] also known as the tie-set matrix
(as its elements tie the loop together)
Unknowns are l values of current I
m

Original 2b equations and 2b unknowns reduced to
l equations and l unknowns.
Elements of [Z
m
] can be obtained either from above
mathematics, or by inspection as follows.
Matrix Analysis of Networks Professor J R Lucas 23 May 2011
Simple evaluation of [Z
m
] and E
gm

z
jj
= self impedance of mesh j
= sum of all branch impedances in mesh j
z
jk
= mutual impedance between mesh j and mesh k
= sum of all branch impedances common to mesh j
and mesh k and traversed in mesh direction
sum of all branch impedances common to mesh
j and mesh k, and traversed in opposite direction
e
j
= algebraic sum of the branch voltage sources in
mesh j in mesh direction.

Matrix Analysis of Networks Professor J R Lucas 24 May 2011
Example 1





Solve the circuit using Mesh matrix analysis.
Work from first principles.
Solution
Number the branches and the loops.
j6 O
E
1

100Z0
0

V
j20 O
-j120 O

E
2

100Z30
0
V
10 O
20 O
10 O
Matrix Analysis of Networks Professor J R Lucas 25 May 2011





Write the loop currents in terms of the branch currents.
i
1
= I
1

i
2
= I
3
i
3
= I
1
I
2

i
4
= I
2

i
5
= I
2
I
3

i
6
= I
3
or in matrix form


(
(
(

(
(
(
(
(
(
(
(


=
(
(
(
(
(
(
(
(

3
2
1
6
5
4
3
2
1
1 0 0
1 1 0
0 1 0
0 1 1
1 0 0
0 0 1
I
I
I
i
i
i
i
i
i
I
1
I
2
I
3
i
1
i
4
i
3
i
5
i
6
i
2
E
1

100Z0
0

V
j20 O
j6 O
j120 O

E
2

100Z36.87
0

10 O
20 O
10 O
Matrix Analysis of Networks Professor J R Lucas 26 May 2011

This gives the Branch-Mesh incidence matrix [B].
MeshBranch incidence matrix [B]
t
can also
independently by writing the relation between the
mesh direction and the branch direction.



| |
(
(
(


=
1 1 0 0 1 0
0 1 1 1 0 0
0 0 0 1 0 1
t
B

Notice that this corresponds to the transpose of the
earlier written matrix.

Matrix Analysis of Networks Professor J R Lucas 27 May 2011


Vector of branch source voltages is

Branch impedance matrix is

| |
(
(
(
(
(
(
(
(

=
6 0 0 0 0 0
0 10 0 0 0 0
0 0 20 0 0 0
0 0 0 120 0 0
0 0 0 0 10 0
0 0 0 0 0 20
j
j
j
Z
b

(
(
(
(
(
(
(
(

Z
Z
=
0
0
0
0
87 . 36 100
0 100
0
0
gb
E
Matrix Analysis of Networks Professor J R Lucas 28 May 2011
E
gm
= [B]
t
E
gb
, and [Z
m
] = [B]
t
[Z
b
] [B]
(
(
(
(
(
(
(
(

Z
Z
(
(
(


=
0
0
0
0
87 . 36 100
0 100
1 1 0 0 1 0
0 1 1 1 0 0
0 0 0 1 0 1
0
0
gm
E
,
E
gm
=
(
(
(

Z
Z
0
0
87 . 36 100
0
0 100

| |
(
(
(
(
(
(
(
(


(
(
(
(
(
(
(
(

(
(
(


=
1 0 0
1 1 0
0 1 0
0 1 1
1 0 0
0 0 1
6 0 0 0 0 0
0 10 0 0 0 0
0 0 20 0 0 0
0 0 0 120 0 0
0 0 0 0 10 0
0 0 0 0 0 20
1 1 0 0 1 0
0 1 1 1 0 0
0 0 0 1 0 1
j
j
j
Z
m

Matrix Analysis of Networks Professor J R Lucas 29 May 2011
| |
(
(
(
(
(
(
(
(


(
(
(


=
6 0 0
10 10 0
0 20 0
0 120 120
10 0 0
0 0 20
1 1 0 0 1 0
0 1 1 1 0 0
0 0 0 1 0 1
j
j j
j
Z
m
=
(
(
(

6 20 10 0
10 120 30 120
0 120 100
j
j j
j j

Both E
gm
and Z
m
could have been written by inspection.
Thus
(
(
(

Z
Z
0
0
87 . 36 100
0
0 100
=
(
(
(

(
(
(

3
2
1
6 20 10 0
10 120 30 120
0 120 100
I
I
I
j
j j
j j

Equations may be solved by inversion or otherwise.
Matrix Analysis of Networks Professor J R Lucas 30 May 2011
(
(
(

Z
Z
(
(
(


+ +
+ +
A
=
(
(
(

0
0
2
2
3
2
1
87 . 36 100
0
0 100
) 120 ( ) 120 30 ( 100 10 100 10 120
10 100 ) 6 20 ( 100 ) 6 20 ( 120
10 120 ) 6 20 ( 120 10 ) 6 20 )( 120 30 (
1
j j j j j
j j j j j
j j j j j
I
I
I
(
(
(

(
(
(

+
+ +
+
A
=
(
(
(

60 80
0
100
14400 12000 3000 1000 1200
1000 600 2000 720 2400
1200 720 2400 2220 1220
1
3
2
1
j j j j
j j j
j j j j
I
I
I
A = (1220 j2220)(j100) + (720 j2400) (j120) + (j1200) 0
= j122000 222000 + j 86400 + 288000
= 66000 j 35600 = 74989Z-28.34
o
I
1
= (122000 j 222000 + 0 + j 96000 72000)/74989Z-28.34
o
= (50000 j 126000)/ 74989Z-28.34
o

= 135558Z-68.36
o
/74989Z-28.34
o
= 1.808Z-40.02
o
A
[Note: Inversion has not been checked so answers may be in error.]
Currents I
2
and I
3
can be similarly determined.
The branch currents i
1
, i
2
, ..... may then be determined from the matrix equation.
[Normally branch 6 would have been marked as part of branch 2]
Matrix Analysis of Networks Professor J R Lucas 31 May 2011
Nodal Analysis
eliminate branch currents from the equations.
Reduce number of remaining voltages to a minimum
using Kirchoffs voltage law.
Apply Kirchoffs current law for solution.
Define a set of nodal voltages,
N
V
which are node pair
voltages (i.e. voltage across a pair of nodes)
Branch voltages
b
V
are related to nodal voltages
N
V
by
an algebraic summation.

| |
N b
V A V =
(5)
[A] too does not have the reference node.
Matrix Analysis of Networks Professor J R Lucas 32 May 2011
Pre-multiply equation (3)* by [A]
t
.

| | | | | | | |
b b
t
gb
t
b
t
V Y A I A I A + =

from equation (1), [A]
t
I
b
= 0 .
Substituting from (5)

| | | | | || |
N b
t
gb
t
V A Y A I A + = 0


| | | | | || |
N b
t
gb
t
V A Y A I A =

I
gN
= [Y
N
]V
N
where
| |
gb
t
gN
I A I =
, and

| | | | | || | A Y A Y
b
t
N
=

Matrix Analysis of Networks Professor J R Lucas 33 May 2011
Source nodal current vector I
gN
and the nodal
admittance matrix [Y
N
] could be written by inspection.
y
ii
= sum of all branch admittances incident at node i
y
ij
= negative of the sum of all branch admittances
connecting node i and node j .
Reason for negative sign can be understood as follows:
i
k
= y
k
v
k
= y
k
(V
i
V
j
)
At any node i,
injected current I
gi
= E i
k
= E y
k
(V
i
V
j
)


=
=
=
=
=
N
i j
j
j k
N
i j
j
i k gi
V y V y I
1 1
for all j
v
k
j

i

y
k
i
k
Matrix Analysis of Networks Professor J R Lucas 34 May 2011
Since V
i
is a constant for a given i,


=
=
=
=
=
=
=
=
+
|
|
|
.
|

\
|
= =
N
i j
j
j k i
N
i j
j
k
N
i j
j
j k
N
i j
j
k i gi
V y V y V y y V I
1
)
1 1 1
(



=
=
=
= + =
N
j
j ii
N
i j
j
j ii i ii gi
V y V y V y I
1 1
corresponds to nodal equation
As in the case of mesh analysis,
I
gN
= [Y
N
]V
N

is first solved to give V
N
and the branch voltages
and branch currents then obtained using the matrix equations.
Matrix Analysis of Networks Professor J R Lucas 35 May 2011
Example 2





Example 1 has been reformulated as a problem with
current sources rather than with voltage sources.
[If voltage sources are present, they would first have to
be converted to current sources].
5Z-90
0
A
j20 O
j6 O
-j120 O

8.575Z5.91
0
A
10 O
20 O
10 O
i
1
i
4

i
3

i
5

i
2

V
1
V
2
Matrix Analysis of Networks Professor J R Lucas 36 May 2011
Network may also be drawn in terms of admittances.
The branch-node incidence matrix [A],
branch injected current I
gb
, and
branch admittance matrix may be written,
with reference selected as earthed node as follows.
5Z-90
0
A
-j0.05
S
0.0735 j
0.0441 S
j0.00833
S

8.575Z5.91
0
A
0.1 S
0.05
S
i
1
i
4
i
3
i
5
i
2
V
1
V
2
Matrix Analysis of Networks Professor J R Lucas 37 May 2011
| |
(
(
(
(
(
(

=
1 0
1 1
0 1
1 0
0 1
A
, I
gb
=
(
(
(
(
(
(

Z
Z
0
0
0
91 . 5 575 . 8
90 5
o
o
,
| |
(
(
(
(
(
(

=
1 . 0 0 0 0 0
0 05 . 0 0 0 0
0 0 008333 . 0 0 0
0 0 0 0441 . 0 0735 . 0 0
0 0 0 0 05 . 0
j
j
j
Y
b

As in mesh analysis, nodal current injection vector and nodal
admittance matrix may be written from first principles.
Left as an exercise for you to work out.
Matrix Analysis of Networks Professor J R Lucas 38 May 2011
This is worked by inspection.
| | | |
(

+ +
+ +
=
(

Z
Z
=
0441 . 0 0735 . 0 1 . 0 05 . 0 05 . 0
05 . 0 05 . 0 00833 . 0 05 . 0
,
91 . 5 575 . 8
90 5
j
j j
Y I
N
o
o
gN

(

+ +
+ +
=
(

Z
Z

2
1
0441 . 0 0735 . 0 1 . 0 05 . 0 05 . 0
05 . 0 05 . 0 00833 . 0 05 . 0
91 . 5 575 . 8
90 5
V
V
j
j j
o
o

(

Z
Z
(

+ +
+ +
A
=
(

o
o
j j
j
V
V
91 . 5 575 . 8
90 5
05 . 0 00833 . 0 05 . 0 05 . 0
05 . 0 0441 . 0 0735 . 0 1 . 0 05 . 0
1
2
1

A = (j0.05+j0.00833+0.05)(0.05+0.1+0.0735j0.0441) 0.05
2

= (0.05 j 0.04167)(0.2235 j 0.0441) 0.0025
= 0.06509Z-39.81
o
0.2278Z-11.16
o
0.0025
= 0.01483Z-50.97 0.0025
= 0.00934 0.0025 j 0.01152 = 0.00684 j 0.01152
= 0.0134Z-59.30
o

Matrix Analysis of Networks Professor J R Lucas 39 May 2011
V
1
= (0.2278Z-11.16
o
5Z-90
o
+0.058.575Z5.91
o
)/0.0134Z-59.3
o

= ( 0.2205 j 1.1175 + 0.4265 + j 0.04415) /0.0134Z-59.30
o

= (0.2060 j 1.0733)/0.0134Z-59.30
o

= 1.093Z-79.14
o
/0.0134Z-59.30
o

V
1
= 81.6Z-19.84
o
V
branch current i
1
=
20
68 . 27 3 . 23
20
84 . 19 6 . 81 100
j
j
j
o
+
=
Z

i
1

A j
o
09 . 40 809 . 1 165 . 1 384 . 1 Z = =

which is the same answer (to calculation accuracy) that
was obtained in example 1.

Matrix Analysis of Networks Professor J R Lucas 40 May 2011
Conversion of Ideal sources
(a) Ideal Voltage sources
No impedance directly in series with voltage source





Ideal voltage sources are distributed to branches
connected to one of the nodes of original ideal source.
E

E

E

E

E

E


or

Z
1
Z
3
Z
2
Z
5
Z
4
Z
1
Z
3
Z
2
Z
5
Z
4
Z
1
Z
3
Z
2
Z
5
Z
4
Matrix Analysis of Networks Professor J R Lucas 41 May 2011
(b) Ideal Current sources
No admittance appears directly in parallel with current source
Ideal current source has been distributed around a loop
connecting the two points of original source.


I
s
I
s
I
s
I
s
Matrix Analysis of Networks Professor J R Lucas 42 May 2011
Port
Pair of nodes across which a device can be connected.
Voltage is measured across the pair of nodes.
Current going into one node is the same as the current
coming out of the other node in the pair.
These pairs are entry (or exit) points of the network.
Compare with an Airport or a Sea Port.
Entry and exit points to a
country.
Planes that enter at a given port
are the ones that take off from

Matrix Analysis of Networks Professor J R Lucas 43 May 2011
same port.
Matrix Analysis of Networks Professor J R Lucas 44 May 2011
Two-Port Theory
Convenient to develop special methods for systematic
treatment of networks.
Single-port linear active networks
Thevenins or Nortons equivalent circuit.
Linear passive networks
Convenient to study behaviour relative to a pair of
designated ports.



Linear
Passive
Network
I
1
I
2
V
1
V
2
Port 1

Port 2

Matrix Analysis of Networks Professor J R Lucas 45 May 2011
Definitions
Driving point impedance is defined as ratio of applied
voltage (driving point voltage) across a node-pair to
the current entering at the same port.
[input impedance of network seen from particular port]
Driving point impedance at Port 1 = V
1
/I
1

Driving point impedance at Port 2 = V
2
/I
2

Driving point admittance is similarly defined as the
ratio of the current entering at a port to the applied
voltage across the same node-pair.
Driving point admittance at Port 1 = I
1
/V
1

Driving point admittance at Port 2 = I
2
/V
2

Matrix Analysis of Networks Professor J R Lucas 46 May 2011
I mmittance is sometimes used to represent either an
impedance or an admittance
Transfer impedance is defined as the ratio of the
applied voltage across a node-pair to the current
entering at the other port.
Transfer impedance = V
1
/I
2
, V
2
/I
1

Transfer admittance is similarly defined as the ratio of
the current entering at a port to the voltage appearing
across the other node-pair.
Transfer admittance = I
1
/V
2
, I
2
/V
1

Matrix Analysis of Networks Professor J R Lucas 47 May 2011
Transfer Voltage gain (or ratio) is defined as the ratio
of the voltage at a node pair to the voltage appearing at
the other node-pair.
Transfer voltage gain = V
1
/V
2
, V
2
/V
1

Transfer Current gain (or ratio) is similarly defined
as the ratio of the current at a port to the current at the
other port.
Transfer current gain = I
1
/I
2
, I
2
/I
1


Matrix Analysis of Networks Professor J R Lucas 48 May 2011
Common Two-port parameters
External conditions of a two-port network can be
completely defined by currents and voltages at the 2 ports.
A general two port network can be characterised by four
parameters, derived from the network elements.
With symmetry, number of parameters will be reduced.
(a) Impedance parameters
(b) Admittance parameters
(c) Transmission Line parameters
(d) Hybrid parameters.

Matrix Analysis of Networks Professor J R Lucas 49 May 2011
(a) Impedance Parameters (z-parameters)
or Open-circuit parameters





(

=
(

2
1
22 21
12 11
2
1
I
I
z z
z z
V
V

V
1
= z
11
I
1
+ z
12
I
2

If I
2
= 0, then z
11
= V
1
/I
1
If I
1
= 0, then z
12
= V
1
/I
2
Linear
Passive
Network
I
1
I
2
V
1
V
2
Port 1

Port 2

Matrix Analysis of Networks Professor J R Lucas 50 May 2011
It follows that,

0
2 1
1
11
=
=
I I
V
z
,
0
1 2
1
12
=
=
I I
V
z
,

0
2 1
2
21
=
=
I I
V
z
,
0
1 2
2
22
=
=
I I
V
z
.
z-parameters correspond to the driving point and
transfer impedances at each port with the other port
having zero current (i.e. open circuit).
open circuit parameters.
Matrix Analysis of Networks Professor J R Lucas 51 May 2011
Example 3
Find impedance parameters of the two port T network.
With port 2 on open circuit
b a
Z Z
I I
V
z + =
=
=
0
2 1
1
11

b
Z
I I
V
z =
=
=
0
2 1
2
21

similarly with port 1 open,
z
12
= Z
b

z
22
= Z
b
+ Z
c


I
1
I
2
V
1
V
2
Port 1

Port 2

Z
a
Z
c
Z
b
| |
(

+
+
=
c b b
b b a
Z Z Z
Z Z Z
Z

Matrix Analysis of Networks Professor J R Lucas 52 May 2011
(b) Admittance Parameters (y-parameters)
or Short-circuit parameters







(

=
(

2
1
22 21
12 11
2
1
V
V
y y
y y
I
I

y
11
,

y
12
, y
21
, y
22
defined with either V
1
or V
2
zero.
y-parameters correspond to driving point and transfer
admittances at each port with the other port having zero
voltage (i.e. short circuit) short circuit parameters.
Linear
Passive
Network
I
1
I
2
V
1
V
2
Port 1

Port 2

Matrix Analysis of Networks Professor J R Lucas 53 May 2011
Matrix Analysis of Networks Professor J R Lucas 54 May 2011
Example 4
Find admittance parameters of the 2 port tnetwork.






y
11
=
0
2 1
1
= V V
I
= Y
a
+ Y
b

y
21
=
0
2 1
2
= V V
I
= Y
b

I
1
I
2
V
1
V
2
Y
b
Y
a
Y
c
I
1
I
2
V
1
V
2
=0
Y
b
Y
a
Y
c
with port 2 on short circuit
[Y] =
(

+
+
c b b
b b a
Y Y Y
Y Y Y

Matrix Analysis of Networks Professor J R Lucas 55 May 2011
(c) Transmission Line Parameters (ABCD-parameters)







Parameters can be defined using either port 2 on short
circuit or port 2 on open circuit.
In case of symmetrical system, parameter A = D.
For a reciprocal system, A.D B.C = 1
Linear
Passive
Network
I
1
I
2
V
1
V
2
Port 1

Port 2

(

=
(

2
2
1
1
I
V
D C
B A
I
V
Matrix Analysis of Networks Professor J R Lucas 56 May 2011
Example 5
Find ABCD parameters.
A =
c
c b
Y
Y Y +
, B =
c
Y
1

C =
c
a c c b b a
Y
Y Y Y Y Y Y + +

and D =
c
c a
Y
Y Y +
[For symmetrical network, Y
a
= Y
b
, A = D].
A.D B.C =
c
a c c b b a
c c
c a
c
c b
Y
Y Y Y Y Y Y
Y Y
Y Y
Y
Y Y + +

+

+ 1

=
2
2
) (
c
a c c b b a c c b a c a b
Y
Y Y Y Y Y Y Y Y Y Y Y Y Y + + + + +
=1
I
1
I
2
V
1
V
2

Y
c
Y
a
Y
b
Matrix Analysis of Networks Professor J R Lucas 57 May 2011
(d)
Hybrid Parameters (h-parameters)




Linear
Passive
Network
I
1
I
2
V
1
V
2
Port 1

Port 2

Matrix Analysis of Networks Professor J R Lucas 58 May 2011
The hybrid parameter matrix may be written as
(

=
(

2
1
22 21
12 11
2
1
V
I
h h
h h
I
V

h-parameters can be defined as in other examples, and
are commonly used in some electronic circuit analysis.
Matrix Analysis of Networks Professor J R Lucas 59 May 2011
Interconnection of two-port networks
(a) Series connection of two-port networks
Series properties are applied to each port
at port 1, I
r1
= I
s1
= I
1
, and V
r1
+ V
s1
= V
1

at port 2 I
r2
= I
s2
= I
2
, and V
r2
+ V
s2
= V
2

[Z] = [Z
r
] + [Z
s
]
Linear
Passive
Network
r
I
r1
I
r2
V
r1
V
r2
Port r
1
Port r
2
Linear
Passive
Network
s
I
s1
I
s2
V
s1
V
s2
Port s
1
Port s
2
V
2
V
1
Matrix Analysis of Networks Professor J R Lucas 60 May 2011
(b) Parallel connection of two-port networks
at port 1, I
r1
+ I
s1
= I
1
, and V
r1
= V
s1
= V
1

at port 2, I
r2
+ I
s2
= I
2
, and V
r2
= V
s2
= V
2

[Y] = [Y
r
] + [Y
s
]
Linear
Passive
Network
r
I
r1
I
r2
V
r1
V
r2
Linear
Passive
Network
s
I
s1
I
s2
V
s1
V
s2
V
2
V
1
I
1
I
2
Matrix Analysis of Networks Professor J R Lucas 61 May 2011
(c) Cascade connection of networks
Output of one network becomes input to next.
I
r2
= I
s1

V
r2
= V
s1




(

=
(

2
2
1
1
r
r
r r
r r
r
r
I
V
D C
B A
I
V
,
(

=
(

2
2
1
1
s
s
s s
s s
s
s
I
V
D C
B A
I
V


(

=
(

2
2
1
1
I
V
D C
B A
D C
B A
I
V
s s
s s
r r
r r

Linear
Passive
Network
I
s1
I
s2
V
s1
V
s2
Port s1

Port s2

Linear
Passive
Network
I
r1
I
r2
V
r1
V
r2
Port r1

Port r2

Matrix Analysis of Networks Professor J R Lucas 62 May 2011
ABCD matrix of component networks




A =
0
2 2
1
= I V
V
= 1, = 1
B =
0
2 2
1
= V I
V
= Z, = 0
C =
0
2 2
1
= I V
I
= 0, =Y
D =
0
2 2
1
= V I
I
= 1, = 1
V
1
V
2
I
1
I
2
Z

V
1 V
2
I
1
I
2
Y

Matrix Analysis of Networks Professor J R Lucas 63 May 2011
In matrix form

(

D C
B A
=
(

1 0
1 Z
, =
(

1
0 1
Y

Consider example 5 again





(

D C
B A
=
(

1
0 1
a
Y

(
(

1 0
1
1
b
Y

(

1
0 1
c
Y

Simplification of matrix product would give the same answer as in example 5.
I
1
I
2
V
1
V
2

Y
b
Y
a
Y
c


Y
b
Y
a
Y
c

You might also like