• DocumentCode
    337383
  • Title

    Network properties of a pair of generalized polynomials

  • Author

    Swamy, M.N.S.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada
  • fYear
    1998
  • fDate
    9-12 Aug 1998
  • Firstpage
    114
  • Lastpage
    117
  • Abstract
    In this article, it is shown that there exists an intimate relationship between the network functions of certain ladder one-port and two-port networks, and a set of generalized two-variable polynomials defined by Un(x,y)=xUn-1(x,y)+yUn-2(x,y), n⩾2, U0(x,y)=0, U1(x,y)=1, and Vn(x,y)=xV n-1(x,y)+yVn-2(x,y), n⩾2, V0(x,y)=2, V1(x,y)=x. Observing that well-known polynomials such as Fibonacci, Chebyshev, Jacobsthal, Pell and Morgan-Voyce polynomials are special cases of these generalized polynomials, it is shown how using these polynomials we can derive elegant relations amongst these various polynomials. Also, using the well-established properties of two-element-kind one-and two-port networks, we then obtain a number of interesting results regarding the location of the zeros of these polynomials, as well as their derivatives
  • Keywords
    ladder networks; linear network analysis; lumped parameter networks; poles and zeros; polynomials; two-port networks; generalized polynomials; ladder one-port networks; ladder two-port networks; network functions; two-element-kind networks; two-variable polynomials; zeros; Chebyshev approximation; Impedance; Inductors; Jacobian matrices; Network synthesis; Polynomials; Signal processing; Transfer functions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1998. Proceedings. 1998 Midwest Symposium on
  • Conference_Location
    Notre Dame, IN
  • Print_ISBN
    0-8186-8914-5
  • Type

    conf

  • DOI
    10.1109/MWSCAS.1998.759447
  • Filename
    759447