Cited By
View all- Stergiou SJain JMacii E(2013)Optimizing BDDs for time-series dataset manipulationProceedings of the Conference on Design, Automation and Test in Europe10.5555/2485288.2485532(1018-1021)Online publication date: 18-Mar-2013
Dynamically resizable binary decision diagrams
Pages 185 - 190
Abstract
We present the architecture of a new Ordered Binary Decision Diagram library that is designed from the ground up to be space efficient. The main novelty lies in the library's node structure, which is modified at run-time to closely follow the variations in size of the stored OBDDs. We compare the new library with existing OBDD libraries on ACM/SIGDA and industrial circuits and report significant performance and space gains.
References
[1]
S B Akers. Binary decision diagrams. IEEE Transactions on Computers, (27):509--516, 1978.
[2]
R E Bryant. Symbolic manipulation of boolean functions using a graphical representation. In Design Automation Conference, pages 688--694, 1985.
[3]
R E Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, pages 35--8, 1986.
[4]
B Bolig and I Wegener. Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers, (45):993--1002, 1996.
[5]
S Minato, N Ishiura, and S Yajima. Shared binary decision diagrams with attributed edges for efficient boolean function manipulation. In Design Automation Conference, pages 52--57, 1990.
[6]
K S Brace, R L Rudell, and R E Bryant. Efficient implementation of a BDD package. In Design Automation Conference, pages 40--45, 1990.
[7]
P Ashar and M Cheong. Efficient breadth-first manipulation of binary decision diagrams. In Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pages 622--627, 1994.
[8]
S Minato and S Ishihara. Streaming BDD manipulation for large-scale combinatorial problems. In Design Automation and Test in Europe, pages 224--228, 2001.
[9]
H Ochi, K Yasuoka, and S Yajima. Breadth-first manipulation of very large binary decision diagrams. In International Conference on Computer-Aided Design, pages 48--55, 1993.
[10]
Jagesh V Sanghavi, Rajeev K Ranjan, Robert K Brayton, and Alberto Sangiovanni-Vincentelli. High performance BDD package by exploiting memory hierarchy. In Design Automation Conference, pages 635--640, 1996.
[11]
B Yang, Y Chen, R Bryant, and D O'Hallaron. Space and time efficient BDD construction via working set control. In Asia and South Pacific Design Automation Conference, pages 423--432, 1998.
[12]
O Coudert and J C Madre. A unified framework for the formal verification of sequential circuits. In International Conference on Computer Aided Design, pages 126--129, 1990.
[13]
F Somenzi. CUDD: CU decision diagram package | release 2.4.2, 2009.
[14]
R Ranjan. CAL: Binary decision diagram package | release 2.1, 1998.
[15]
David Long. The design of a cache-friendly bdd library. In International Conference on Computer Aided Design, pages 639--645, 1998.
[16]
R E Bryant. On the complexity of VLSI implementations and graph representations of boolean functions with application to integer multiplication. IEEE Transactions on Computers, (40):205--213, 1991.
Index Terms
- Dynamically resizable binary decision diagrams
Recommendations
Binary Decision Diagrams
This paper describes a method for defining, analyzing, testing, and implementing large digital functions by means of a binary decision diagram. This diagram provides a complete, concise, "implementation-free" description of the digital functions ...
Factorization using binary decision diagrams
We address the factorization problem in this paper: Given an integer N=pq$N=pq$, find two factors p$p$ and q$q$ of N$N$ such that p$p$ and q$q$ are of same bit-size. When we say integer multiplication of N$N$, we mean expressing N$N$ as a product of two ...
Chain Reduction for Binary and Zero-Suppressed Decision Diagrams
AbstractChain reduction enables reduced ordered binary decision diagrams (BDDs) and zero-suppressed binary decision diagrams (ZDDs) to each take advantage of the other’s ability to symbolically represent Boolean functions in compact form. For any Boolean ...
Comments
Information & Contributors
Information
Published In
May 2010
502 pages
ISBN:9781450300124
DOI:10.1145/1785481
- General Chairs:
- R. Iris Bahar,
- Fabrizio Lombardi,
- Program Chairs:
- David Atienza,
- Erik Brunvand
Copyright © 2010 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
In-Cooperation
- IEEE CEDA
- IEEE CASS
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 16 May 2010
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
GLSVLSI '10
Sponsor:
Acceptance Rates
Overall Acceptance Rate 312 of 1,156 submissions, 27%
Upcoming Conference
GLSVLSI '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 148Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
Cited By
View all- Stergiou SJain JMacii E(2013)Optimizing BDDs for time-series dataset manipulationProceedings of the Conference on Design, Automation and Test in Europe10.5555/2485288.2485532(1018-1021)Online publication date: 18-Mar-2013
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in