No abstract

No abstract

Boolean value a, then node q must be initialized to a to avoid unit delay oscillation. Furthermore, the initialization of state nodes and their related nodes has to be done during the appropriate clock phases. This makes this technique very tedious and unsuitable for automation. Kam and Subrahmanyam [12] use Anamos [4] to produce a set of network excitation functions for a switch-level network. These excitation functions are converted to a symbolic transition relation which is then transformed by means of a fixed point computation to yield a transition relation for the phase-level response of the network. Existential quantification to hide the clock yields the cycle-level transition relation. The fixed point computation done in this method computes the steady state phase-level response of a network. Our work shows that a symbolic simulator can compute the steady state phase-level response of a network and do so much more efficiently. As the number of phases increase in a clock cycle, the number of symbolic values introduced to compute the cycle-level transition relation increases. This can lead to very large Ordered Binary Decision Diagrams (OBDDs) [2]. Also for circuits like the one in figure 2, the fixed point computation will never converge [11]. Anamos identifies s1 and q as charge storage nodes and when Phi1 is 0, the circuit will not stabilize for similar initial values on s1 and q. Consider the symbolic values a on node s1 and

No abstract

No abstract