Gabodi, G.; Camurati, P.; Lavagno, L.; and Quer, S. 1997. Disjunctive partitioning and partial iterative squaring. In Proceedings of the 34th Design Automation Conference DAC-97.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....If the size of the resulting cofactors is still relatively large, the substitution of intermediate variables can be prohibitive in both space and time. In order to simplify the problem, we perform a disjunctive decomposition of these cofactors into smaller BDDs ( B 3 9 ) according to [25], and then substitute the intermediate variables. Since these decomposed BDDs are much smaller, the substitution process is quite fast, as verified by experimentation. The authors wish to point out that the algorithm BSAT is not particularly targeted for solving SAT problems for multipliers. There ....

G. Cabodi and et al., "Disjunctive Partitioning and Partial Iterative Squaring: An Effective Approach for Symbolic Traversal of Large Circuits", in Proc. DAC, '97.

....need to be constructed can grow extremely large, exhausting the memory resources of the simulation host machine and or causing severe performance degration. In order to overcome this limitation, various solutions have been proposed that try to contain the size of the BDDs involved, for instance: [4, 5, 6]. An alternative approach is symbolic simulation. This me thod verifies a set of scalar tests with a single symbolic vector. Symbolic functions (represented by BDD) are assigned to the inputs and propagated through the circuit to the outputs. see Figure 1. below) This method is used in [7] and ....

G. Cabodi, P. Camurati, L. Lavagno, and S.Quer. Disjunctive partitioning and partial iterative squaring: an effective approach for symbolic traversal of large circuits. In DAC, Proceedings of the Design Automation Conference, pages 728--733, June 1997.

....If the size of the resulting cofactors is still relatively large, the substitution of intermediate variables can be prohibitive in both space and time. In order to simplify the problem, we perform a disjunctive decomposition of these cofactors into smaller BDDs (f = f 1 f 2 ) according to [25], and then substitute the intermediate variables. Since these decomposed BDDs are much smaller, the substitution process is quite fast, as verified by experimentation. The authors wish to point out that the algorithm BSAT is not particularly targeted for solving SAT problems for multipliers. ....

G. Cabodi and et al., "Disjunctive Partitioning and Partial Iterative Squaring: An Effective Approach for Symbolic Traversal of Large Circuits", in Proc. DAC, '97.

....candidate for this approximation is the transitive closure. Although the computation of the transitive closure for digital systems has been shown to 139 be a costly operation [MMB93] some ideas have already been proposed to provide powerful approximations in the context of reachability analysis [CCLQ97] These approximation could prove useful in the context of automatic abstraction. More generally, the procedures used to create approximations are not fully aware of the refinement process. When considered in this context, several optimizations could be done that would translate in yet a more ....

G. Cabodi, P. Camurati, L. Lavagno, and S. Quer. Disjunctive partitioning and partial iterative squaring: an effective approach for symbolic traversal of large circuits. In Proceedings of the Design Automation Conference, pages 728--733, Anaheim, CA, June 1997.

....basic symbolic FSM traversal techniques have been proposed. To avoid huge BDD representations of monolithic transition relations for large FSMs, decomposition has been used: conjunctive partitioning for approximate FSM traversal (e.g. 7] and disjunctive partitioning for exact FSM traversal (e.g. [4, 10]) Other researchers replaced the pure breadth rst traversal of the original approach by a sequence of partial traversals [12, 5] These methods take into account that traversals often produce the largest BDDs during intermediate steps. Therefore a sequence of simpler partial traversals is used ....

G. Cabodi, P. Camurati, L. Lavagno, and S. Quer. Disjunctive partitioning and partial iterative squaring: An eective approach for symbolic traversal of large circuits. Design Automation Conf., 34:728-733, 1997.

....of the basic symbolic FSM traversal techniques have been proposed. To avoid huge BDD representations of monolithic TRs for large FSMs, decomposition has been used: conjunctive partitioning for approximate FSM traversal (e.g. 7] and disjunctive partitioning for exact FSM traversal (e.g. [4, 11]) Taking into account that the largest BDDs often occur during intermediate steps, other researchers replaced the pure breadth rst traversal of the original approach by a sequence of partial traversals [12, 5] Thus a sequence of simpler partial traversals is used to avoid large intermediate ....

