An algebra for switch-level simulation
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A methodology is presented for computing the steady-state solution of switch-level networks. The method is based on a matrix algebra similar in many respects to circuit nodal analysis. The formulation steps are similar to the nodal equation formulation steps and the network matrix has the same dimension and structure as the nodal admittance matrix, except that logic operations (min and max operations) are used in formulating and solving the network equations. Solution algorithms are then developed using the new algebra. The approach has been implemented as a part of a mixed-mode simulator which uses partitioning and sparse matrix solution techniques in analyzing a circuit. In its switch-level mode, the simulator can perform logic and concurrent fault simulation using realistic fault models, including bridging faults, and has been found to be competitive with existing switch-level simulators.Keywords
This publication has 5 references indexed in Scilit:
- Algorithmic Aspects of Symbolic Switch Network AnalysisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- COSMOS: a compiled simulator for MOS circuitsPublished by Association for Computing Machinery (ACM) ,1987
- A Survey of Switch-Level AlgorithmsIEEE Design & Test of Computers, 1987
- A Switch-Level Model and Simulator for MOS Digital SystemsIEEE Transactions on Computers, 1984
- A unified switching theory with applications to VLSI designProceedings of the IEEE, 1982