0% found this document useful (0 votes)
561 views51 pages

4.synthesis of Driving Point Functions (One Port Systems)

This document discusses the synthesis of one-port networks from driving-point functions. It introduces basic synthesis procedures and discusses breaking up a positive real function into simpler functions that can each be realized as network elements. Specific decomposition methods are covered for LC networks using Foster synthesis and Cauer synthesis. Examples are provided to demonstrate synthesizing driving-point impedances and admittances as LC networks from given functions.

Uploaded by

Berento
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
561 views51 pages

4.synthesis of Driving Point Functions (One Port Systems)

This document discusses the synthesis of one-port networks from driving-point functions. It introduces basic synthesis procedures and discusses breaking up a positive real function into simpler functions that can each be realized as network elements. Specific decomposition methods are covered for LC networks using Foster synthesis and Cauer synthesis. Examples are provided to demonstrate synthesizing driving-point impedances and admittances as LC networks from given functions.

Uploaded by

Berento
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 51

Network Analysis and Synthesis

Chapter 4
Synthesis of deriving point functions
(one port networks)
Elementary Synthesis procedures

• The basic philosophy behind the synthesis of


driving-point functions is to break up a
positive real (p.r.) function Z(s) into a sum of
simpler p.r. functions Z1(s), Z2(s) . . . Zn(s).
• Then to synthesize these individual Zi(s) as
elements of the overall network whose dp
impedance is
Z (s)  Z1 (s)  Z 2 (s)  ...  Z n
(s)
Breaking up process

• One important restriction is that all Zi(s) must


be positive real.
• If we were given all the Zi(s), we could
synthesize a network whose driving point
impendance is Z(s) by simply connecting the
Zi(s) in series.
• However, if we were to start from Z(s)
alone,
how Zdo(s)we

adecompose
s n a s n1 ... Z(s)
n n1 into Zi(s)?
a s a1 P(s)
0

bm s m  bm1s m1
 ...  b1s  b0 Q(s)
Removing a pole at s=0

• If there is a pole at s=0, we can write Q(s) as


Q(s)  sG(s)

• Hence, Z(s) becomes


D
Z (s)   R(s)
s
 Z1 (s)  Z 2 (s)

• Z1(s) is a capacitor.
• We know Z1(s) is positive real, is Z2(s) positive
real?
Is Z2(s) positive real?

• The poles of Z2(s)are also poles of


Z2(s) doesn’t’ haveZ1(s), hence, poles
the s plane and no on the right hand
– Satisfies the first 2 side of of p.r.
properties multiple
functions.
• What about Re(Z poles
(jw))? on the jw axis.
2
ReZ ( jw)   ReZ1 ( jw)  Z 2 ( jw)   ReZ1 ( jw)   ReZ 2 ( jw) 
 ReZ 2 ( jw) 

• Since Z(s) is p.r. Re(Z2(jw))=Re(Z(jw))>0.


• Hence, Z2(s) is p.r.
Removing a pole at s=∞

• If Z(s) has a pole at s=∞, we can write


Z(s) as
Z (s)  Ls  R(s)
•  Z1 (s)  Z 2 (s)
Using a similar argument as previous we can
• show that Z2(s) is p.r.
Z1(s) is an inductor.
Removing complex conjugate poles on
the jw axis.
• If Z(s) has complex conjugate poles on the jw
axis, Z(s) can be expanded into
2Ks
Z (s)   Z2 (s)
s  1
2 2

 2Kjw 
• Note that Re 2  0
2 
 s  1 

• Hence, ReZ (s)  Re(Z (s))  0


2

• Z2(s) is p.r.
Removing a constant K

• If Re(Z(jw)) is minimum at some point wi and if


Re(Z(jw)) = Ki as shown in the figure
• We can remove that Ki as
Z (s)  Ki  Z 2 (s)

• Z2(s) is p.r.
• This is essentially removing
a resistor.
Constructing

• Assume that using one of the removal


processes discussed we expanded Z(s) into
Z1(s) and Z2(s).
• We connect Z1(s) and Z2(s) in series as shown
on the figure.
Example 1

• Synthesize the following p.r.


function Z (s) 
s 2s 6
2

s(s  3)
• Solution:
– Note that we have a pole at s=0. Lets remove it
A Bs C
Z (s)  
s s3
A  2, B  1, C 
0
Z (s) 
2s s s 3

– Note that 2/s is a capacitor, while s/(s+3) is a
parallel connection of a resistor and an inductor.
• 2/s is a capacitor with C=1/2.
• While s/(s+3) is a R=1 connected in parallel
with an inductor L=1/3.
Example 2

