## On the Relation Between BDDs and FDDs (1995)

Venue: | INFORMATION AND COMPUTATION |

Citations: | 26 - 12 self |

### BibTeX

@INPROCEEDINGS{Becker95onthe,

author = {Bernd Becker and Rolf Drechsler and Ralph Werchner},

title = {On the Relation Between BDDs and FDDs},

booktitle = {INFORMATION AND COMPUTATION},

year = {1995},

pages = {72--83},

publisher = {}

}

### OpenURL

### Abstract

Data structures for Boolean functions build an essential component of design automation tools, especially in the area of logic synthesis. The state of the art data structure is the ordered binary decision diagram (OBDD), which results from general binary decision diagrams (BDDs), also called branching programs, by ordering restrictions. In the context of EXOR-based logic synthesis another type of decision diagram (DD), called (ordered) functional decision diagram ((O)FDD) becomes increasingly important. We study the relation between (ordered, free) BDDs and FDDs. Both, BDDs and FDDs, result from DDs by defining the represented function in different ways. If the underlying DD is complete, the relation between both types of interpretation can be described by a Boolean transformation . This allows us to relate the FDD-size of f and the BDD-size of (f) also in the case that the corresponding DDs are free or ordered, but not (necessarily) complete. We use this property to derive...

### Citations

876 | Symbolic Boolean manipulation with ordered binary-decision diagrams - Bryant - 1992 |

439 | Algebraic Coding Theory - Berlekamp - 1968 |

412 | Dynamic variable ordering for ordered binary decision diagrams - Rudell - 1993 |

361 | Binary decision diagrams - Akers - 1992 |

360 | Sangiovanni_Vincentelll ""Logic Minimization Algorithms for VLSI Synthesis" Kluwer Academic Pub - Brayton, Hachte, et al. - 1984 |

358 | The Complexity of Boolean Functions - Wegener - 1987 |

323 |
Graph based algorithms for boolean function manipulation
- Bryant
- 1986
(Show Context)
Citation Context ...es into an exponential gap between the corresponding FDD representations. If the gap for BDDs occurs for a family F of Boolean functions, then the corresponding gap for FDDs occurs fors(F ): ffl From =-=[Bry86]-=- and Theorem 3 we conclude that for f =s(x 1 x 2 + :: +x 2n\Gamma1 x 2n ) there are two orderssands0 with OFDD-SIZEs(f) = O(n 2 ) but OFDD-SIZEs0 (f) = \Omega\Gamma 1 n 2 n ). ffl The results of [Bry9... |

233 | On the complexity of VLSI implementations and graph representations of Boolean functions with applications to integer multiplication
- Bryant
- 1991
(Show Context)
Citation Context ...ry86] and Theorem 3 we conclude that for f =s(x 1 x 2 + :: +x 2n\Gamma1 x 2n ) there are two orderssands0 with OFDD-SIZEs(f) = O(n 2 ) but OFDD-SIZEs0 (f) = \Omega\Gamma 1 n 2 n ). ffl The results of =-=[Bry91]-=- and [SW92] imply that the -transformation of the hidden weighted bit function has size O(n 2 ) FFDDs but requires OFDDs of size 2 \Omega\Gamma n) . ffl In[Weg84] it was shown that every symmetric fun... |

143 | Zero-supressed BDDs for set manipulation in combinatorial problems - Minato - 1993 |

68 | Multilevel logic synthesis based on functional decision diagrams - Kebschull, Schubert, et al. - 1992 |

62 | Edge-valued binary decision diagrams for multi-level hierarchical veri cation - Lai, Sastry - 1992 |

55 | Representation of switching circuits by binary decision diagrams - Lee - 1959 |

47 |
Logic Synthesis and Optimization
- Sasao
- 1993
(Show Context)
Citation Context ...are based on so-called Reed-Muller expansions and naturally correspond to AND/EXOR based multi-level logic circuits. Lately, synthesis based on AND/EXOR realizations has gained more and more interest =-=[Sas93]-=-. This stems at least partly from the fact that, due to technological improvements, in many applications it is possible to handle EXOR gates as standard gates with the same speed and costs as e.g. OR ... |

44 |
Graph driven BDDs – a new data structure for Boolean functions
- Sieling, Wegener
- 1995
(Show Context)
Citation Context ...eorem 3 we conclude that for f =s(x 1 x 2 + :: +x 2n\Gamma1 x 2n ) there are two orderssands0 with OFDD-SIZEs(f) = O(n 2 ) but OFDD-SIZEs0 (f) = \Omega\Gamma 1 n 2 n ). ffl The results of [Bry91] and =-=[SW92]-=- imply that the -transformation of the hidden weighted bit function has size O(n 2 ) FFDDs but requires OFDDs of size 2 \Omega\Gamma n) . ffl In[Weg84] it was shown that every symmetric function has c... |

42 | On the complexity of mod-2 sum PLAs - Besslich - 1990 |

41 | Efficient analysis and manipulation of OBDDs can be extended to FBDDs - Gergov, Meinel - 1994 |

38 | Easily testable realizations for logic functions - Reddy - 1972 |

26 | Becker: Fast OFDD Based Minimization of Fixed Polarity Reed-Muller Expressions - Drechsler, Theobald, et al. - 1994 |

21 | A neutral netlist of 10 combinational circuits and a target translator in Fortran - Brglez, Fujiwara - 1985 |

