Network Notes
Network Notes
The fundamental laws that govern electric circuits are the Ohm’s Law and the Kirchoff’s
Laws.
Ohm’s Law
* Ohm’s Law states that the voltage v(t) across a resistor R is directly proportional
to the current I(t) flowing through it. R I(t)
►
v(t) ∝ I(t) or v(t) = R.I(t) ►
v(t)
KIRCHOFF’S CURRENT LAW (KCL)
* Kirchoff’s current law states that in a node, sum of entering current is equal sum
of leaving current. i.e., ∑ I at junction point = 0
* The theorem is applicable not only to a node, but to a closed system.
I 1 + I2 - I 3 + I4 - I 5 = 0 Id Ie
I5 I1
►
►
I 1 + I 2 + I 4 = I3 + I 5
►
I4
►
►
► ►
I3
►
Ia - Ib + Ic - Id - Ie = 0
►
Ic ► ►
►
Ib
►
* Kirchoff’s voltage law states that the algebraic sum of the voltages around any
closed path is zero. ►
Vd
Where V are the voltages across the branches in ►
► Ve
►
the loop. Vc
►
loop
►
v a + v b+ v c + vd - ve = 0 ► ►
►
Vb Va
Superposition Theorem
►
Page -1
* Let us first take the source V1 alone I′1 I′2
► ►
at first replacing V2 by short circuit. r1 r2
____ V1
Here, I′1 = r2 r V1 +
_ r3
____3
r2 + r3 + r1 I′3
►
r3
____
I′2 = I′1 r + r and I′3 = I′1 - I′2
2 3 I″1 I″2
► ►
►
let the circuit be energized by V2 only.
r3 +_ V2
____ V2
Here, I″2 = r r
____
1 3
r1 + r3 + r2
r3
____
and I″1 = I″2 r1 + r 3 I″3 = I2″ - I1
* Any two terminal bilateral linear d.c. circuit can be replaced by an equivalen
circuit consisting of a voltage source and a series resistor. r2
* Let us consider a simple d.c. circuit as r1
shown in figure (a). We find I1 by
Thevenin’s Theorem.
Vs +_ r3 I1 rL
►
Figure (a)
* Find the equivalent voltage source then r2
r1 is removed figure (b) and VO.C is r1
+
►
calculated
Vs
VO.C = Ir3 = ____ .r3 .... (i) Vs +
_ I r3 VO.C
r1 + r3 ►
_
►
Figure (b)
Page -2
r1 r2
. Now to find the internal resistance of
the network . as shown in figure (c)
r1r3 .....(ii) Rth
Rth = r2 + r3
r1 + r3
Figure (c)
. As per Thevenin’s Theorem, the Source networks
equivalent circuit being figure (d).
Rth
From equation (i) and (ii)
VOC +
_ VOC rL IL
I1 = Amp.
RTh + rL
Figure (d)
Norton’s Theorem
A linear active network consisting of independent and or dependent voltage and
current source and linear bilateral network elements can be replaced by an equi-
valent circuit consisting of a current source in parallel with a resistance, the
current source being the short circuited current across the load terminal and the
resistance being the internal resistance of the source network looking through
the open circuited load terminals.
r1 r2
A simple d.c. network
+
_ Vs r3 IL rL
I
r1 r2
. Figure (a)
+
_ Vs r3 IS.C S.C ____ Vs
I = r 2 r3
►
____
r1 + r + r
2 3
____r3
Figure (b) Finding of I S.C and IS.C = I r +r
3 2
. r1 r2
* R int (Internal Resistance) is
Rint
r1 r3 r3 ►
Rint = r2 + ____
r1 + r3
►
* To find load current I L is
-------------------
-------------------
Rint IL rL
►
Rint
____ IS.C
►
I L = IS.C
Rint + rL
------------------------
Figure (d) Norton’s equivalent circuit
Maximum Power Transfer Theorem
►
-------------------
-------------------
While the power delivered to the resistive Rth
load is +
( )
_ V0
►
V0
____ 2 RL
PL = I²RL = × RL ... (ii)
Rth + R L
PL can be maximised by varying R L and ------------------------ Y
Figure (a)
hence, maximum power can be delivered
dPL
____
when = 0
dRL
dPL
____
dRL =
____ 1
[(R th+ R L)²]²
V²0 (Rth - RL )
[
(Rth+ R L)²
d (V² R ) -V ²R ____
____
dRL
0 L 0 L
d (R + R )²
dRL
th L ]
____
(Rth + RL )³ = 0 then (Rth - R L ) = 0
* This theorem states that the algebraic sum of power delivered to each branch
of any electric network is zero. n
∑ VKIK = 0
K=1
Where,
n = No. of branches of network
VK = Voltage across Kth branch
I K = Current in Kth branch
Page -5
Wye (Star) to Delta Tranformation
A
RAB RARB + RB RC+ RCRA
= ____ A
RC RA RAB
or
RB
O
RC
⇒ RCA
B C
RARB RBC
RAB = RA+ R B + ____ B C
Similarly RC
RBRC + RCRA + RARB RBRC
R BC = ____ or R BC = R B+ R C+ ____
RA RA
RCRA + RARB + RB RC R CRA
and R CA = ____ or RCA = R A + R C + ____
RB RB
Page -6
NETWORK ELEMENTS AND GRAPHS
Sources
Resistance (R)
Graph Theory
A graph of any network can be drawn by placing all the nodes which are points of
intersection of more than two branches. Consider a network given below:
L
1 2 2
3 1 3
C1 C2
R1 R2 R3
4
4
Given network Graph of the given network
* Terminology used in network graph.
* Branch: A branch is a line segment representing one network element.
* Node: A node point is defined as an end point of a line segment and exists
at the junction between two branches.
* Tree: It is an interconnected open set of branches which include all the
nodes of the given graph. In a tree of the graph there cannot be any closed
loop. a
►
2 b 2 c
1 3 3
►
► ► 1
►
►
b c Corresponding
d tree d
►
►
►
e f
►
4 4
Given graph Tree
Simple graph and tree
* In the above figure branches b, c, d are called twig while the branches a, e, f,
are called links.
* Twig: Any branch of a tree is called twig.
Twig = n - 1 where, n = no. of nodes
4
* All the components are replaced by a line segment so a graph is obtained.
2
1 3
Connected graph
4
* This type of graph is called connected graph.
* If components are separate then this is called not connected graph or
unconnected graph.
⇒ Unconnected
graph
* If directions are shown in any graph then this is called directed graph.
2
1 ► ► 3
►
Directed graph
►
4
* Now we see the direction or load set of a reference.
Loop
If we start from any node and come back to the same node then this path is called
loop.
* In loop we doesn’t see the direction of graph.
* In loop, the branches may be present inside the loop.
Mesh
►
abd is both loop and mesh.
►
e
►
b
4
Complete Incidence Matrix f
►
►
node then we place 0 in it.
►
e
►
* If the branch is connected to any node then
we see the direction. 4
* For incoming at any node ⇒ -1. * For outgoing at any node ⇒ +1.
So, Nodes Branches →
↓ a b c d e f
[ ]
1 1 1 0 0 0 1
2 0 -1 -1 -1 0 0
3 0 0 0 1 1 -1
4 -1 0 1 0 -1 0 (n × b)
Sum 0 0 0 0 0 0
If we remove any row from complete incidence matrix then this matrix is called
reduced incidence matrix.
* Obviously this is of the order of (n - 1) × b.
Nodes Branches →
↓ a b c d e f
1 1
2 0
3 0[ 1
-1
0
0
-1
0
0
-1
1
0
0
1
1
0
]
-1 (n - 1) × b
f
Fundamental Cut Set of a Graph ►
2
1 3
►
►
Cut-set of a graph which exactly cut the graph b d
into two parts, with the restriction that by c
►
a e
►
►
►
c
►
e
4
* (a, b, f, c) this is not a cut set
d
►
►
e
This is a cut set which contains exactly one twig. (Not more than one or not less
than 1).
Let the tree is ►
►
f 1 = (a, b, f) b d
c
►
f 2 = (d, e, f)
f 3 = (a, c, e)
So number of fundamental cut set should be (n - 1)
* For the matrix with fundamental cut set we take the reference direction as
the direction of twig (+1).
Nodes Branches →
↓ a b c d e f
Sum
[
f1 1
f2 0
f 3 -1
0
1
0
0
1
0
0
1
1
0
1
0
1
0
-1
1
0
1
-1
0 (n - 1) b
0
]
* In the matrix of fundamental cut set column with only (+1) entry will be twig
and other will be link.
* Loop: This is the dual of cut-set.
duality
loop ⇔ cut-set
►
Fundamental Loop (Tie-Set) Matrix e
►
►
b d
Loop in which only one link will be present.
* For fundamental-loop we take the direction of c f
►
►
a
►
Page -7
So fundamental loops are
b► d
►
-- c
--
►
-- c c
--
►
►
►
-- ►
►
a f
--
►
-- b d
--
--
--
(1) (2) (3)
Number of fundamental loop = Number of links = b - n + 1
Loops Branches →
↓ a b c d e f
*
l1 1
l2 0
l3 0
[
-1
0
1
-1
1
0
0
1
-1
0
0
1
0
1
0 l b
Column with one entry will be link and others are twig.
]
* Number of equations with variables N - 1 = twigs
* For example let twig are the voltage variable
* Links are the shunt variable.
Mesh Analysis
Z5
Mesh Analysis
In Mesh-I
I 1 Z 1+ (I 1 - I2 )Z3 - V1 = 0 ∴ (Z1 + Z 3)I1 + (-Z 3 )I 2 + 0I3 = V1 ...(i)
In Mesh - II
(I2 - I1 )Z3 + I 2 Z2 + (I2 - I 3) Z4 + I2 Z5 = 0
(-Z 3 ) I 1 + (Z2 + Z 3 + Z4 + Z 5 ) I 2 + (-Z 4) I 3 = 0 ... (ii)
In Mesh - II
(I3 - I 2 ) Z4 + I3 Z 6 + (V2 ) = 0
(0) I1 + (-Z4 ) I 2 + (Z 4 + Z6 ) I3 = -V2 .....(iii)
-V2
][ ] [ ]
Writing the elements of the matrix.
[
Z11 Z12 ... Z1m I1 V1
Z21 Z 22 ... Z2m I 2 = V2
...
...
...
...
...
...
I1 I3 I2 I4 ►
►
►
V1 I5
1 Y
►
[Y1 + Y2 + Y3
Y2
-Y2
Y2 + Y4 + Y5 ] [ ] []
V1
V2
=
I
0
By cramer’s rule __
1 1 -Y2 1 Y1 + Y2 + Y3
__ 1
∴ V1 = ∆ 0 Y2 + Y4 + Y5 V2 =
∆ -Y2 0
Y1 + Y2 + Y3 -Y2
where ∆ =
-Y2 Y2 + Y4 + Y5
Generalised node equations can be written as [Y][V] = [I]
Square matrix Y is called the admittance matrix,
V is the column matrix of the node voltages with respect to reference node
and I is the column matrix of input currents.
The elements Yij , i = 1, 2, .... m, j = 1, 2, .... m of the admittance matrix Y are
(i) Yij , the self admittance of the ith node.
(ii) Yij , the mutual admittance between the i th and jth node of negative sign.
[ Y11
Y21
Y12
Y22
...
...
Y1n
Y2n
][ ] [ ]
V1
V2
=
I1
I2
...
...
...
...
...
...
Page -10
One Port and Two Port Network Function
I1 I2
+ 1 ►
Two port ◄ 2 +
V1 V2
_ 1' Network
2" _
V1 V2
Ro
V1 + Ro I2 = 0
V2 = Ro I1
0 -α i1 V1
___
___
___
___
___
___
• Matrix form =
α 0 i2 V2
• If the gyrator is terminated in an impedance ZL , the driving point impedance
Z11 ZL + ∆Z ; Zin = (α²/ZL)
Zd = _________
Z22 + ZL
• If ZL is capacitor, then ZL = (1/sC)
Zin = sCα² give inductor of value = α²C
• If ZL is an inductor ZL = sL
Zin = (α²/sL) gives capacitor of value = (L/α²)
• Used to simulate inductor from capacitor.
Z or Impedance Parameters
In this, the dependent variables are V1 and V2 and independent variable I1 and
I2 .
Defining equations are :
V1 = Z11 I1 + Z12 I2
V2 = Z21 I1 + Z22 I2
In Impedance Matrix Form
V1
= Z11 Z12 I1
___
___
___
___
___
___
V2 Z21 Z22 I2
• To obtain the Z-parameters, we open circuit the output and input port
alternately.
• With output open circuit I2 = 0
V1 = Z11 I1
or Z11 = ___
V1
___
= input impedance
I1 I2 = 0
V2 = Z21 I1
or Z21 = ___
V2
___
= output impedance
I2 I1 = 0
I1 Zd ZB I2
+ +
V1 Zc V2
_ _
ZA + ZC ZC
Z=
ZC ZB + ZC
Property of Z-parameter
• Z11 , Z22 are called driving point input and output impedance function.
• Z12 and Z21 are called transfer function.
• Network for which Z11 = Z22 called as symmetrical.
• Network for which Z12 = Z21 are known as reciprocal network.
• Reciprocal network need not be symmetrical.
Y or Admittance Parameter
• Also known as admittance parameter.
• Independent variables are voltage V1 , V2 and dependent variable current I1 ,
I2 .
• I1 = Y11 V1 + Y12 V2
I2 = Y21 V1 + Y22 V2
• Admittance in matrix form
Y11 Y12
Y=
Y21 Y22
• For reciprocal Y12 = Y21
Symmetric
A two port is symmetric if port can be interchanged, without any effect on the
performance.
Z11 = Z22
Y11 = Y22
Hybrid (h) Parameters
Current (I1) and voltage (V2) are the independent variable and current (I2) and
voltage (V1) are dependent variable.
V1 = h11 I1 + h12 V2
I2 = h21 I1 + h22 V2
Inverse Hybrid Parameter 9g-parameter)
I1 = g11 V1 + g12 I2
V2 = g21 V1 + g22 I2
Transmission Parameters (ABCD parameters)
• It relates the voltage and current at input port to volatage and current at
output port.
• V1 = AV2 - BI2
I1 = CV2 - DI2
• For symmetrical Network A = D
• For reciprocal A B =1
C D
= i.e. AD - BC = 1
Cascading
Two Port Network Connected in Cascade
Overall ABCD parameter of two cascaded two port network is multiplication
of their ABCD parameters.
I1 → ← I2
+ A B A’ B’ +
_V1 C C’ D’ V2 - _
D
I1 I2 +
+ A1 B1
_ V1 C1 D1 V2 _
A1 B1 A B A' B'
= ×
C1 D1 C D C' D'
Two Port Network in Parallel
Overall matrix for two port network connected in parallel is the sum of the
individual network y-parameters (yA) =(yB)
where
(y) = overall y-parameter of combine network
(yA) = y-parameter of network A
(yB) = y-parameter of network B.
Two Port Network Connected in Series
The overall matrix for two=port network connected in series is equal to the
sum of the individual network Z-parameter matrix
(z) = (zA) + (zB)
Some Special Results
I1 → ← I2
+ z +
_ V1 V2
_
(
y = 1/z
-1/z
-1/z
1/z )
, ABCD = 1
0
Z
1 ( )
I1 I2
+ +
V1 Z V2
_ _
This network cannot have y-parameter
Z= Z
Z( )
Z ; ABCD = 1
Z 0 ( Z
1 )
Obtain T-equivalent of the �-network
1 2 1
Z2 Yc 2
+ Z1 +
Z3 Ya Yb
_ _
Za (Zb + Zc ) Za Zb
Z11 = ___________ , Z12 = Z21 = _________
Za + Zb + Zc Za + Zb + Zc
Za (Zb + Zc)
Z22 = ___________
Za + Zb + Zc
Za Zb
Z3 = _________
Za + Zb + Zc
Za Zc
Z21 = __________
Za + Zb + Zc
Za Zc
Z2 = _________
Za + Zb + Zc
Impedance Matching
1 2
Za
Zs Zb Zf
<
> Z2i Z1i