• Synthesis the following p.r. function


7s 2
Y (s) 
2s  4
• Solution
– Note that there are no poles on s=0 or s=∞ or jw
axis.
– Lets find the minimum of Re(Y(jw))
ReY ( jw)  Re
 7 jw 2 
 Re
2 j7w4 j 4w  
 4 jw  4   16  16w2 

8  28w2

16  16w
2

4  14w2

8  8w2
• Note that minimum of Re(Y(jw))=1/2.
• Lets remove it
1 3s
Y (s)  
2 s2
3s
• ½ is a conductance in parallel with Y2(s)= s2
• Note that Y2(s) is a conductance 1/3 in series
with an inductor 3/2.
Exercise

• Synthesize the following p.r. function.


6s 3 3s2 3s 
Z (s)  1
6s 3  3s
Synthesis of one port networks with
two kinds of elements
• In this section we will focus on
the networks
of synthesis with only L-C, R-C or R-L
elements.
• The deriving point impedance/admittance of
these kinds of networks have special
properties that makes them easy to
synthesize.
1. L-C imittance functions

• These networks have only inductors and


capacitors.
• Hence, the average power consumed in
these kind of networks is zero. (Because an
and a capacitor don’t dissipate energy.)
inductor
• If we have an L-C deriving point impedance
Z(s)
M 1 (s) N1 (s) M1 and M2 even parts
Z (s)  N1 and N2 odd parts
M 2 (s)  N 2 (s)
• The average power dissipated by the network
is 1
Average Power  ReZ ( jw)  I
2
0
2
( jw) ReZ ( jw) 

0 M 1 (s)M 2 (s) N1 (s) N 2 (s)
 2 2
M 2 (s)  N 2(s)
 M 1 (s)M 2 (s)  N1 (s)
N 2 (s)  0
 M 1 (s)  0  N 2 (s) or M 2 (s)  0  N1 (s)
N1 (s) M 1 (s)
 Z (s)  or Z (s) 
M 2 (s) N 2 (s)
ev odd
Z (s)  en or Z (s) 
odd even
Properties of L-C function

1. The driving point impedance/admittance of


an L-C network is even/odd or odd/even.
2. Both are Hurwitz, hence only simple
imaginary zeros and poles on the jw axis.
3. Poles and zeros interlace on the jw axis.
4. Highest power of the numerator and
denominator may only differ by 1.
5. Either a zero or a pole at origin or
infinity.
Synthesis of L-C networks

• There are two kinds of network realization


types for two element only networks.
– Foster and
– Cauer
Foster synthesis

• Uses decomposition of the given F(s) into


simpler two element impedances/admittances.
• For an L-C network with system function F(s), it
can be written as
K0 2K i s
F (s)   K s   ...
s  i
2
s 2

• This is because F(s) has poles on the jw axis


only.
• Using the above decomposition, we can
realize F(s) as

For a driving point


impedance

For a driving point


admittance
Example
2s 2  1s 2
F (s) 
• Synthesize 9
s  s 2
 as driving point
4
impedance and admittance.
Solution:
– Decompose F(s) into simpler forms
K0 2K1s
F (s)   K s 
s s24
9 15
K   2, K0  , K1 
2 2
• For driving point impedance

• For driving point admittance


Cauer synthesis

• Uses partial fraction expansion method.


• It is based on removing pole at s=∞.
N1 (s) M 1 (s)
Z (s)  or Z (s) 
M 2 (s) N 2 (s)
• Since the degree of the numerator and
denominator differ by only 1, there is either a
pole at s=∞ or a zero at s=∞.
– If a pole at s=∞, then we remove it.
– If a zero at s=∞, first we inverse it and remove the
pole at s=∞.
• Case 1: pole at s=∞
– In this case, F(s) can be written as
N 3 (s)
F (s)  K s  ,
M 2 (s)
Order of M 2 (s)  Order of N 3 (s)  1
Hence,
1
F (s)  K  s 
M 2 (s)
N 3 (s)
1
 K s 
1
K1 s 
K 2 s  ...
• This expansion can easily be realized as
• Case 2: zero at s=∞
1
– In this case G(s)  will have a pole at s=∞.
F (s)

– We synthesize G(s) using the procedure in the


previous step.
– Remember that if F(s) is an impedance function,
G(s) will be an admittance function and vice versa.
Example

• Using Cauer realization


