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

Lai, Yung-Te; Pedram, Massoud; Vrudhula, Sarma

doi:10.1109/43.298033

Cited by 103 publications

(49 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This extension is the same as attened evbdds 18]. In general, for functions where the number of distinct terminal values is large, an mtbdd (or attened evbdd) will require larger number of nodes than an evbdd.…”

Section: Some Remarksmentioning

confidence: 96%

Edge Valued Binary Decision Diagrams

Vrudhula

Pedram

Lai

1996

Representations of Discrete Functions

View full text Add to dashboard Cite

In this paper we present a new data structure called Edge-Valued Binary-Decision Diagrams (evbdd). An evbdd is a directed acyclic graph, that provides a canonical and compact representation of functions that involve both Boolean and integer quantities. In general, evbdds p r o vide a more versatile and powerful representation that Ordinary Binary Decision Diagrams. We rst describe the structure and properties of evbdds, and present a general algorithm for performing a variety of binary operations. Next, we describe an important extension of evbdds, called Structural evbdds, and show h o w t h e y c a n b e u s e d for hierarchical veri cation.

show abstract

Section: Some Remarksmentioning

confidence: 96%

Edge Valued Binary Decision Diagrams

Vrudhula

Pedram

Lai

1996

Representations of Discrete Functions

View full text Add to dashboard Cite

show abstract

“…An edge-valued BDD (EVBDD) [9], [19] is an extension of the BDD, and represents an integer function. An EVBDD consists of one terminal node representing 0 and non-terminal nodes with a weighted 1-edge, where the weight is an integer.…”

Section: Definitionmentioning

confidence: 99%

Design Method for Numerical Function Generators Using Recursive Segmentation and EVBDDs

Nagayama¹,

Sasao²,

Butler³

2007

IEICE Transactions on Fundamentals of Electronics, Communicatio

View full text Add to dashboard Cite

SUMMARYNumerical function generators (NFGs) realize arithmetic functions, such as e x , sin(πx), and √ x, in hardware. They are used in applications where high-speed is essential, such as in digital signal or graphics applications. We introduce the edge-valued binary decision diagram (EVBDD) as a means of reducing the delay and memory requirements in NFGs. We also introduce a recursive segmentation algorithm, which divides the domain of the function to be realized into segments, where the given function is realized as a polynomial. This design reduces the size of the multiplier needed and thus reduces delay. It is also shown that an adder can be replaced by a set of 2-input AND gates, further reducing delay. We compare our results to NFGs designed with multi-terminal BDDs (MTBDDs). We show that EVBDDs yield a design that has, on the average, only 39% of the memory and 58% of the delay of NFGs designed using MTBDDs.

show abstract

“…Using complement edges can further reduce the size of the BDD [31]. Lai et al [32] proposed Edge-Valued BDD's (EVBDD), which can represent and manipulate integer functions and can be used for functional decomposition. In this section, we describe a new decision diagram for the representation of quantum functions.…”

Section: Quantum Decision Diagrams (Qdd)mentioning

confidence: 99%