Macrosimulation with Quasi-General Symbolic FET Macromodel and Functional Latency
- 1 January 1979
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 229-234
- https://doi.org/10.1109/dac.1979.1600112
Abstract
This paper evaluates our attempt to solve the large network analysis problems in the time domain by use of a simulation method with computation efficiency and program simplicity. We present a Quasi-general Symbolic FET Macromodel (QGSM) which can represent many different logic function gates; hence, the simulation program needs only one macromodel QGSM. We also discuss the Functional Latency Concept (FLC). With FLC we can avoid analyzing more inactive subnetworks to realize savings in CPU time. Finally, we describe a triple-iteration loop method which can be readily incorporated into the time-domain analysis. The experimental program exhibits topological flexibility, computational accuracy, and programming simplicity.Keywords
This publication has 5 references indexed in Scilit:
- AUTOMATION OF SIMPLIFICATION IN DISCRETE EVENT MODELLING AND SIMULATION*International Journal of General Systems, 1990
- A latent macromodular approach to large-scale sparse networksIEEE Transactions on Circuits and Systems, 1976
- MOTIS-An MOS timing simulatorIEEE Transactions on Circuits and Systems, 1975
- Algorithms for ASTAP--A network-analysis programIEEE Transactions on Circuit Theory, 1973
- The Sparse Tableau Approach to Network Analysis and DesignIEEE Transactions on Circuit Theory, 1971