EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition

Edge-Valued Binary-Decision Diagrams (EVBDD's) are directed acyclic graphs that can represent and manipulate integer functions as effectively as Ordered Binary-Decision Diagrams OBDD's) do for Boolean functions. They have been used in logic verification for showing the equivalence between...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computer-aided design of integrated circuits and systems Vol. 13; no. 8; pp. 959 - 975
Main Authors Lai, Y.-T., Pedram, M., Vrudhula, S.B.K.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.08.1994
Institute of Electrical and Electronics Engineers
Subjects
Algorithmics. Computability. Computer arithmetics
Application software
Applied sciences
Arithmetic
Boolean functions
Computer applications
Computer science; control theory; systems
Exact sciences and technology
Input variables
Integer linear programming
Linear programming
Subspace constraints
Theoretical computing
Function decomposition
Graph construction
Decision function
Boolean function
Minimization
Linear programming
Algorithm
Online AccessGet full text
ISSN0278-0070
DOI10.1109/43.298033

Cover

More Information
Summary:Edge-Valued Binary-Decision Diagrams (EVBDD's) are directed acyclic graphs that can represent and manipulate integer functions as effectively as Ordered Binary-Decision Diagrams OBDD's) do for Boolean functions. They have been used in logic verification for showing the equivalence between Boolean functions and arithmetic functions. In this paper, we present EVBDD-based algorithms for solving integer linear programs, computing spectral coefficients of Boolean functions, and performing function decomposition. These algorithms have been implemented in C under the SIS environment and experimental results are provided.< >
ISSN:0278-0070
DOI:10.1109/43.298033