DEDRE MARKOS UNIVERSITY

DEBRE MARKOS INSTITUTE OF TECHNOLOGY

SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING

Network Analysis and Synthesis

(ECEg3122)
For 2011 third year ECE Regular students;
By: Gebremariam Asnake.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 1

 Chapter Four
Synthesis of Driving Point Functions
and Two port network Parameters
Outlines
 Synthesis of Driving Point Functions
(one port networks).
 Two port network Parameters.

 Note:- Consider all Examples of this slide as

Worksheet-two from Chapter Four; read, do and
understand these by yourself, and by help to each
other in your peer group and to others.
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 2
4.1 Synthesis of deriving point functions
4.1.1 Introduction
• Evaluation of elements and design of a network from
its driving point impedance or admittance is termed as
driving point synthesis.
• The Network Function of all passive networks and all
stable active network must be Reliable. That is:-
 Must be rational functions in “s” with real coefficients.
 May not have poles in the right half “s” plane.
 May not have multiple poles on the jw axis.
To see more for different functions properties;

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 3

 Cont….
1. Passive RLC Driving Point (dp) Functions
• Must be a rational function in “s” with real
coefficients.
• May not have poles or zeros in the right half “s”
plane.
• May not have multiple poles or zeros on the jw axis.
• May not have the degrees of the numerator and
denominator differing by more than one.
• Must have a nonnegative real part for all s= jw.
• Must have positive and real residues for poles on the
jw axis.
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 4
 Cont….
2. Passive RC / RL Driving Point Functions
 RC dp impedance /RL dp admittance function
satisfy all the properties associated with RLC dp
functions and in addition:
•The poles and zeros lie on negative real axis and
alternate.
•At dc the impedance function is either a positive
constant or has a pole.
•At infinity the dp impedance function is either a
positive constant or has a zero.
•The residues of Z(s)are real and positive.
•The slope of dZ(Ծ)/d(Ծ) is negative.
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 5
 Cont….
RC dp admittance /RL dp impedance function
satisfy all the properties associated with RLC dp
functions and in addition:
•The poles and zeros lie on negative real axis and
alternate.
•At dc the admittance function is a positive
constant or has a zero.
•At infinity the dp admittance function is either a
positive constant or has a pole.
•The residues of Y(s) are real and negative.
•The slope of dY(Ծ)/d(Ծ) is positive.
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 6
 Cont….
3. Passive LC Driving Point Functions
 An LC dp impedance, Z(s) function must satisfy the
properties associated with RLC dp functions and in
addition:
• The poles and zeros lie on the jw axis, are simple, and
alternate.
• The dp function must have a pole or a zero at dc.
• The dp function must have a pole or a zero at infinity.
• The function must be odd/even or even/odd.
• The slope dX(w)/d(w) is positive.
 The symmetry of the above properties of Z(s)suggests
that its reciprocal, dp admittance Y(s), will have the
same properties.
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 7
 4.1.2 Elementary Synthesis procedures
