AN ALGORITHM FOR GENERATING ALL PASSIVE-EDGE COMPLETE k-TREE AND ITS APPLICATION IN THE ANALYSIS OF ACTIVE NETWORKS

Fang Dazhong

Volume 13 Issue 5

Sep. 1991

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 1991 > 13(5): 548-551

Fang Dazhong. AN ALGORITHM FOR GENERATING ALL PASSIVE-EDGE COMPLETE k-TREE AND ITS APPLICATION IN THE ANALYSIS OF ACTIVE NETWORKS[J]. Journal of Electronics & Information Technology, 1991, 13(5): 548-551.

Citation:

Fang Dazhong. AN ALGORITHM FOR GENERATING ALL PASSIVE-EDGE COMPLETE k-TREE AND ITS APPLICATION IN THE ANALYSIS OF ACTIVE NETWORKS[J]. Journal of Electronics & Information Technology, 1991, 13(5): 548-551.

Citation:

PDF( 719 KB)

AN ALGORITHM FOR GENERATING ALL PASSIVE-EDGE COMPLETE k-TREE AND ITS APPLICATION IN THE ANALYSIS OF ACTIVE NETWORKS

Fang Dazhong

Received Date: 1990-03-15
Rev Recd Date: 1990-10-15
Publish Date: 1991-09-19

Abstract

Abstract

An efficient algorithm for generating all passive-edge complete k-trees in symbolic form for general linear active networks is presented. This algorkhm, which is based on Minty s method, processes the topological graph of an active network directly. It can solve he problem of sign evaluation, and can reduce the number of cancellation terms greatly. Finally, an example is given to show its applicarion in the analysis of linear active networks.

FullText(HTML)

References(1)

References

G.J. Minty, IEEE Trans, on CT, CT-12 (1965)3, 119.[2]房大中,天津大学学报,1988年,第4期,第108页.[3]W. Mayeda.[J].Craph Theory, John Wiley Sons, Inc.1972,:-[4]W. K: Chen, IEEE Trans. on CT, CT-12 (1965)3, 85.[5]全茂达,朱英辉编,符号网络函数与不定导纳矩阵,高等教育出版社,1984年.[6]黄汝激,电子学报,1987年,第5期,第8页.

Relative Articles

Supplements(0)

Cited By

Proportional views