J. Bern, C. Meinel, and A. Slobodova. Some heuristics for generating tree-like FBDD types. Technical Report 94-03, Universitat Trier, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Implementation of Read-k-times BDDs on top of standard BDD.. - Günther, Drechsler (2001) (Correct)
....but the ordering along di erent paths does not have to be the same. However, to retain canonicity in FBDDs an additional data structure, called the FBDD type, has to be constructed and nding an FBDD type without user interaction turns out to be at least as dicult as nding an ordering for an OBDD [3]. Furthermore, standard OBDD packages have to be changed signi cantly to allow handling of FBDDs. An other approach to increase the expressive power of OBDDs is to relax the read once property: In read k times BDDs, nodes are still grouped to levels which consist of nodes labeled by the same ....
J. Bern, C. Meinel, and A. Slobodova. Some heuristics for generating tree-like FBDD types. IEEE Trans. on CAD, 15:127-130, 1996.
A Comparison Of Free BDDs And Transformed BDDs - Sieling, Wegener (Correct)
....advantages and disadvantages of a BDD model. The total information gained from these experiments and the theoretical investigations can support the decision which BDD model should be chosen in a specific situation. In this paper we investigate FBDDs and TBDDs. For experimental results we refer to Bern, Meinel, and Slobodova (1995, 1996) and to Bern, Gergov, Meinel and Slobodova (1994) Hence, we concentrate on theoretical investigations. FBDDs and TBDDs are defined in Section 2. Then it is shown in Section 3 that the size of FBDDs and TBDDs based on the same graph ordering cannot di#er too much. In Section 5 it is shown that the ....
....input a # 0, 1 n an edge may lead from an x i node to an x j node only if x i precedes x j with respect to G(a) G FBDDs are a canonical representation of Boolean functions. E#cient algorithms on G FBDDs have been described by Gergov and Meinel (1994) and by Sieling and Wegener (1995) Bern, Meinel, and Slobodova (1996) have presented some heuristics to find good graph orderings. Another variant of OBDDs which allows di#erent variable orderings for 3 di#erent inputs are Partitioned OBDDs. Partitioned OBDDs have been introduced and analyzed by Narayan, Jain, Fujita, and Sangiovanni Vincentelli (1996) We only ....
Bern, J., Meinel, C., and Slobodova, A. (1996). Some heuristics for generating tree-like FBDD types. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems 15, 127--130.
A Comparison Of Free BDDs And Transformed BDDs - Sieling, Wegener (Correct)
....input a 2 f0; 1g n an edge may lead from an x i node to an x j node only if x i precedes x j with respect to G(a) G FBDDs are a canonical representation of Boolean functions. Efficient algorithms on G FBDDs have been described by Gergov and Meinel (1994) and by Sieling and Wegener (1995) Bern, Meinel, and Slobodov a (1996) have presented some heuristics to find good graph orderings. Another variant of OBDDs which allows different variable orderings for different inputs are Partitioned OBDDs. Partitioned OBDDs have been introduced and analyzed by Narayan, Jain, Fujita, and Sangiovanni Vincentelli (1996) We only ....
Bern, J., Meinel, C., and Slobodov'a, A. (1996). Some heuristics for generating tree-like FBDD types. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems 15, 127--130.
Minimization of Free BDDs - Günther, Drechsler (1999) (Correct)
....[9, 10] Especially if BDDs are used in synthesis, the resulting size is very important. Furthermore, it has been observed by many authors that their methods proposed for OBDDs can be directly transferred to FBDDs (see e.g. 1] Therefore, in the past first heuristics have been proposed [12, 2], but none could improve the results in comparison to OBDDs, i.e. the best sizes known for OBDDs could only be improved for some hand designed examples. In this paper, we present the first exact algorithm to determine a minimal representation as FBDD for a given Boolean function. It will be ....
J. Bern, C. Meinel, and A. Slobodov'a. Some heuristics for generating tree-like FBDD types. IEEE Trans. on CAD, 15:127--130, 1996.
Formal Verification of Combinational Circuits - Jain, Narayan, Fujita.. (1997) (5 citations) (Correct)
....same order. The variable ordering for different assignments might be different. Unfortunately, the practical problems in choosing a good type can greatly reduce the flexibility gained from relaxing the variable ordering constraints. Some heuristics for generating typed Free BDDs were presented in [7, 6]. Typed free BDDs extend the class of functions which can be represented in polynomial space but there are still some practical functions for which Free BDDs are exponential (e.g. integer multiplier) 2.5 Partitioned ROBDDs All the BDD methods discussed so far represent a function over the ....
J. Bern, C. Meinel, and A. Slobodova. Some Heuristics for Generating Tree-like FBDD Types. IEEE Transactions on Computer-Aided Design, pages 127--134, January 1996.
The Complexity of Minimizing FBDDs - Sieling (Correct)
....that (similar to OBDDs) the size of a G FBDD for a particular function may strongly depend on the chosen graph ordering G. So it is an important problem to choose a good graph ordering. A heuristic for computing graph orderings of a tree like shape has been proposed by Bern, Meinel and Slobodova [2]. An algorithm with a double exponential worst case run time for minimizing FBDDs was presented by Gunther and Drechsler [10] This algorithm can also be used to compute optimal graph orderings, since for each FBDD H a graph ordering G can easily be computed so that H is a G FBDD, see Sieling and ....
Bern, J., Meinel, C. and Slobodova, A. (1996). Some heuristics for generating tree-like FBDD types. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15, 127--130.
Succinct Representation of Graphs - Project Report For (Correct)
No context found.
J. Bern, C. Meinel, and A. Slobodova. Some heuristics for generating tree-like FBDD types. Technical Report 94-03, Universitat Trier, 1994.
Binary Decision Diagrams - Bollig, Sauerhoff, Sieling, Wegener (Correct)
No context found.
Bern, J., Meinel, C., and Slobodova, A. (1996). Some heuristics for generating treelike FBDD types. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems 15, 127--130.
Bi-Partition of Shared Binary Decision Diagrams - Matsuura, Sasao, Butler, Iguchi (2001) (Correct)
No context found.
J. Bern, C. Meinel, and A. Slobodova, "Some heuristics for generating tree-like FBDD types," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems 15, pp. 127-130, 1996.
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