Symbolic analysis of large-scale networks using a hierarchical signal flowgraph approach

This paper presents an approach suitable for the symbolic analysis of large-scale active networks. The method depends on the partitioning of the network into smaller networks which are then symbolically analyzed noniteratively using the Mason's signal flowgraph models of each partition. The resulting solutions, which are reduced signal flowgraphs (transfer functions) for the subnetworks are then hierarchically combined to produce the final solution or solutions (transfer functions) for the entire system. The advantage of such an approach is the reduction in the number of symbolic terms compared to the conventional approaches, and the ability to analyze hybrid systems consisting of electrical and nonelectrical parts. The result of the analysis is a series of equations that have an upward hierarchical dependency on each other.

[1]  J.L. Huertas,et al.  An advanced symbolic analyzer for the automatic generation of analog circuit design equations , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[2]  R. Mielke,et al.  A new signal flowgraph formulation of symbolic network functions , 1978 .

[3]  Georges Gielen,et al.  ISAAC: a symbolic simulator for analog integrated circuits , 1989, IEEE J. Solid State Circuits.

[4]  J. Vlach,et al.  Generation of immittance functions in symbolic form for lumped distributed active networks , 1974 .

[5]  P. M. Lin,et al.  A survey of applications of symbolic network functions , 1973 .

[6]  J. Vlach,et al.  Symbolic analysis of analog and digital circuits , 1977 .

[7]  Wai-Kai Chen Passive and Active Filters: Theory and Implementations , 1986 .

[8]  M. Hassoun Hierarchical symbolic analysis of large-scale systems using a Mason's signal flow graph model , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[9]  S. J. Mason Feedback Theory-Further Properties of Signal Flow Graphs , 1956, Proceedings of the IRE.

[10]  P. M. Lin,et al.  A new network approach to symbolic simulation of large-scale networks , 1989, IEEE International Symposium on Circuits and Systems,.

[11]  J. Starzyk,et al.  Flowgraph analysis of large electronic networks , 1986 .

[12]  Georges Gielen,et al.  Symbolic analysis for automated design of analog integrated circuits , 1991, The Kluwer international series in engineering and computer science.

[13]  P. R. Adby Tree Enumeration from the Incidence Matrix , 1987 .

[14]  M.L. Liou,et al.  Computer-aided analysis of electronic circuits: Algorithms and computational techniques , 1977, Proceedings of the IEEE.

[15]  P. Lin Symbolic network analysis , 1991 .

[16]  P. M. Lin,et al.  An efficient partitioning algorithm for large-scale circuits , 1990, IEEE International Symposium on Circuits and Systems.

[17]  A. Konczykowska,et al.  Symbolic simulation for efficient repetitive analysis and artificial intelligence techniques in CAD , 1989, IEEE International Symposium on Circuits and Systems,.

[18]  M. M. Hassoun,et al.  Symbolic analysis of large scale networks , 1988 .

[19]  Samuel J. Mason,et al.  Feedback Theory-Some Properties of Signal Flow Graphs , 1953, Proceedings of the IRE.

[20]  Leon O. Chua,et al.  Computer-Aided Analysis Of Electronic Circuits , 1975 .