21 | Efficient graph-based computation and manipulation of functional decision diagrams - Kebschull, Rosenstiel - 1993 |

21 |
bounds on the size of bounded depth networks over a complete basis with logical addition
- Lower
- 1987
(Show Context)
Citation Context ...xactly to a BDD-active path for an assignment (b 1 ; : : : ; b n )s(a 1 ; : : : ; a n ), i.e. 8i : b isa i . Thus, f FDD G (a) = L ba f BDD G (b). We define this transformation which was also used in =-=[Raz87]-=- (see also [Pat86]) to analyse circuits over f; \Phig and in [BT92] (as the Reed-Muller Transform) to synthesize two level circuits: Definition 3 Let f 2 B n . Thens(f) 2 B n is defined bys(f)(x) := M... |

19 | Two lower bounds for branching programs - Ajtai, Babai, et al. - 1986 |

18 | Modified Branching Programs and Their Computational Power, volume 370 - Meinel - 1989 |

14 | Fault detecting test sets for Reed-Muller Canonic networks - Saluja, Reddy - 1975 |

13 | A computer algorithm for minimizing Reed-Muller canonical forms - Fleisher, Tavel, et al. - 1987 |

13 |
Reduction of BDDs in linear time
- Sieling, Wegener
- 1992
(Show Context)
Citation Context ...lso the (t S )-equivalent DD of minimum size, is uniquely determined. It can be constructed by applying reductions with types in S to G in any order as long as possible. For S = f1; 2g it is shown in =-=[SW93]-=- that this sequence of reductions can be organised in such a way that the total running time of the reduction process is linear in jGj. A simple generalisation of this result yields: Corollary 1 For e... |

13 |
Optimal decision trees and one-time-only branching-programs for symmetric Boolean functions
- Wegener
- 1984
(Show Context)
Citation Context ...a\Gamma 1 n 2 n ). ffl The results of [Bry91] and [SW92] imply that the -transformation of the hidden weighted bit function has size O(n 2 ) FFDDs but requires OFDDs of size 2 \Omega\Gamma n) . ffl In=-=[Weg84]-=- it was shown that every symmetric function has complete OBDDs of size at most n 2 =2 \Gamma \Theta(n log n). Sincesmaps symmetric functions only to symmetric functions this bound holds for for OFDDs ... |

11 | On the implementation of a package for efficient representation and manipulation of functional decision diagrams - Becker, Drechsler, et al. - 1993 |

10 | Fast minimization of mixed-polarity and/xor canonical networks - Perkowski, Csansky, et al. - 1992 |

10 | The complexity of mod-2 sum PLA's for symmetric functions - Rollwage - 1993 |

10 | Logic synthesis for arithmetic circuits using the reed-muller representation - Saul - 1992 |

10 | Design for testability properties of and/xor networks - Sarabi, Perkowski - 1993 |

9 | Two level logic minimization - Sasao |

9 | The Programmable Gate Array Data - Inc |

8 | Synthesis for testability: Circuits derived from ordered kronecker functional decision diagrams - Becker, Drechsler - 1995 |

8 | On the complexity of analysis and manipulation of Boolean functions in terms of decision diagrams - Gergov - 1994 |

8 | Practical Design Using Programmable Logic - Pellerin, Holley - 1991 |

6 | FDD based technology mapping for FPGA - Schubert, Kebschull, et al. - 1992 |

5 | Testability of circuits derived from functional decision diagrams - Becker, Drechsler - 1994 |

5 |
A three-valued quasi-linear transformation for logic synthesis
- Besslich, Trachtenberg
- 1992
(Show Context)
Citation Context ...a 1 ; : : : ; a n ), i.e. 8i : b isa i . Thus, f FDD G (a) = L ba f BDD G (b). We define this transformation which was also used in [Raz87] (see also [Pat86]) to analyse circuits over f; \Phig and in =-=[BT92]-=- (as the Reed-Muller Transform) to synthesize two level circuits: Definition 3 Let f 2 B n . Thens(f) 2 B n is defined bys(f)(x) := M yx f(y): As noted in [Pat86]sis a bijection being its own inverse.... |

5 | Rapid prototyping of fully testable multi-level and/exor networks - Drechsler, Becker - 1993 |

4 | On the computational power of functional decision diagrams. 20. Workshop uber Komplexitatstheorie, Datenstrukturen und effiziente Algorithmen - Becker, Drechsler - 1993 |

3 |
On Razborov's result for bounded depth circuits over f\Phi; g
- Paterson
- 1986
(Show Context)
Citation Context ...tive path for an assignment (b 1 ; : : : ; b n )s(a 1 ; : : : ; a n ), i.e. 8i : b isa i . Thus, f FDD G (a) = L ba f BDD G (b). We define this transformation which was also used in [Raz87] (see also =-=[Pat86]-=-) to analyse circuits over f; \Phig and in [BT92] (as the Reed-Muller Transform) to synthesize two level circuits: Definition 3 Let f 2 B n . Thens(f) 2 B n is defined bys(f)(x) := M yx f(y): As noted... |

2 | A new approach to the decomposition of imcompletely specified multi-output functions based on graph coloring and local transformations and its application to fpga mapping - Wan, Perkowski - 1992 |

1 | On variable ordering of ordered functional decision diagrams. In GI/GME/ITG-Fachtagung "Rechnergestutzter Entwurf und Architektur mikroelektronischer Systeme - Becker, Drechsler, et al. - 1994 |