synthesize 5 3
Z (s) 
2ss 12s
4s2  316s
4
Solution:
– This is an impedance function.
– We have a pole at s=∞, hence, we should remove
it.
• If we were given Y(s) instead our realization
would be
R-C driving point impedance/ R-L
admittance
• R-C impedance and R-L admittance driving
point functions have the same properties.
• If F(s) is an R-C driving point impedance or R-L
driving point admittance, it can be written as
K0 K1
F (s)   K   ...
s s
• Where 
i

1 1
, ,... Cap aictors for R - C imp edance and inductor for R - L
K0 Ki admittance
Ki
K , ,... Rep resent
i resistors
Properties of R-C impedance or R-L
admittance functions
1. Poles and zeros lie on the negative axis.
2. real
The singularity nearest origin must be a pole
and a zero near infinity.
3. The residues of the poles must be positive
and real.
4. Poles and zeros must alternate on the
negative real axis.
Synthesis of R-C impedance or R-L
admittance
• Foster
– In foster realization we decompose the function
into simple imittances according to the poles. That
is we write F(s) as
K0 K1
F (s)   K   ...
s si
– For R-C impedance
• For R-L admittance
Example
3(s 2)(s 4)
F (s) 
• Synthesize s(s  3) as R-C impedance
and R-L admittance in foster realization.
Solution:
– Note that the singularity near origin is a pole and
a zero near infinity.
– The poles and zeros alternate
– We can expand F(s) as 8
F (s)  
1
3
s s3
– R-C impedance
• R-L admittance
• Cauer realization
– Cauer realization uses continued fraction expansion.
– For R-C impedance and R-L admittance we remove
a resistor first.
– Then invert and remove a capacitor
– Then invert and remove a resistor . . .
Example
3(s 2)(s 4)
F (s) 
• Synthesize using Cauer realization
s(s  2) as
R-C impedance and R-L admittance.
Solution:
– Note that the singularity near origin is a pole.
– The singularity near infinity is a zero.
– The zeros and the poles alternate.
F(s) is R-L impedance
or R-C admittance
– Note that the power of the and denominator
numerator first.
is equal, hence, we remove the resistor
For R-C impedance For R-L admittance
R-L impedance/R-C admittance

• R-L impedance deriving point function and R-C


admittance deriving point function have the
same property.
• If F(s) is R-L impedance or R-C admittance, it
can be written as
Ki s
F (s)  K  s  K 0   ...
s i
1 1

, ,... Inductors for R - L imp edance and Cap acitors for R - C admittance
K Ki
Ki
K0 , ,... Rep resent
 i resistors
Properties of R-L impedance/R-C
admittance
1. Poles and zeros are
located on the
real axis and they negative
alternate.
2. The nearest singularity near origin is zero.
The singularity near infinity is a pole.
3. The residues of the poles must be real and
negative.
• Because the residues are negative, we can’t use
standard decomposition method to synthesize.
Synthesis of R-L impedance and R-C
admittance
• Foster
– If F(s) is R-L impedance d.p or R-C admittance d.p
function. We can write it as
Ki s
F (s)  K  s  K 0   ...
s i
– Because of the third property ofR-L impedance/R-
C admittance d.p. functions, we can’t decompose
F(s) into synthesizable components with the way
we were using till now.
– We have to find a new way where the residues
wont be negative.
• If we divide F(s) by s, we get
F (s) K 0 Ki
  K   ...
s s s i

• Note that this is a standard R-C impedance d.p.


function, hence, the residues of the poles of
F(s)/s will be positive.
• Once we find Ki and σi we multiply by s and
draw the foster realization.
Example
2(s  1)(s
• Synthesize F (s)  (s  3)
2)(s  as R-L
impedance and R-C 6)
admittance using Foster
realization.
Solution:
– Note that the singularity near origin is a zero.
– The singularity near infinity is a pole.
– The zeros and the poles alternate.
F(s) is R-L impedance
or R-C admittance
• We divide F(s) by s.
F s(s  1)(s
(s)s  3)
s(s  2)(s 
1 6) 1 5
2 4 4
  
s s2 s6

Then multip ly ing by


s 1 s 5 s
F (s)  1  4  4
2 s2 s6
• R-L impedance

• R-C admittance
• Cauer realization
– Using continued fractional expansion
– We first remove R0. To do this we use fractional
expansion method by focusing on removing the
lowest s term first.
– We write N(s) and M(s) starting with the lowest
term first.
Example
2(s  1)(s
F (s)  as R-L
• Synthesize (s  3)
2)(s 
impedance and R-C 6) admittance using Cauer
realization.
• Solution: P(s)
F (s) 
Q(s)

– We write P(s) and M(s) as


P(s)  6  8s  2s 2
Q(s)  12  8s s 2

• R-L impedance

• R-C admittance

You might also like