File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Systematic method for determining the minimality of an RC network

TitleSystematic method for determining the minimality of an RC network
Authors
Issue Date1989
PublisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207217.asp
Citation
International Journal Of Electronics, 1989, v. 67 n. 3, p. 415-421 How to Cite?
AbstractIt is always difficult to tell whether a given RC one-port network is realized in the minimal form, and to what extent the number of elements can be reduced if it is not minimal. In this paper, two operators are defined to denote the parallel and series combinations of circuit elements. The network is represented in a form of expression similar to that of boolean algebra. Some theorems are established to provide a systematic method of determining the minimality of a given network. The mechanism involved is to reduce all the redundant elements by converting the network to its minimal form, which, in general, is Foster's first or second form. In this procedure of network minimization, we are concerned only with the structures of the networks, and are not interested in the actual synthesis procedure.
Persistent Identifierhttp://hdl.handle.net/10722/154893
ISSN
2015 Impact Factor: 0.414
2015 SCImago Journal Rankings: 0.221

 

DC FieldValueLanguage
dc.contributor.authorHo, KLen_US
dc.date.accessioned2012-08-08T08:31:03Z-
dc.date.available2012-08-08T08:31:03Z-
dc.date.issued1989en_US
dc.identifier.citationInternational Journal Of Electronics, 1989, v. 67 n. 3, p. 415-421en_US
dc.identifier.issn0020-7217en_US
dc.identifier.urihttp://hdl.handle.net/10722/154893-
dc.description.abstractIt is always difficult to tell whether a given RC one-port network is realized in the minimal form, and to what extent the number of elements can be reduced if it is not minimal. In this paper, two operators are defined to denote the parallel and series combinations of circuit elements. The network is represented in a form of expression similar to that of boolean algebra. Some theorems are established to provide a systematic method of determining the minimality of a given network. The mechanism involved is to reduce all the redundant elements by converting the network to its minimal form, which, in general, is Foster's first or second form. In this procedure of network minimization, we are concerned only with the structures of the networks, and are not interested in the actual synthesis procedure.en_US
dc.languageengen_US
dc.publisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207217.aspen_US
dc.relation.ispartofInternational Journal of Electronicsen_US
dc.titleSystematic method for determining the minimality of an RC networken_US
dc.typeArticleen_US
dc.identifier.emailHo, KL:klho@eee.hku.hken_US
dc.identifier.authorityHo, KL=rp00117en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0024728660en_US
dc.identifier.volume67en_US
dc.identifier.issue3en_US
dc.identifier.spage415en_US
dc.identifier.epage421en_US
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridHo, KL=7403581592en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats