Symbolic Analysis of Large-Scale Networks Using a Hierarchical Signal Flowgraph Approach

Hassoun, M.; McCarville, Kevin S.

doi:10.1007/978-1-4615-3240-8_2

Cited by 6 publications

(9 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Both methods can exploit circuit partitioning; however, the results show the methods to be comparable for circuits where the Mason's signal flowgraph of a circuit has a one-to one branch correspondence with circuit elements, namely ideal opamp circuits [29]. Table 111 shows that SCAPP results are more efficient for cases where the branches in MASSAP do not exhibit a one-to-one cor-BLOCK Fig.…”

Section: Resultsmentioning

confidence: 94%

“…The first is the analysis of a band-pass filter circuit (Fig. 5) that was simulated using the other two hierarchical symbolic approaches that use sequence of expressions: the Coates flowgraph approach [28] and the Mason's signal flowgraph approach (MASSAP) [29]. The results are presented in Table I in terms of the efficiency of the output expressions.…”

Section: Resultsmentioning

confidence: 99%

“…Two topological analysis methods for symbolic simulation of large-scale circuits have been proposed in [28] and in [29]. The first method utilizes the sequence ofexpressions idea to obtain the transfer functions.…”

Section: Hierarchical Methodsmentioning

confidence: 99%

“…The method is aimed at analyzing large circuits in the size range of thousands of nodes. All previous symbolic methods proposed for largescale circuits have been based on a flowgraph approach [28], [29]. The result is the production of a Symbolic Circuit Analysis Program with Partitioning (SCAPP).…”

Section: The Network Approachmentioning

confidence: 99%

See 3 more Smart Citations

A hierarchical network approach to symbolic analysis of large-scale networks

Hassoun

Lin

1995

IEEE Trans. Circuits Syst. I

View full text Add to dashboard Cite

Abstruct-A hierarchical approach to the problem of symbolic circuit analysis of large-scale circuits is presented in this paper. The methodology has been implemented in a computer program called SCAPP (Symbolic Circuit Analysis Program with Partitioning). The method solves the problem by utilizing a hierarchical network approach and the sequence of expressions concept rather than a topological approach and the single expression idea which have dominated symbolic analysis in the past. The result is a linear growth (for real circuits) in the number of terms in the symbolic solutions for the network approach versus the exponential growth exhibited by traditional methods. The analysis methodology uses a Reduced Modified Nodal Analysis (RMNA) techdque that allows the characterization of symbolic networks in terms of only a small subset of the network variables (external variables). The analysis algorithm is most efficient when network partitioning is used. Partitioning results in a reduction in the number of terms in the symbolic solutions.

show abstract

Section: Resultsmentioning

confidence: 94%

Section: Resultsmentioning

confidence: 99%

Section: Hierarchical Methodsmentioning

confidence: 99%

Section: The Network Approachmentioning

confidence: 99%

See 2 more Smart Citations

A hierarchical network approach to symbolic analysis of large-scale networks

Hassoun

Lin

1995

IEEE Trans. Circuits Syst. I

View full text Add to dashboard Cite

show abstract

“…Several symbolic simulators exist, such as SNAP [1], FLOWUP [2], ISAAC [3], ASAP [4], BRAINS [5], SYNAP [6], SSPICE [7], MASSAP [8], SCAPP [9], EASY [10], and SAPWIN [11], in addition to programs in [12] and [13]. These programs can be used to generate the initial transfer functions for the P/G networks.…”

Section: Introductionmentioning

confidence: 99%

An algorithm for simulating power/ground networks using Pade approximants and its symbolic implementation

Shah

Younis

Sapatnekar

et al. 1998

IEEE Trans. Circuits Syst. II

View full text Add to dashboard Cite

This paper presents an event-driven algorithm and its symbolic implementation for the analysis of power and ground (P/G) bus networks. The algorithm uses frequency-domain techniques and moment matching approaches based on Padé approximants to estimate the transfer function at each node in the P/G network. Afterwards, the transient waveforms are extracted for each node. The process requires repetitive simulation of a linear and time-variant (from one time event to the next) circuit model for the P/G network which is the reason a symbolic implementation was produced. The P/G network is modeled by a hierarchical combination of mesh and tree structures that are composed of a collection of RC--segments and pulldown (or pullup) switches. The switches are symbolically represented by Boolean variables and a compiled symbolic code is generated only once for each P/G network. The transient waveforms are then produced by repetitive evaluation of the symbolic output. The results show that the symbolic implementation is an order of magnitude faster, with reasonably good accuracy, than using a traditional analog circuit simulator like SPICE.Index Terms-Padé approximants, power/ground networks, symbolic analysis, VLSI.

show abstract

Generation of sequential symbolic network functions for large-scale networks by circuit reduction to two-port

Pierzchala¹,

Rodanski

2001

IEEE Trans. Circuits Syst. I

View full text Add to dashboard Cite

The major stumbling block in symbolic analysis of large-scale circuits is the exponential growth of expression complexity with the circuit size. Sequential techniques, introduced more than a decade ago, reduced that growth to quasi-linear. The fundamental assumption in all sequential methods developed so far was that the circuit must be decomposed in order to reduce the complexity of the final expression. In this paper we will show conclusively that this is not the case. We describe a new algebraic approach to symbolic analysis of large-scale networks, based on the reduction of the compacted modified node admittance matrix to a two-port matrix. No circuit partitioning is required. Internal variables are suppressed one by one using Gaussian elimination. To minimise the number of symbolic operations we employ a locally optimal pivoting strategy. Formula complexity is estimated to grow quasi-linearly with circuit size. The technique is conceptually very simple and produces sequential formulae of significantly lesser complexity than any exact method published to date.

show abstract

Symbolic Analysis of Large-Scale Networks Using a Hierarchical Signal Flowgraph Approach

Cited by 6 publications

References 10 publications

A hierarchical network approach to symbolic analysis of large-scale networks

A hierarchical network approach to symbolic analysis of large-scale networks

An algorithm for simulating power/ground networks using Pade approximants and its symbolic implementation

Generation of sequential symbolic network functions for large-scale networks by circuit reduction to two-port

Contact Info

Product

Resources

About