Minimizing ROBDD size of incompletely specified multiple output functions
- 17 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 620-624
- https://doi.org/10.1109/edtc.1994.326921
Abstract
[[abstract]]The size of ROBDD is essential in many applications. In this paper, we propose a heuristic that minimizes ROBDD size for incompletely specified multiple output functions. Our technique involves giving a new interpretation of ROBDDs with an extra variable, Z, for incompletely specified functions. This new interpretation allows us to assign don't cares to either the on-set or the off-set yielding an efficient minimization of ROBDD size. The extra variable Z carries the information of the don't cares and preserves the flexibility of choosing the best cover for a given incompletely specified function. Starting from the top level of an ROBDD, we minimize greedily the number of nodes at every level by assigning as few don't cares as possible to either the on-set or the off-set. We propagate the remaining unused don't cares to lower levels of an ROBDD by moving the extra variable downwards. We performed three sets of experiments. The results are very encouraging.[[fileno]]2030219030024[[department]]資訊工程學This publication has 7 references indexed in Scilit:
- An improved synthesis algorithm for multiplexor-based PGAsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Technology mapping via transformations of function graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A unified framework for the formal verification of sequential circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Shared binary decision diagram with attributed edges for efficient Boolean function manipulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Logic Minimization Algorithms for VLSI SynthesisPublished by Springer Nature ,1984
- Minimization Over Boolean GraphsIBM Journal of Research and Development, 1962