File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Complexity analysis of general realization procedures for passive networks

TitleComplexity analysis of general realization procedures for passive networks
Authors
KeywordsPassive network synthesis
Realization procedure
Complexity
Inerter
Issue Date2013
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1800486
Citation
The 3rd Annual IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems (CYBER 2013), Nanjing, China, 26-29 May 2013. In Conference Proceedings, 2013, p. 314-319 How to Cite?
AbstractThis paper is concerned with the complexity of general realization procedures for passive network synthesis. The concept of the complexity of a realization procedure is first defined. As a consequence, the expressions of the complexity of Bott-Duffin procedure, that of modified Bott-Duffin procedure, and that of Miyata procedure (n + 1 ladder breakdown) are derived. In addition, we obtain an upper bound of the complexity of modified Miyata procedure (tree breakdown), which is shown to be less than the complexities of the previous three procedures, and has a well approximation at low degrees. Furthermore, two kinds of procedures that combine modified Miyata procedure and modified Bott-Duffin procedure are investigated in terms of their complexities. The comparison between the complexities of these two procedures is made, and sufficient conditions for them to be less complex than the modified Bott-Duffin procedure are presented. Besides, some results of this paper are illustrated by a table and several figures. © 2013 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/189987
ISBN

 

DC FieldValueLanguage
dc.contributor.authorChen, MZen_US
dc.contributor.authorWang, Ken_US
dc.contributor.authorDu, Ben_US
dc.contributor.authorZou, Yen_US
dc.date.accessioned2013-09-17T15:04:30Z-
dc.date.available2013-09-17T15:04:30Z-
dc.date.issued2013en_US
dc.identifier.citationThe 3rd Annual IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems (CYBER 2013), Nanjing, China, 26-29 May 2013. In Conference Proceedings, 2013, p. 314-319en_US
dc.identifier.isbn978-1-4799-0612-3-
dc.identifier.urihttp://hdl.handle.net/10722/189987-
dc.description.abstractThis paper is concerned with the complexity of general realization procedures for passive network synthesis. The concept of the complexity of a realization procedure is first defined. As a consequence, the expressions of the complexity of Bott-Duffin procedure, that of modified Bott-Duffin procedure, and that of Miyata procedure (n + 1 ladder breakdown) are derived. In addition, we obtain an upper bound of the complexity of modified Miyata procedure (tree breakdown), which is shown to be less than the complexities of the previous three procedures, and has a well approximation at low degrees. Furthermore, two kinds of procedures that combine modified Miyata procedure and modified Bott-Duffin procedure are investigated in terms of their complexities. The comparison between the complexities of these two procedures is made, and sufficient conditions for them to be less complex than the modified Bott-Duffin procedure are presented. Besides, some results of this paper are illustrated by a table and several figures. © 2013 IEEE.-
dc.languageengen_US
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1800486-
dc.relation.ispartofIEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems Proceedingsen_US
dc.rightsIEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems. Copyright © IEEE.-
dc.rights©2013 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectPassive network synthesis-
dc.subjectRealization procedure-
dc.subjectComplexity-
dc.subjectInerter-
dc.titleComplexity analysis of general realization procedures for passive networksen_US
dc.typeConference_Paperen_US
dc.identifier.emailChen, MZ: mzqchen@hku.hken_US
dc.identifier.authorityChen, MZ=rp01317en_US
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/CYBER.2013.6705465-
dc.identifier.scopuseid_2-s2.0-84893952737-
dc.identifier.hkuros221521en_US
dc.identifier.spage314en_US
dc.identifier.epage319en_US
dc.publisher.placeUnited Statesen_US
dc.customcontrol.immutablesml 140523-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats