• Mathematics
  • Published 1988

REPRESENTING BOOLEAN FUNCTIONS WITH IF-THEN-ELSE DAGs

@inproceedings{Karplus1988REPRESENTINGBF,
  title={REPRESENTING BOOLEAN FUNCTIONS WITH IF-THEN-ELSE DAGs},
  author={Kevin Karplus},
  year={1988}
}
This article describes the use of binary decision diagrams (BDDs) and if-then-else DAGs for representing and manipulating Boolean functions. Two-cuts are defined for binary decision diagrams, and the relationship is exhibited between general if-then-else expressions and the two-cuts of a BDD for the same function. An algorithm for computing all two-cuts of a BDD in O(n2) time is given. A new canonical form for if-then-else DAGs, analogous to Bryant''s canonical form for BDDs, is introduced. The… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 25 CITATIONS

On Computing the Transitive Closure of a State Transition Relation

  • 30th ACM/IEEE Design Automation Conference
  • 1993
VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

A Gate-Level Approach To Compiling For Quantum Computers

  • 2018 Ninth International Green and Sustainable Computing Conference (IGSC)
  • 2018
VIEW 3 EXCERPTS
CITES METHODS

Generalized If-Then-Else Operator for Compact Polynomial Representation of Multi Output Functions

  • 2011 14th Euromicro Conference on Digital System Design
  • 2011
VIEW 1 EXCERPT
CITES BACKGROUND

A Galois Field Based Logic Synthesis Approach with Testability

  • 21st International Conference on VLSI Design (VLSID 2008)
  • 2008
VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND