[go: up one dir, main page]

0% found this document useful (0 votes)
33 views30 pages

Chapter - 04 Network Analysis Synthesis

Uploaded by

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

Chapter - 04 Network Analysis Synthesis

Uploaded by

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

Mr. Biruk Simaani (M.Sc.

)
Menschen für Menschen Foundation
Agro – Technical and Technology College
Electrical and Electronics Technology Department
CHAPTER – FOUR
Elements of Realizability Theory
OBJECTIVES: The purpose of this chapter is to:
Introduce the concept of reliability theory
Explain the Hurwitz conditions for stability
Test polynomials for stability applying Hurwitz stability criteria
State the properties of a positive real function
Test a network function to find whether it is a positive real
function and hence realizable.

Instructor: Mr. Biruk Simaani (M.Sc.) 1


4.1. Introduction
 Network analysis deals with finding out the output response, using various
techniques, when the excitation signal (input signal) and the network are known.
 Network synthesis deals with the realization of the network from the given
excitation and output response
 In the network synthesis, we first determine the driving point function in
impedance and admittance form.
 The basic consideration for any network synthesis problem is to determine
whether a network function H(s), given by the ratio of response transform R(s)
to the excitation transform, E(s), i.e. can be realized as a physical passive
network. This study is known as ‘elements of realizability theory’.
 Two important properties for realizability are Causality, and Stability

Instructor: Mr. Biruk Simaani (M.Sc.) 2


4.2. Causality and Stability
A. Causality: A network is said to be causal if the output of the network
depends only on the input at the present time and/or in the past, but not the
future value of the input.
 Thus, a causal network is non-anticipative, i.e., output cannot
come before the input.

Instructor: Mr. Biruk Simaani (M.Sc.) 3


Instructor: Mr. Biruk Simaani (M.Sc.) 4
B. Stability: A stable network is one where the response does not diverge as long as the
excitation does not diverge.
A bounded input produces a bounded output. For this reason, this type of
network is known as bounded input bounded output (BIBO) stable network.

Necessary and Sufficient Conditions of a Network Function for a Stable Network


 The function should not have any pole in the right half of the s-plane.
 The poles on the imaginary axis should be simple (not repeated).
 The difference in the degree of the numerator and denominator polynomials
can at most be unity.

Instructor: Mr. Biruk Simaani (M.Sc.) 5


Hurwitz Conditions for Stability

Instructor: Mr. Biruk Simaani (M.Sc.) 6


Instructor: Mr. Biruk Simaani (M.Sc.) 7
Example 1: Check whether the given polynomial is Hurwitz or not

Instructor: Mr. Biruk Simaani (M.Sc.) 8


Instructor: Mr. Biruk Simaani (M.Sc.) 9
Example 2: Test if the polynomial s3 + 6s2 + 12s + 8 is Hurwitz

Instructor: Mr. Biruk Simaani (M.Sc.) 10


Instructor: Mr. Biruk Simaani (M.Sc.) 11
4.3. Positive Real Function
 Positive real functions represent physically realizable networks.
 A function F(s) is positive real if the following conditions are satisfied
 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
ReF(s)≥0 for Re(s)≥0

Instructor: Mr. Biruk Simaani (M.Sc.) 12


Instructor: Mr. Biruk Simaani (M.Sc.) 13
Instructor: Mr. Biruk Simaani (M.Sc.) 14
4.3.1. Properties of Positive Real Functions

Instructor: Mr. Biruk Simaani (M.Sc.) 15


Example 1: Determine whether the function F(s)=(s^2+6s+5)/(s^2+9s+14) is a
positive real functions(PRF) and hence realizable

Instructor: Mr. Biruk Simaani (M.Sc.) 16


Instructor: Mr. Biruk Simaani (M.Sc.) 17
Instructor: Mr. Biruk Simaani (M.Sc.) 18
Instructor: Mr. Biruk Simaani (M.Sc.) 19
Instructor: Mr. Biruk Simaani (M.Sc.) 20
4.4. Poles and Zeros of Network Functions

Instructor: Mr. Biruk Simaani (M.Sc.) 21


4.5. Restrictions on Pole-Zero Locations of Driving Point and Transfer Functions
4.5.1. Restrictions on Pole and Zero Locations for Driving-point Functions

Instructor: Mr. Biruk Simaani (M.Sc.) 22


4.5.2. Restrictions on Pole and Zero Locations for Transfer Functions

Instructor: Mr. Biruk Simaani (M.Sc.) 23


Instructor: Mr. Biruk Simaani (M.Sc.) 24
Instructor: Mr. Biruk Simaani (M.Sc.) 25
Instructor: Mr. Biruk Simaani (M.Sc.) 26
Example 1: Draw poles and zeros for V(s)=5s/(s^2+7s+12) and evaluate V(t) by
making use of pole-zero diagram

Instructor: Mr. Biruk Simaani (M.Sc.) 27


Instructor: Mr. Biruk Simaani (M.Sc.) 28
Instructor: Mr. Biruk Simaani (M.Sc.) 29

You might also like