NETWORK SYNTHESIS

NETWORK FUNCTIONS
 Network Function: Relationship between the transform of the
source to the transform of the response of Electric N/W with
network initially relaxed.

 Driving point Impedance of 1-port Network:

 Driving point Admittance of 1-port Network:

 Driving point Impedance at port 1 (2-port Network):

 NETWORK FUNCTIONS

 Driving point Admittance at port 1 (2-port Network):

 Driving point Impedance at port 2 (2-port Network):

 Driving point Admittance at port 2 (2-port Network):

 Transfer Impedance (2-port Network):

 NETWORK FUNCTIONS

 Transfer Admittance (2-port Network):

 Voltage Transfer Ratio (2-port Network):

 Current Transfer Ratio (2-port Network)

 NUMERICAL EXAMPLE
 Find Input Impedance for the network shown below:
 NUMERICAL EXAMPLE
 Obtain Transfer Function of the network shown below:
 NUMERICAL EXAMPLE

 Find Z(s) for the network shown below:

 POLES & ZEROS IN NETWORK FUNCTIONS

 A Network Function H(s) may be written as:

 A Network Function H(s) are real and
rational
 The network should be initially relaxed
 Rational means it is the ratio of
polynomials
 Polynomial is finite series of integral
powers of variable. Must not contain
fractional powers
 Powers must be positive integers
 Function is real when variable is real
 Poles & zeros in Network functions

 n<m, means fraction is proper

 m=n, F(s) = k+ proper fraction
 m>n, F(s) = P(s) + proper fraction

 When fraction is proper, there will be no impulse in the impulse response of the system
 When m=n, there will be impulse in the impulse response of the system
 When m>n, there will be impulse and its derivatives in the impulse response of the system
 POLES & ZEROS IN NETWORK FUNCTIONS
 A Network Function H(s) may be written as:

 Z’s are Zeros (circle) and P’s are poles (cross) of Network Function
These determine the shape of the properties of the network, whereas a0/b0
determines or changes just the magnitude
The number of poles and zeros are always same including number of poles and
zeros at zero and infinity.
 NUMERICAL EXAMPLE

 Find Pole Zero Plot of the network function below:

 NUMERICAL EXAMPLE

 Find Pole Zero Plot of the network function below:

 NUMERICAL EXAMPLE

 Find Pole Zero Plot of the network function below:

 STABILITY & POLE ZERO PLOT
 Which of the following functions can be considered stable?
 STABILITY & POLE ZERO PLOT
 Laplace Transforms of these functions?
 STABILITY & POLE ZERO PLOT
 Laplace Transforms of these functions?
 STABILITY & POLE ZERO PLOT
 Pole Zero Plots of these functions?
 STABILITY & POLE ZERO PLOT
 Pole Zero Plots of these functions?
 STABILITY & POLE ZERO PLOT
 Observations from Pole Zero Plot:
NECESSARY CONDITIONS FOR STABILITY OF A N/W FN.
TESTING OF STABILITY OF A NETWORK POLYNOMIAL
 NUMERICAL EXAMPLE

 Check whether the network functions below are

suitable for representing passive networks:
 HURWITZ POLYNOMIAL
 A polynomial is said to be Hurwitz if:

Therefore, the polynomial can be written as

Thus, it follows that P(s) is the product of terms with only positive coefficients.
This marks P(s) positive. Hence, for a Hurwitz polynomial, all the coefficients of 
are positive when the polynomial is expressed as 
 HURWITZ POLYNOMIAL
 Necessary but not sufficient conditions for Hurwitz polynomial:

 Necessary and sufficient conditions for Hurwitz polynomial:

 NUMERICAL EXAMPLE
 Which of the following Polynomials are Hurwitz?
 NUMERICAL EXAMPLE
 Check whether the following Polynomial is Hurwitz?
NUMERICAL EXAMPLE
 NUMERICAL EXAMPLE
 Which of the following Polynomials are Hurwitz?
 NUMERICAL EXAMPLE
 Check whether the following Polynomial is Hurwitz?
NUMERICAL EXAMPLE
 NUMERICAL EXAMPLE
 Check whether the following Polynomial is Hurwitz?
 NUMERICAL EXAMPLE
 Check whether the following Polynomial is Hurwitz?
NUMERICAL EXAMPLE
 POSITIVE REAL FUNCTIONS

• Let us study another class of functions called positive real functions. The significance of positive real functions is that
if the driving point immitance (i.e. admittance or impedance) is a positive real function then only it is physically
realizable using passive R, L and C components.
• Hence immitance function must be checked for positive realness before synthesizing.
For a function to be positive real function it has to satisfy the following basic properties,
•The given function F(s) is real for real s.
•The real part of F(s) is greater than or equal to zero, when the real part of s is greater than or equal to zero.

• The function F(s) is rational function.

