A. Hett, R. Drechsler, B. Becker, Reordering Based Synthesis, in Proc. of the 3rd Int. Workshop on Applications of the Reed-Muller Expansion in Circuit Design (RM'97), Oxford, UK, 1997, 13-22. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Improving XOR-Node Placement for ⊕-OBDDs - Meinel, Sack (2001) (Correct)
....in size, spending this additional amount of time is worth while. The achieved results could be further improved by changing the positions of the already introduced nodes. Exchanging a branching node with an adjacent node e ects the OBDD only locally and thus, can be computed rather fast [7, 11]. Based on this technique, in combination with the proposed algorithm, new heuristics can be developed for further OBDD 4 OBDD Size c MAX (pDE) MAX (nDE) ADD 0.6 3.634.456 81.3 3.216.892 72.0 3.214.424 71.9 0.7 3.633.394 81.3 3.215.694 72.0 3.212.698 71.9 0.8 3.469.411 77.6 ....
A. Hett, R. Drechsler, B. Becker, Reordering Based Synthesis, in Proc. of the 3rd Int. Workshop on Applications of the Reed-Muller Expansion in Circuit Design (RM'97), Oxford, UK, 1997, 13-22.
Heuristics for ⊕-OBDD Minimization - Meinel, Sack (2001) (Correct)
....is rather important [MS00] In this paper we introduce a heuristic based on dynamic adjustment of node positions for reducing OBDD size, called the jiggle heuristic. Similar as in the case of exchanging adjacent variables in OBDDs, nodes can be exchanged with adjacent branching nodes [HDB97]. But, for performing this task eciently with OBDDs, it is rather important to consider some speci c implementational details [MS99] The jiggleheuristic can be applied after the synthesis of the OBDD is nished, but also during synthesis time, for avoiding peak memory sizes that otherwise, ....
....and the position of the introduced nodes determines heavily the size of OBDDs. This motivates the development of methods for changing the position of already existing nodes and thus, the development of heuristics for OBDD minimization by applying these relocation techniques. As shown in [HDB97], the exchange of arbitrary binary operator nodes with branching nodes remains a local operation and therefore, is eciently computable. For OBDDs, we have to adapt this algorithm, because often it might be the case that nodes are not only adjacent to branching nodes. But, on a path between any ....
A. Hett, R. Drechsler, B. Becker, Reordering Based Synthesis, in Proc. of the 3rd Int. Workshop on Applications of the Reed-Muller Expansion in Circuit Design (RM'97), Oxford, UK, 1997, 13-22.
On the Construction of Multiple-Valued Decision Diagrams - Miller, Drechsler (2002) Self-citation (Drechsler) (Correct)
....edge negations in BDDs [10,13,14] In moving to MDDs, the concept of edge negation can be generalized. In [9] the present authors considered the use of cyclic negations on edges. Here we employ cyclic negations and complements together. Adjacent level interchange and operator node techniques [5,6] based on adjacent level interchange for MDDs were considered in [9] Here our concern, as in [4] is to construct the MDD as efficiently as possible and to minimize the implementation complexity of the MDD package. To that end, adjacent level interchange, dynamic variable reordering [12] and ....
Hett, A., R. Drechsler and B. Becker, "Reordering based synthesis," Proc. Reed-Muller Workshop 97,
Variable Reordering for ⊕-OBDDs - Meinel, Sack (2003) (Correct)
No context found.
A. Hett, R. Drechsler, B. Becker, Reordering Based Synthesis, in Proc. of the 3rd Int. Workshop on Applications of the Reed-Muller Expansion in Circuit Design (RM'97), Oxford, UK, 1997, 13-22.
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