Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 101 views

    Theory

    Uploaded by

    Prashant Sharma
    The document discusses network synthesis and Hurwitz polynomials. Network synthesis involves designing a network based on a specified excitation and response. A Hurwitz polynomial is one where the coefficients are positive and the roots have non-positive real parts. A polynomial is Hurwitz if its continued fraction expansion of the ratio of its odd and even parts has all positive quotients. Methods to test if a polynomial is Hurwitz include checking its properties, performing continued fraction expansion, and constructing its Routh-Hurwitz array.

    Copyright:

    © All Rights Reserved

    Theory

    Uploaded by

    Prashant Sharma
    101 views5 pages
    The document discusses network synthesis and Hurwitz polynomials. Network synthesis involves designing a network based on a specified excitation and response. A Hurwitz polynomial is one where the coefficients are positive and the roots have non-positive real parts. A polynomial is Hurwitz if its continued fraction expansion of the ratio of its odd and even parts has all positive quotients. Methods to test if a polynomial is Hurwitz include checking its properties, performing continued fraction expansion, and constructing its Routh-Hurwitz array.

    Original Description:

    Intro, Hurwitz Polynomial & C.F.E

    Copyright

    © © All Rights Reserved

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses network synthesis and Hurwitz polynomials. Network synthesis involves designing a network based on a specified excitation and response. A Hurwitz polynomial is one where the coefficients are positive and the roots have non-positive real parts. A polynomial is Hurwitz if its continued fraction expansion of the ratio of its odd and even parts has all positive quotients. Methods to test if a polynomial is Hurwitz include checking its properties, performing continued fraction expansion, and constructing its Routh-Hurwitz array.

    Copyright:

    © All Rights Reserved
    101 views5 pages

    Theory

    Uploaded by

    Prashant Sharma
    The document discusses network synthesis and Hurwitz polynomials. Network synthesis involves designing a network based on a specified excitation and response. A Hurwitz polynomial is one where the coefficients are positive and the roots have non-positive real parts. A polynomial is Hurwitz if its continued fraction expansion of the ratio of its odd and even parts has all positive quotients. Methods to test if a polynomial is Hurwitz include checking its properties, performing continued fraction expansion, and constructing its Routh-Hurwitz array.

    Copyright:

    © All Rights Reserved
    of 5

    Network Synthesis

    Introduction & Hurwitz Polynomial

    Theory

    NETWORK SYNTHESIS
    Network synthesis so guys what do you mean by network
    synthesis?
    Network synthesis means realizing/ designing the network.
    In the previous chapter, we have analyzed the given network
    where the network & excitation were given & we were supposed
    to determine the response.
    In this chapter called Network Synthesis, we will be provided with
    excitation & response & the network has to be determined.
    So, Lets began with this chapter,

    HURWITZ POLYNOMIALS:
    A Polynomial P(s) is said to be Hurwitz if the following conditions
    are satisfied:
    1) P(s) is real when s is real.
    2) The roots of P(s) have real parts which are zero or negative.
    Properties:
    1) Each & every coefficient in the polynomial.
    P(s) = ansn + an-1sn-1 + . + a1s + a0 must be positive.
    2) The Polynomial should not have any missing terms between
    the highest & lowest order except in case of all even or all
    odd terms are missing.
    3) All the quotients must be positive in the Continued Fraction
    Expansion (C.F.E) of the ratio of odd to even parts or even
    to odd parts of the polynomial P(s).
    1

    Network Synthesis

    Introduction & Hurwitz Polynomial

    Theory

    4) In case if the polynomial is expressed as the product of P 1(s)


    & P2(s) (i.e. P1(s) x P2(s) ) then, P(s) will be Hurwitz only if
    P1(s) & P2(s) are Hurwitz.
    5) If the ratio of polynomial P(s) & its derivative with respect to
    s [i.e. P(s)] gives C.F.E with all positive quotients then, the
    polynomial P(s) will be Hurwitz.
    Note: Remember all these properties, because they are going
    to help us in checking if the given polynomial P(s) is Hurwitz or
    not.
    Tip: In case if you didnt understood these properties at this
    moment, you need not have to worry because you will get it
    while solving problems on Hurwitz in solved section.
    Guys if you have read the above properties clearly, you must
    have noticed a term called C.F.E (Continued Fraction
    Expansion) coming again and again.
    Now this is one of the new addition to all those things that you
    have learned till now.

    Continued Fraction Expansion:


    Guys we all know about the Partial Fraction Expansion (P.F.E).
    Similarly, we have C.F.E which is another technique of
    Expansion.
    In C.F.E, the Numerator(Nu) is divided by the Denominator(Dn)
    by taking Dn. as Divisor & Nu. as Dividend.
    The quotient is written on the RHS and the remainder of this
    Division is again considered as the divisor and the divisor of

    Network Synthesis

    Introduction & Hurwitz Polynomial

    Theory

    previous division is considered as the dividend of this 2nd


    division.
    Again the division(2nd division) & quotient is written on RHS.
    Now again the process repeats for 3rd division by taking the
    remainder of 2nd division as divisor & divisor of 2nd division as
    dividend.
    This process repeats till the remainder of the last division
    becomes zero.
    Lets consider one example:
    We have,

    4 + 5 2 + 4
    Z(s) =
    3 + 3
    By C.F.E,

    Network Synthesis

    Introduction & Hurwitz Polynomial

    Theory

    Method of testing if a polynomial P(s) is Hurwitz or Not


    1) The very method is that you can test the polynomial P(s)
    based on the properties of Hurwitz.
    2) The second method by C.F.E :
    Consider a polynomial,
    P(s) = ansn + an-1sn-1 + . + a1s + a0
    Take the even and odd part of P(s) separately.
    Even part of P(s):
    m(s) = ansn + an-2sn-2 (assuming n to be even)
    Odd part of P(s):
    n(s) = an-1sn-1 + an-3sn-3 + ..
    Let, Q(s) =

    ()
    ()

    Now perform C.F.E of above ratio.


    At the end of C.F.E, if all the quotient terms in C.F.E are
    positive then, P(s) is Hurwitz.
    3) And Last but not least, the third method is by constructing
    the Routh Hurwitz array for the given Polynomial.
    Let P(s) = ansn + an-1sn-1 + an-2sn-2 . + a1s + a0
    The Routh Hurwitz array is given by,

    Network Synthesis

    Sn
    Sn-1
    Sn-2
    Sn-3
    .
    .
    .
    S1
    S0

    Introduction & Hurwitz Polynomial

    an
    an-1
    bn
    cn
    .
    .
    .
    .
    .

    an-2
    an-3
    bn-1
    cn-1

    Theory

    an-4 ..
    an-5 ..
    bn-2 ..

    where the coefficient of sn, sn-1, s0 rows are directly


    written from the below equations,
    bn =

    1 . 2 . 3
    1
    1 . 4 . 5

    bn-1 =
    bn-2 =
    cn =
    cn-1 =

    1
    1 . 6 . 2

    1
    . 3 1 . 1

    . 5 1 . 2

    Now for polynomial P(s) to be Hurwitz, there should not be


    any sign change in the First column of the array.

    You might also like