The positive real function is also called Brune function. In addition to the basic properties, the positive real function has
some more properties.
 POSITIVE REAL FUNCTIONS

• Mapping of s plane onto F(s) plane.

 PROPERTIES OF POSITIVE REAL FUNCTION

• If F(s) is positive real function then 1/F(s) is also positive real function. Thus for a network if driving point impedance
function Z(s) is positive real then the driving point admittance function Y(s) = 1/Z(s) is also positive real.

• The sum of positive real functions is also positive real. If two impedances are in series, the sum of the impedances is
positive real. Similarly if two admittances are in parallel, their addition gives positive real admittance. Note that the
difference in two positive real functions is not necessarily a positive real function.

• The poles and zeros of F(s) are having negative or zero real parts. They cannot lie in right half s plane.

• The poles of F(s) on the imaginary (jω) axis must be simple. Their residues must be real and positive. The same
statement is true for the poles of 1/F(s) (i.e. zeros of F(s)).

• The degrees of the numerator and denominator polynomials in F(s) differ at the most by 1. So degrees m and n must
differ at the most by 1. Thus the number of finite poles and finite zeros of F(s) differ at the most by 1.

• The terms of lowest degree in the numerator and denominator polynomials of F(s) differ in degree at most by 1. So F(s)
has neither multiple poles nor zeros at the origin.
 FINDING RESIDUES

Lets take k1= A + jB

• If B is positive, when w <w1, the value is
The sum of above two terms would be =
negative. if B is negative, then function
is negative for values w <w1.
• Now If F(s) is to be positive real, then its real part • Only way to avoid real part being
in closed right half plane should be positive for real
part of s positive. negative is to make B =0. Therefore K1
can only be real.
• Lets find out the value on jw axis instead of • Now considering K1 real lets find sum of
checking on entire right half plane.
two terms.
• T(jw)= • =
• Re (jw)= • Let us find out at Re (s)>0. function will
be positive only if K1 is positive.
TESTING POSITIVE REAL FUNCTION

• Denominator should be Hurwitz

• Poles would lie on jw axis whenever continuous fraction expansion
terminates abruptly. Test whether they are simple or multiple.
• If simple then find out residues. =F(s). Find K1 at s = w12.
 TESTING POSITIVE REAL FUNCTION

• Because all powers are even. So we can say Re F(s) at s 2= -w2 to avoid complex calculations.
Further, the function will be a polynomial in w2.
• This can be further simplified by putting w2= x
M1 M2- N1 N2 at s2=-x which should be >=0 for all x>=0
 NUMERICAL EXAMPLE
 Check whether the following Function is a PR Function?

𝐶h𝑒𝑐𝑘 𝑓𝑜𝑟 𝑟𝑒𝑎𝑙𝑛𝑒𝑠𝑠 .

 NUMERICAL EXAMPLE
 Check the Positive Realness of the Function?
 NUMERICAL EXAMPLE
 Check the Positive Realness of the Function?
 NETWORK SYNTHESIS

 Network synthesis refers to the operational procedures in which

a +ve real function is given for Z(s) or Y(s).
 Synthesis is complete when all the network elements are known
or identified.
 Usually Long Division Procedure is adopted in order to perform
the steps of synthesis.
 NETWORK SYNTHESIS

 Network synthesis refers to the operational procedures in which

a +ve real function is given for Z(s) or Y(s).
 POLE AT INFINITY IN Z(S)

 Numerator Polynomial of Z(s) has degree 1 greater than

denominator polynomial.
 POLE AT INFINITY IN Y(S)

 Numerator Polynomial of Y(s) has degree 1 greater than

denominator polynomial.
 POLE AT ZERO IN Z(S)

 Denominator Polynomial of Z(s) has degree 1 greater than

Numerator polynomial.
 POLE AT ZERO IN Y(S)

 Denominator Polynomial of Y(s) has degree 1 greater than

Numerator polynomial.
 POLES ON IMAGINARY AXIS IN Z(S)

 In case of PR fns., Residues must be Real and Positive.

Therefore, K1 and K1* must be equal.
 POLES ON IMAGINARY AXIS IN Z(S)

 In case of PR fns., Residues must be Real and Positive. Therefore, K1 and K1*
must be equal.
 POLES ON IMAGINARY AXIS IN Y(S)

 In case of PR fns., Residues must be Real and Positive. Therefore, K1 and K1*