G. Cabodi, P. Camurati, L. Lavagno, and S. Quer. Disjunctive partitioning and partial iterative squaring: An eective approach for symbolic traversal of large circuits. Design Automation Conf., 34:728-733, 1997.

.... this area by the introduction of so called symbolic techniques, which are based on the application of binary decision diagrams (BDDs) to traverse the state space (see e.g. 2] for an overview) Although these techniques can conceivably handle large circuits and are still being improved (see e.g. [3]) they cannot be expected to scale well with circuit size for many types of circuits. For combinational equivalence checking, the state ofthe art verification methods combine a powerful base verification algorithm with techniques to exploit the structural similarities of the circuits under ....

G. Cabodi, et al., "Disjunctive Partitioning and Partial Iterative Squaring: An Effective Approach for Symbolic Traversal of Large Circuits", Proc. 34th DAC, pp. 728--733, 1997.

....traversals [8] An invariant is precisely a superset of the reachable states. Their method is more automatic, while the in9 variants we suggest rely on the designer s knowledge on the synchronization of the system. They also independently propose disjunctive partitioning for synchronous circuits [7]. They require the designer to come up with a partition manually, and we again exploit mutually exclusive events. In work also independent of ours, Heimdahl and Whalen [18] use a dependency analysis technique similar to the one described Section 6.1, but their motivation is to facilitate manual ....

G. Cabodi, P. Camurati, L. Lavagno, and S. Quer. Disjunctive partitioning and partial iterative squaring: An effective approach for symbolic traversal of large circuits. In 34th Design Automation Conference, Proceedings 1997, pages 728--733, Anaheim, CA, USA, June 1997. ACM.

....traversal) may be a dead end . As a consequence, the convergence test, i.e. checking for a global xed point, requires a deadend recovery procedure, i.e. computing the image of the overall set of reached states. Partitioning based on Shannon decomposition is the inspiring idea of [4] [5], 6] 7] Partitions are obtained by selecting splitting variables or, in the more general case, window functions. In [4] 7] BDD s are automatically and dynamically partitioned, using Boole s decomposition theorem, whenever their size is larger than a threshold. Ef ciency relies on good ....

.... window functions. In [4] 7] BDD s are automatically and dynamically partitioned, using Boole s decomposition theorem, whenever their size is larger than a threshold. Ef ciency relies on good decomposition routines which have a low complexity and produce balanced and small size partitions. In [5] partitioning is a manual task and traversals follow the interleaved breadth depth rst idea. The target is to optimize traversals following the modes or sub behaviors of the circuit, to avoid intermediate memory blow ups. In [6] the state space is partitioned statically using cubes as easily ....

[Article contains additional citation context not shown here]

G. Cabodi, P. Camurati, L. Lavagno, and S. Quer. Disjunctive Partitioning and Partial Iterative Squaring: an eective approach for symbolic traversal of large circuits. In Proc. EDA/SIGDA/ACM/IEEE DAC'97, pages 728-733, Anaheim, California, June 1997.

No context found.

Gabodi, G.; Camurati, P.; Lavagno, L.; and Quer, S. 1997. Disjunctive partitioning and partial iterative squaring. In Proceedings of the 34th Design Automation Conference DAC-97.

No context found.

G. Cabodi, P. Camurati, L. Lavagno, and S. Quer. Disjunctive partitioning and partial iterative squaring: An effective approach for symbolic traversal of large circuits. In Design Automation Conf., pages 728--733, 1997.

No context found.

G. Cabodi, P. Camurati, L. Lavagno, and S. Quer. Disjunctive partitioning and partial iterative squaring: an eective approach for symbolic traversal of large circuits. In Proc. DAC97, pp. 728-733, 1997.

No context found.

G. Gabodi, P. Camurati, L. Lavagno, and S. Quer. Disjunctive partitioning and partial iterative squaring. In Proceedings of the 34th Design Automation Conference DAC97, 1997.

No context found.

G. Cabodi, P. Camurati, L. Lavagno, and S. Quer. Disjunctive Partitioning and Partial Iterative Squaring: An Effective Approach for Symbolic Traversal of Large Circuits. In Design Automation Conf., 1997.

No context found.

G. Cabodi, P. Camurati, L. Lavagno, and S. Quer. Disjunctive Partitioning and Partial Iterative Squaring: An Effective Approach for Symbolic Traversal of Large Circuits. In Design Automation Conf., 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC