• DocumentCode
    2200862
  • Title

    Numerical synthesis of RLC one-port networks

  • Author

    Shahzadi, B.

  • Author_Institution
    Dept. of Electr. Eng., California State Univ., Long Beach, CA, USA
  • fYear
    1989
  • fDate
    26-28 Mar 1989
  • Firstpage
    614
  • Lastpage
    620
  • Abstract
    An iterative numerical technique is used to synthesize a given minimal RLC network with a prescribed admittance function. A minimal network is one containing the minimum number of capacitors and inductors and as many elements as there are independent coefficients in the admittance function. Reducing the given network through certain reduction techniques to one that can be synthesized by routine methods produces the initial element values. Coefficient matching of admittance functions is used to establish evaluating equations for element parameters. The concept of sensitivities of the evaluating equations with respect to element parameters is used to achieve fast convergence. The element values can be determined to any degree of accuracy desired. Special attention is paid to biquadratic functions realized by networks containing one inductor, one capacitor, and three resistors. It is noted that there may or may not be a solution
  • Keywords
    iterative methods; linear network synthesis; lumped parameter networks; minimisation; admittance function; biquadratic functions; coefficient matching; evaluating equations; fast convergence; iterative numerical technique; minimal RLC network; network synthesis; one-port networks; sensitivities; Admittance; Capacitors; H infinity control; Network synthesis; Network topology; Poles and zeros; Resistors; Shape;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    System Theory, 1989. Proceedings., Twenty-First Southeastern Symposium on
  • Conference_Location
    Tallahassee, FL
  • ISSN
    0094-2898
  • Print_ISBN
    0-8186-1933-3
  • Type

    conf

  • DOI
    10.1109/SSST.1989.72541
  • Filename
    72541