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

Yung Te Lai, Massoud Pedram, Sarma B.K. Vrudhula

Research output: Contribution to journalArticle

74 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)959-975
Number of pages17
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume13
Issue number8
DOIs
StatePublished - Aug 1 1994
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition'. Together they form a unique fingerprint.

  • Cite this