must be equal.
SUMMARY
SUMMARY
SERIES REALIZATION OF AN IMPEDANCE FN. Z(S)
|| REALIZATION OF AN ADMITTANCE FN. Y(S)
PROCEDURE OF SYNTHESIS
PROCEDURE OF SYNTHESIS
PROCEDURE OF SYNTHESIS
PROCEDURE OF SYNTHESIS
 NUMERICAL EXAMPLE-1
 Realize the N/W whose Driving Point Impedance is given by:
 NUMERICAL EXAMPLE-1
 Realize the N/W whose Driving Point Impedance is given by:
 NUMERICAL EXAMPLE-1
 Realize the N/W whose Driving Point Impedance is given by:
 NUMERICAL EXAMPLE-2
 Realize the N/W whose Impedance is given by:
 NUMERICAL EXAMPLE-2
 Realize the N/W whose Impedance is given by:
 NUMERICAL EXAMPLE-2
 Realize the N/W whose Impedance is given by:
NUMERICAL EXAMPLE-2
NUMERICAL EXAMPLE-2
NUMERICAL EXAMPLE-2
 NUMERICAL EXAMPLE-3
 Realize the N/W whose Impedance is given by:
NUMERICAL EXAMPLE-3
NUMERICAL EXAMPLE-3
NUMERICAL EXAMPLE-3
NUMERICAL EXAMPLE-3
 NUMERICAL EXAMPLE-4
 Realize the N/W whose Admittance is given by:
 NUMERICAL EXAMPLE-4
 Realize the N/W whose Admittance is given by:
NUMERICAL EXAMPLE-4
NUMERICAL EXAMPLE-4
SYNTHESIS OF REACTIVE NETWORKS
(LC Networks)
 REACTIVE NETWORKS
Consider the impedance of a network

The average power dissipated is

For a purely reactive network, the power dissipated is zero. Or we can say
 PROPERTIES OF Z(S)/Y(S) OF LC NETWORKS

• First of all, all coefficients must be real and positive for the function to be positive real.
• Impedance function cannot have multiple poles or zeros on jw axis
• Therefore the highest powers of numerator and denominator can only differ by at most 1.
• Similarly, the lowest powers of numerator and denominator can only differ by at most 1.
• No terms in numerator and denominator (Odd or even) should be missing.
• Therefore a general immitance term of an LC network is given by
• Therefore there must be a pole or zero at origin and infinity.
 If N0 > D0 and N is even and D is odd then we have a pole at origin and infinity.
 If N0 > D0 and N is odd and D is even then we have a pole at infinity and zero at origin.
 If N0 < D0 and N is odd and D is even then we have a zero at origin and infinity.
 If N0 < D0 and N is even and D is odd then we have a pole at origin and zero at infinity.
PROPERTIES OF Z(S)/Y(S) OF LC NETWORKS

Since all the residues are real and positive

 SYNTHESIS OF LC DRIVING POINT IMMITANCES
First Foster Form of LC Networks

Second Foster Form of LC Networks

 SYNTHESIS OF LC DRIVING POINT IMMITANCES

Removing pole at s= infinity Removing pole at s=0

Cauer-I Form of LC Networks Cauer-II Form of LC Networks

 CAUER FORMS OF LC NETWORKS

1. For first Cauer form: The first element in series is an inductor if there is a pole at infinity and it is a
shunt capacitor if there is a zero at infinity. Similarly, the last element is a capacitor when the
function consists of a pole at origin, otherwise last element will be only an inductor.
2. For Second Cauer form: The first element in series is a capacitor if there is a pole at origin and it is a
shunt inductor if there is a zero at origin. Similarly, the last element is an inductor when the function
consists of a pole at infinity, otherwise last element will be only a capacitor.
 NUMERICAL EXAMPLE-1
 Obtain Cauer-I Form of the following LC Network:

 n>m and by using Continued Fraction, we get:

 NUMERICAL EXAMPLE-1
 Obtain Cauer-I Form of the following LC Network:
 NUMERICAL EXAMPLE-2
 Obtain Cauer-II Form of the following LC Network:

 Using Continued Fraction, we get:

 NUMERICAL EXAMPLE-1
 Obtain Cauer-II Form of the following LC Network:

1. Lowest order term in Numerator < Denominator, so Ist Series

Element is C1.
2. Z(s)  Inf., for s  Inf.; Last Element is an Inductor (Ls)
 NUMERICAL EXAMPLE-1
 Obtain Cauer-II Form of the following LC Network:
 NUMERICAL EXAMPLE-1
 Obtain Foster-I Form of the following LC Network:
NUMERICAL EXAMPLE-1
NUMERICAL EXAMPLE-1
 NUMERICAL EXAMPLE-1
 Obtain Foster-I Form of the following LC Network:
 NUMERICAL EXAMPLE-2
 Obtain Foster-II Form of the following LC Network – Y(s):
 NUMERICAL EXAMPLE-2
 Obtain Foster-II Form of the following LC Network – Y(s):
 LOSSY NETWORK SYNTHESIS
 Foster Forms:
 Foster-I Form of RC Networks:

 Foster-II Form of RC Networks:

PROPERTIES OF RC DRIVING POINT IMPEDANCES

