Simulation of MOS Circuits by Decision Diagrams

This paper describes a novel approach to switch-level simulation of MOS circuits. The circuit is first partitioned into connector-switch networks CSN [4]. Then each CSN is represented in terms of a decision diagram DD, which is particularly suitable for use in simulators. The advantages of DD's are that they are based on a solid theory and they permit fast evaluation of the network's response to any input vector. The CSN's are coupled through a 3-state automaton representing charge wells associated with transistor gates.

[1]  Eduardo Sanchez,et al.  Synthesis of Minimal Binary Decision Trees , 1979, IEEE Transactions on Computers.

[2]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[3]  J. Hayes.  A unified switching theory with applications to VLSI design , 1982, Proceedings of the IEEE.

[4]  Jan van Leeuwen,et al.  Worst-case Analysis of Set Union Algorithms , 1984, JACM.

[5]  André Thayse,et al.  Synthesis and Optimization of Programs by Means of P-Functions , 1982, IEEE Transactions on Computers.

[6]  Randal E. Bryant,et al.  A Switch-Level Model and Simulator for MOS Digital Systems , 1984, IEEE Transactions on Computers.

[7]  Eduard Cerny,et al.  An Approach to Unified Methodology of Combinational Switching Circuits , 1977, IEEE Transactions on Computers.

[8]  A.E. Ruehli,et al.  Circuit analysis, logic simulation, and design verification for VLSI , 1983, Proceedings of the IEEE.

[9]  John P. Hayes,et al.  An Experimental MOS Fault Simulation Program CSASIM , 1984, 21st Design Automation Conference Proceedings.