File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/CYBER.2013.6705465
- Scopus: eid_2-s2.0-84893952737
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Complexity analysis of general realization procedures for passive networks
Title | Complexity analysis of general realization procedures for passive networks |
---|---|
Authors | |
Keywords | Passive network synthesis Realization procedure Complexity Inerter |
Issue Date | 2013 |
Publisher | IEEE. 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? |
Abstract | This 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 Identifier | http://hdl.handle.net/10722/189987 |
ISBN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, MZ | en_US |
dc.contributor.author | Wang, K | en_US |
dc.contributor.author | Du, B | en_US |
dc.contributor.author | Zou, Y | en_US |
dc.date.accessioned | 2013-09-17T15:04:30Z | - |
dc.date.available | 2013-09-17T15:04:30Z | - |
dc.date.issued | 2013 | en_US |
dc.identifier.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 | en_US |
dc.identifier.isbn | 978-1-4799-0612-3 | - |
dc.identifier.uri | http://hdl.handle.net/10722/189987 | - |
dc.description.abstract | This 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.language | eng | en_US |
dc.publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1800486 | - |
dc.relation.ispartof | IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems Proceedings | en_US |
dc.subject | Passive network synthesis | - |
dc.subject | Realization procedure | - |
dc.subject | Complexity | - |
dc.subject | Inerter | - |
dc.title | Complexity analysis of general realization procedures for passive networks | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Chen, MZ: mzqchen@hku.hk | en_US |
dc.identifier.authority | Chen, MZ=rp01317 | en_US |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/CYBER.2013.6705465 | - |
dc.identifier.scopus | eid_2-s2.0-84893952737 | - |
dc.identifier.hkuros | 221521 | en_US |
dc.identifier.spage | 314 | en_US |
dc.identifier.epage | 319 | en_US |
dc.publisher.place | United States | en_US |
dc.customcontrol.immutable | sml 140523 | - |