COMPUTER DESIGN OF HIGHER ORDER ACTIVE NETWORKS - 1, 2.

J. Vlach; K. Singhal; G. S. Moschytz; P. Horn; J. Rosenblatt

COMPUTER DESIGN OF HIGHER ORDER ACTIVE NETWORKS - 1, 2.

J. Vlach
, K. Singhal
, G. S. Moschytz
, P. Horn
, J. Rosenblatt

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Research output: Contribution to journal › Conference article › peer-review

1 Scopus citations

Abstract

This paper describes an analysis algorithm for obtaining coefficients of any transfer function as well as all derivatives of such coefficients with respect to network elements. Part I gives the description of the algorithm and defines the gain-sensitivity function for higher order networks. Part II describes in detail the optimization strategies for obtaining a desired function and simultaneously minimizing the gain-sensitivity product of active networks. The program can handle arbitrary topologies and higher order networks.

Original language	English
Pages (from-to)	172-175
Number of pages	4
Journal	Proceedings - IEEE International Symposium on Circuits and Systems
State	Published - 1977
Event	Proc IEEE Int Symp Circuits Syst - Phoenix, AZ, USA Duration: 25 Apr 1977 → 27 Apr 1977

Cite this

@article{2e5316078aea4b7186dec7313b5d7939,

title = "COMPUTER DESIGN OF HIGHER ORDER ACTIVE NETWORKS - 1, 2.",

abstract = "This paper describes an analysis algorithm for obtaining coefficients of any transfer function as well as all derivatives of such coefficients with respect to network elements. Part I gives the description of the algorithm and defines the gain-sensitivity function for higher order networks. Part II describes in detail the optimization strategies for obtaining a desired function and simultaneously minimizing the gain-sensitivity product of active networks. The program can handle arbitrary topologies and higher order networks.",

author = "J. Vlach and K. Singhal and Moschytz, \{G. S.\} and P. Horn and J. Rosenblatt",

year = "1977",

language = "אנגלית",

pages = "172--175",

journal = "Proceedings - IEEE International Symposium on Circuits and Systems",

issn = "0271-4310",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proc IEEE Int Symp Circuits Syst ; Conference date: 25-04-1977 Through 27-04-1977",

}

TY - JOUR

T1 - COMPUTER DESIGN OF HIGHER ORDER ACTIVE NETWORKS - 1, 2.

AU - Vlach, J.

AU - Singhal, K.

AU - Moschytz, G. S.

AU - Horn, P.

AU - Rosenblatt, J.

PY - 1977

Y1 - 1977

N2 - This paper describes an analysis algorithm for obtaining coefficients of any transfer function as well as all derivatives of such coefficients with respect to network elements. Part I gives the description of the algorithm and defines the gain-sensitivity function for higher order networks. Part II describes in detail the optimization strategies for obtaining a desired function and simultaneously minimizing the gain-sensitivity product of active networks. The program can handle arbitrary topologies and higher order networks.

AB - This paper describes an analysis algorithm for obtaining coefficients of any transfer function as well as all derivatives of such coefficients with respect to network elements. Part I gives the description of the algorithm and defines the gain-sensitivity function for higher order networks. Part II describes in detail the optimization strategies for obtaining a desired function and simultaneously minimizing the gain-sensitivity product of active networks. The program can handle arbitrary topologies and higher order networks.

UR - https://www.scopus.com/pages/publications/0017789658

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0017789658

SN - 0271-4310

SP - 172

EP - 175

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

T2 - Proc IEEE Int Symp Circuits Syst

Y2 - 25 April 1977 through 27 April 1977

ER -

COMPUTER DESIGN OF HIGHER ORDER ACTIVE NETWORKS - 1, 2.

Abstract

Other files and links

Fingerprint

Cite this