• The basic principle involved the synthesis of driving-
point function is to break it into sum of simpler p.r.
functions; and then to synthesize these individuals as
elements of the overall network.
 For dp impedance, Z(s)=Z1(s)+Z2(s)+Z3(s)…Zn(s)
 For dp admittance, Y(s)= Y1(s)+Y2(s)+Y3(s)…Yn(s
• As we know in network synthesis there may be many
different solutions (networks) these satisfies the given
function. But we are going to synthesis a network in
canonical forms.
• Canonical form network synthesis mean that design a
network that contains the minimum possible number
of elements for the given function.
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 8
 Cont….
There are four canonical forms:
#Two Foster Forms
1. Foster-1: partial fraction expansion at poles of Z(s).
 This is also called foster series form.
2. Foster-2: partial fraction expansion at poles of Y(s).
 This is also called foster parallel form.
 A Foster network must be passive, so an active
network, containing a power source, may not obey
Foster's theorem. These are called non-Foster
networks.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 9

 Cont….
#Two Cauer Forms
3. Cauer-1: Continued fraction expansion about infinity
(successive removal of pole at infinity)
 Starts the continued fraction expansion from the highest
power (after rearranging of numerator and denominator
in descending order).
4. Cauer-2: Continued fraction expansion about the origin
(successive removal of pole at zero)
 Starts the continued fraction expansion from the lowest
power (after rearranging of numerator and denominator
in ascending order).
N.B:- Every Reliable network must be synthesis at least
one of the four canonical methods of network
synthesizing, else it is not realizable.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 10

 Breaking up process
• One important restriction is that all Zi(s) and / Yi(s) must
be positive real. [for i=1 up to n]
 For dp impedance if, Z(s)=Z1(s)+Z2(s)+Z3(s)…Zn(s)
 For dp admittance if, Y(s)= Y1(s)+Y2(s)+Y3(s)…Yn(s
• If we were given all the Zi(s) and /Yi(s), we could
synthesize a network whose driving point impendance is
Z(s) by simply connecting the Zi(s) in series; and whose
driving point admittance is Y(s) by simply connecting the
Yi(s) in parallel.
 The synthesis process is done by breaking the given
deriving-point function in to sum of one of the following
functions and the remainder function.
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 11
 Cont….

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 12

 Cont….
• If the function by itself is some what easy/simple, or after
decompose it to simple easily synthesizable form; we can
synthesis it simple by Inspection, by remembering the
above and bellow basic functions.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 13

 Cont….
• However, if we were to start from Z(s) alone, how do we
decompose Z(s) into Zi(s)?
• The synthesis process is done by breaking the given deriving-
point function in to sum of one of the above functions and
the remainder function. i.e
Z(s) = Z1(s) + Z2(s)
• Where, Z1(s) is one of the above functions. Z2 is obtained by
subtracting Z1 from Z. Synthesis continues by applying the
same process to Z2 until all elements are identified.
• In the above process, Z1 is said to be removed from Z. Except
the first case (where Z1 = H is a constant), all other forms of
Z1 are associated with poles so that subtracting Z1 from Z
means removing the pole associated with Z1, and hence we
say a pole is removed.
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 14
 Cont….
• Therefore, synthesis is accomplished by successive
removal of poles and constants.
• There are four important removals in the synthesis of 1-
port deriving-point functions.
• Consider a deriving-point function, Z(s), (the same
applies for Y(s))
1. Removal of pole at infinity
• If Z(s) is positive real and has pole at infinity.
i.e, Deg N = Deg D + 1
 By ordinary division,
where; K = an+1/bn

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 15

 Cont….
• Now Z1(s) = KS is impedance of an inductor where L = K.
Removal of pole at infinity from deriving-point
impedance function corresponds to removal of an
inductor from the network.
 Similarly, if the function is Y(s),

• This corresponds to removal of a capacitor C = K

 Removal of pole at infinity from deriving-point
admittance function corresponds to removal of a
capacitor from the network.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 16

 Cont….
2.Removal of pole at zero
• If Z(s) has pole at zero, i.e if D(s) is zero at s = 0

Where; Ko = a0/b1
• Now Z1(s) = K0/s is impedance of a capacitor C = 1/Ko
Removal of pole at zero from deriving-point impedance
function corresponds to removal of a capacitor from the
network. Seee the diagram;
• Similarly, if the function is Y(s),
; Ko = a0/b1
Now Y1(s) = Ko/s is admittance of an inductor L = 1/Ko
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 17
 Cont….
Removal of pole at zero from deriving-point admittance
function corresponds to removal of an inductor from the
network.

Example 1
• Synthesize the following p.r. function
Solution:
– Note that we have a pole at s=0. Lets remove it.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 18

 Cont….
– 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.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 19

 Cont….
3. Removal of conjugate imaginary poles
• If Z(s) has pole on the imaginary axis at jω, it can
be written as follows:

Now; =

• This is impedance of parallel combination of an

inductor L = k/ω2 and a capacitor C = 1/k

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 20

 Cont….
Removal of conjugate imaginary poles from a deriving-
point impedance function corresponds to removal of
parallel combination of an inductor and a capacitor.

• Similarly, for admittance function;

• This corresponds to removal of series combination of an

inductor L = 1/k and a capacitor C = k/ω2.
Removal of conjugate imaginary poles from admittance
deriving-point function corresponds to removal of series
combination of an inductor and a capacitor.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 21

 Cont….
4. Removal of constant
• This process is important when the deriving-point function
has no imaginary poles (including at s = 0 and s = ∞). If a
constant K is subtracted from Z(s),
Z(s) = K + Z2(s) where Z2(s) = Z(s) – k
• The difference of two positive real functions is not
necessarily positive real. Therefore the remainder function,
Z2(s), must be positive real function to remove a constant
from Z(s). In other words, Z2(s) must satisfy the following
condition.
For all real ω, Re[Z2(jω)] ≥ 0
• Since Z(s) is positive real, Re[Z(jω)] ≥ 0 for all real ω
Where Re[Z(jω)] =K + Re[Z2(jω)]
• Re[Z2(jω)] = Re[Z(jω)] – K
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 22
 Cont….
• The maximum constant, K, that can be removed from
Z(s) is the minimum of Z(s).
• K < Min(Re[Z(jω)]).
Removal of a constant from deriving-point impedance/or
admittance function corresponds to removal of a resistor
from the network.

 The whole synthesis process involves repeated

application of pole and constant removals from the
given deriving-point function.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 23

 Cont….
Example 2
• Synthesis the following p.r. function;
Solution
– Note that there are no poles on s=0 or s=∞ or jw axis.
– Lets find the minimum of Re(Y(jw)).

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 24

 Cont….
 Note that minimum of Re(Y(jw))=1/2.
• Lets remove it.

• ½ is a conductance in parallel with Y2(s)=

• Note that Y2(s) is a conductance 1/3 in series with an
inductor 3/2.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 25

 Cont….
Example 3
• Realize the following 1-port deriving-point impedance
function.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 26

 4.1.3 Synthesis of one port networks
with two kinds of elements
• In this section we will focus on the synthesis
of networks 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.
• We can Realize of LC Networks by using
four canonical Synthesis forms.
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 27
 1. LC Network Synthesis
• If a network contains only inductors and capacitors, it is
called a pure reactive network.
• In pure reactive network, the average power dissipated
is zero (because an inductor and a capacitor don’t
dissipate energy) so that it is called lossless network.
• Therefore, the real part of the impedance/admittance
function is zero for pure imaginary frequency, s = jω.
• Consider a deriving-point impedance function Z(s).

Where, M and N are even and odd parts respectively.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 28

 Cont….

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 29

 Cont….
 Z(s) is always even to odd (Ne(s)/Do(s)) or odd to even
(No(s)/De(s)) quotient of polynomials.
 Since N and D are either even or odd polynomials, all
poles and zeros of Z lie on the jω – axis.
 Z has pole at zero (when Z(s) = Ne(s)/Do(s)) or zero at
zero (when Z(s) = No(s)/De(s))
 Degrees of N and D differ exactly by one.
 Z has pole at infinity (if Deg N > Deg D) or zero at
infinity (if Deg N < Deg D)
• In general, Z(s) can be written as follows:
• ωz1 = 0 if Z has zero at s = 0
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 30
 Cont….
A. Foster Realization of LC network
 Foster-1:

 Foster-2:

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 31

 Cont….
B. Cauer Realization of LC network
• If H(s) is impedance function;

• If H(s) is admittance function;

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 32

 Cont….
 Cauer-1: obtained by continued removal of pole at
infinity. Cauer-1 form of H(s) will be:

 Cauer-2: obtained by continued removal of pole at zero.

Cauer-2 form of H(s) will be:

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 33

 Cont….
Example 4
• Synthesize as driving point impedance
and admittance.
Solution:
– Decompose F(s) into simpler forms

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 34

 Cont….
For driving point impedance,i.e F(s)=Z(s) [ Foster -1);

For driving point admittance,i.e F(s)=Y(s)[foster-2];

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 35

 Cont….
Example 5
• Find the two Foster and two Cauer realizations of Z(s).

Solution:
Foster-1

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 36

 Cont….
Foster – 2

Cauer – 1 pole removal at infinity

Note: Z(s) does not have pole at infinity. Therefore, we

take Y(s) since it will have pole at infinity.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 37

 Cont….

Cauer – 2 Pole removals at zero

 Since Z(s) does not have pole at the origin. Therefore, we

take Y(s) since it will have pole at zero.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 38

 Cont….

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 39

 Cont….
Example -6
• Using Cauer-1 realization synthesize

Solution:
– This is an impedance function.
– We have a pole at s=∞, hence, we should remove it.
-After doing the continued fraction expansion as shown
next slide; we get the realize network as you see next
slide.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 40

 Cont….

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 41

 2. RC and RL Network Synthesis
A. Foster realization of RC networks
 Foster – 1

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 42

 Cont….
 Foster – 2

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 43

 Cont….
B. Foster realization of RL networks
 Foster – 1

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 44

 Cont….

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 45

 Cont….
 Foster – 2

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 46

 Cont….
Example -7
• Find Foster – 1 and Foster – 2 realization of the following
deriving-point function.

Solution:
Foster – 1;

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 47

 Cont….
Foster – 2

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 48

 Cont….
Example-8
• Synthesize as R-L impedance and R-C
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.

• We divide F(s) by s;

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 49

 Cont….

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 50

 Cont….
 For R-L impedance, i.e: F(s)= Z(s);

 For R-C admittance, i.e: F(s)= Y(s);

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 51

 Cont….
Cauer Realization of RC and RL deriving-point function
• RC and RL deriving – point functions (N(s)/D(s)) can have
both numerator and denominator polynomials of the
same degree.
• In this case, division about the highest or lowest degrees
gives a constant quotient that removes a constant from
the deriving - point function.
• But to remove a constant from the deriving – point
function, the constant must be less than or equal to the
minimum of the function.
• Therefore, it should be known whether from the
impedance or admittance a constant can be removed.
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 52
 Cont….
• ZRC(0) > ZRC(∞) ► YRL(0) > YRL(∞) since ZRC and YRL have
similar properties
• YRC(0) < YRC(∞) ► ZRL(0) < ZRL(∞) since YRC and ZRL have
similar properties
This shows that:
• ZRC and YRL have minimum values at infinity (∞) so
that a constant can be removed during Cauer-1
realization (continued fraction expansion about
infinity).
• YRC and ZRL have minimum values at zero (0) so that
a constant can be removed during Cauer-2
realization (continued fraction expansion about
zero).
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 53
 Cont….
A. Cauer – 1 realization
• For RC networks use the impedance function, ZRC, and
for RL network use the admittance function, YRL.

Case 1: Deg N = Deg D

• Since these functions have minimum values at infinity, a
constant can be removed by division about infinity
(highest degrees).
• This leaves a remainder function whose numerator has
a degree less that the denominator, and hence has zero
at infinity. This can be removed as a pole from the
reciprocal.
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 54
 Cont….
• Cauer – 1 form of ZRC and YRL will be as shown below.

Case 2: Deg N < Deg D zero at infinity

• In this case there is no constant removal at infinity (the
function becomes zero at infinity) so that the expansion
starts from the reciprocal function.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 55

 Cont….
B. Cauer – 2 realizations
• For RC networks use the admittance function, YRC, and
for RL network use the impedance function, ZRL.

• These functions have minimum values at zero so that a

constant about the origin (at zero) can be removed by
dividing about the lowest degrees.
Case 1: zero at s = 0
• No constant removal at zero since the function becomes
zero at s = 0. However, the reciprocal will have pole at
zero.
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 56
 Cont….
• This pole is removed first and the remainder will have no
pole at zero anymore. Now a constant at zero is removed
from the reciprocal.
• Removal of a constant at zero leaves another remainder
which has zero at s = 0 (since the constant is already
removed). Therefore, a pole at zero is removed from
reciprocal of this function. The expansion continues by
following the same procedure.
• Finally, Caurer-2 form of such function will be as shown
below.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 57

 Cont….
Case 2: no zero at s = 0
• In this case a constant at zero is removed first.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 58

 Cont….
Example-9
• Realize the following RL deriving-point function using
Cauer – 1 and Cauer – 2

Solution:
• ZRL(0) < ZRL(∞)
• YRL(∞) < YRL(0)
• For Cauer – 1 (Continued Fraction Expansion about
infinity), use YRL.
• For Cauer – 2 (Continued Fraction Expansion about the
origin) use ZRL.
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 59
 Cont….
Cauer – 1

 Deg N < Deg D

 No pole or constant removal at infinity
 Start from the reciprocal function (ZRL)

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 60

 Cont….
Cauer – 2

 No zero at zero
 A constant can be removed at zero

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 61

 Cont….
Example-10
• Synthesize as R-L impedance and R-C
admittance using Cauer-2 realization.
Solution:

 First do continued fraction expansion,

 Then consider;
 F(s)= Zrl and
 F(s)= Yrc
 Finally synthesize each.

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 62

 Cont….

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 63

 Cont….
 R-L impedance

 R-C admittance

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 64

 Cont….
Example-11
• Synthesize using Cauer-1 realization 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.

 Note that the power of the numerator and denominator is

equal, hence, we remove the resistor first.
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 65
 Cont….
 First do continued fraction expansion,

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 66

 Cont….
For R-C impedance, i.e: F(S)=Z(s);

For R-L admittance , i.e: F(S)=Z(s);

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 67

 4.1.4 Synthesis of of certain R-L-C Functions
• Under certain conditions; one port R-L-C driving point
functions my be synthesized by either partial fractions
(foster forms) or continued fractions (cauer forms).
Example -12
Synthesize the function using cauer-1 form.
Solution: Continued fraction and its ntk is;

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 68

 Cont…
Example -13
Synthesize the function using foster-2 form.
Solution:
• The partial fraction expansion is

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 69

 Cont…
•

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 70

 Cont…
Example -14
Synthesize the function using cauer form.
Solution:

-shown to next slide together with its resulting ladder

network.
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 71
 Cont…

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 72

DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 73
DMU,DMIoT,SoECE; NTK, By: Gebremariam A. 2011 E.C. 74