• We can obtain Foster realization of RC driving point impedances by replacing all inductors by resistors.
• At s= infinity, all capacitances are short. Therefore all resistors are shorted but Rinf. Therefore, Z(inf) = Rinf.
• Similarly, at s=0, the impedance of C0 is infinity in series with all other resistances. Therefore, at origin, if there is a pole, then C0
dominates Z(s), otherwise it is a constant.
• So the general RC impedance can be represented as
• To write in a form to highlight poles,
• The most general form

• Poles can lie only on negative real axis

• There cannot be a pole at infinity
• The residues Ki are real and positive because these correspond to the elements. Kinf is not a residue. However if Kinf is zero ,means
there is a zero at infinity.
• If there is no pole at origin (means series capacitor C0 is not there), then function is a constant which is equal to sum of all
resistances in the network.
• What about zeros?
PROPERTIES OF RC DRIVING POINT ADMITTANCES
• To find out the conditions of Zeros of impedance function, lets examine admittance function’s poles.
• We can obtain Foster II realization of RC driving point admittances by replacing all inductors by resistors.
• At s= infinity, all capacitances are short. Therefore Y RC(infinity) is dominated by Cinf.
• Similarly, at s=0, the impedance of C0 is infinity or one can say it is open. Therefore, all branches are open but R 0 .
• So the general RC impedance can be represented as Y
• To write in a form to highlight poles, Y
• The most general form Y
• Compare it with

• Poles can lie only on negative real axis

• There cannot be a pole at origin. However if K ’0 is zero ,means there is a zero at origin.
• The Kinf is a residue but K’I is not a residue for Y(s) but it is a residue for Y(s)/s
• If there is no pole at infinity (means there is no capacitor C inf connected), then function is a constant which is equal to
sum of all resistances in the network.
 DIFFERENCE BETWEEN Z(S) AND Y(S) OF RC NETWORKS
• Poles and zeros of RC DPIs lie only on negative real axis.
• Y(s)/s and Z(s) are exactly of equivalent in form
• Residues of Y(s)/s and Z(s) are real and positive Y
• The residues of Y(s) are real but strictly negative
Y

Z(S) Y(S)
• Poles and zeros can lie only on negative real axis • Poles and zeros can lie only on negative real axis
• There cannot be a pole at infinity. It can either be a constant or • There can be a pole at infinity. It can either be a constant
zero. (which is equal to sum of all resistances in the network) or a
• There can be a pole at origin. If there is no pole at origin, then pole.
function is a constant which is equal to sum of all resistances in • There cannot be a pole at origin. It can either be a constant or
the network. zero i.e. if K’0 is zero ,means there is a zero at origin.
• The residues Ki are real and positive because these correspond • The residues Ki are real and negative. Kinf is not a residue.
to the elements. Kinf is not a residue. However if Kinf is zero,
means there is a zero at infinity.
 Y

PROPERTIES OF RC DRIVING POINT IMPEDANCES

Z(S) Y(S)
• First critical frequency is a pole • First critical frequency is a zero
• Last critical frequency is a zero • Last critical frequency is a pole

𝑍 (0)> 𝑍 (∞) Y
Y

• Means if we remove Z(inf), then • Means if we remove Y(0), then

rest of the function shall remain rest of the function shall remain
positive real positive real

𝑍 (0)> 𝑍 (∞)
 Y

PROPERTIES OF RC DRIVING POINT IMPEDANCES AND ITS FOSTER SYNTHESIS

Identify whether the given function is impedance or admittance. Is it realizable?

Realize the Admittance function by inverting this impedance function.

Find residues using given function Y
Then multiply again with s and synthesize.
 Y

CAUER FORM SYNTHESIS OF RC DRIVING POINT IMMITANCES

• Since Cauer-I form work by removing a pole or a constant at s= infinity
• In an impedance function, if we remove value at s= infinity, then the function will still be positive real because
Kinf is the minimum of the real part of Z(jw).
• However, in the admittance function we cannot remove because that is not the minimum value. So for
Cauer I synthesis one always has to start with an impedance function.

• Since Cauer-II form work by removing a pole or a constant

at s= 0
• In an admittance function, if we remove value at s= 0, then
the function will still be positive real because K’0 is the
minimum of the real part of Y(jw).
• However, in the impedance function we cannot remove Z
because that is not the minimum value. So for
Cauer-II synthesis one always has to start with an
admittance function.
 RL NETWORK SYNTHESIS
 Foster-I General Form of RL Networks: The Driving Point
Impedance can be represented as:

It is of the same form

as YRC(s). Therefore
everything of YRC(s) is
applicable to ZRL(s)
 RL NETWORK SYNTHESIS
 Foster-II Form of RL Networks: The Driving Point Admittance can
be represented as:
It is of the same form
as ZRC(s). Therefore
everything of ZRC(s) is
applicable to YRL(s)

The residues at the poles of Y(s) are real and +ve.