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

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

doi:10.1109/43.298033

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 journal › Article › peer-review

78 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 language	English (US)
Pages (from-to)	959-975
Number of pages	17
Journal	IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume	13
Issue number	8
DOIs	https://doi.org/10.1109/43.298033
State	Published - 1994
Externally published	Yes

ASJC Scopus subject areas

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

Access to Document

10.1109/43.298033

Cite this

@article{ac8b6809f36b4ab4a8739701af1b0e19,

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

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.",

author = "Lai, {Yung Te} and Massoud Pedram and Vrudhula, {Sarma B.K.}",

note = "Funding Information: Manuscript received September 9, 1993; revised March 18, 1994. This work was supported in part by NSF Researc Initiation Awards under contract Nos. MIP-9211668 and MIP-9111206. This paper was recommended by Associate Editor M. Fujita. Y.-T.L ai is with Hitachi Micro Systems, Inc., San Jose, CA USA. M. Pedram is with the Department of Electrical Engineering-Systems, University of Southern California, Los Angeles, CA USA. S. B. K. Vrudhula is with the Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ USA. IEEE Log Number 9401 87 1.",

year = "1994",

doi = "10.1109/43.298033",

language = "English (US)",

volume = "13",

pages = "959--975",

journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",

issn = "0278-0070",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "8",

}

TY - JOUR

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

AU - Lai, Yung Te

AU - Pedram, Massoud

AU - Vrudhula, Sarma B.K.

N1 - Funding Information: Manuscript received September 9, 1993; revised March 18, 1994. This work was supported in part by NSF Researc Initiation Awards under contract Nos. MIP-9211668 and MIP-9111206. This paper was recommended by Associate Editor M. Fujita. Y.-T.L ai is with Hitachi Micro Systems, Inc., San Jose, CA USA. M. Pedram is with the Department of Electrical Engineering-Systems, University of Southern California, Los Angeles, CA USA. S. B. K. Vrudhula is with the Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ USA. IEEE Log Number 9401 87 1.

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028483037&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028483037&partnerID=8YFLogxK

U2 - 10.1109/43.298033

DO - 10.1109/43.298033

M3 - Article

AN - SCOPUS:0028483037

SN - 0278-0070

VL - 13

SP - 959

EP - 975

JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

IS - 8

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this