ACM Home Page
Please provide us with feedback. Feedback
The multiple variable order problem for binary decision diagrams: theory and practical application
Full text PdfPdf (134 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2001 Asia and South Pacific Design Automation Conference table of contents
Yokohama, Japan
Pages: 85 - 90  
Year of Publication: 2001
ISBN:0-7803-6634-4
Authors
Christoph Scholl  Institute of Computer Science, Albert-Ludwigs-University, D 79110 Freiburg im Breisgau, Germany
Bernd Becker  Institute of Computer Science, Albert-Ludwigs-University, D 79110 Freiburg im Breisgau, Germany
Andreas Brogle  Institute of Computer Science, Albert-Ludwigs-University, D 79110 Freiburg im Breisgau, Germany
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IPSJ : Information Processing Society of Japan
IEEE HK CAS : IEEE HK CAS and Comm. Joint Chapter
IEICE : Inst of Electronics, Info & Communication Engineers
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 24,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/370155.370284
What is a DOI?

ABSTRACT

Reduced Ordered Binary Decision Diagrams (ROBDDs) gained widespread use in logic design verification, test generation, fault simulation, and logic synthesis [17, 7]. Since the size of an ROBDD heavily depends on the variable order used, there is a strong need to find variable orders that minimize the number of nodes in an ROBDD. In certain applications we have to cope with ROBDDs with different variable orders, whereas further manipulations of these ROBDDs require common variable orders. In this paper we give a theoretical background for this "Multiple Variable Order problem". Moreover, we solve the problem to transform ROBDDs with different variable orders into a good common variable order using dynamic variable ordering techniques.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S.B. Akers. Binary decision diagrams. IEEE Trans. on Comp., 27:509-516, 1978.
 
2
 
3
B. Bollig, M. L obbing, and I. Wegener. Simulated annealing to improve variable orderings for OBDDs. In Int'l Workshop on Logic Synth., pages 5b:5.1-5.10, 1995.
 
4
5
 
6
7
 
8
 
9
G. Cabodi, S. Quer, C. Meinel, Harald Sack, A. Slobodova, and C. Stangier. Binary decision diagrams and the multiple variable order problem. In Int'l Workshop on Logic Synth., pages 346-352, 1998.
 
10
R. Drechsler, B. Becker, and N. Gockel. A genetic algorithm for variable ordering of OBDDs. In Int'l Workshop on Logic Synth., pages 5c:5.55-5.64, 1995.
 
11
E. Felt, G York, R. Brayton, and A. Sangiovanni-Vincentelli. Dynamic Variable Reordering for BDD Minimization. In European Design Automation Conf., pages 130-135, 1993.
 
12
 
13
M. Fujita, H. Fujisawa, and N. Kawato. Evaluation and improvements of Boolean comparison method based on binary decision diagrams. In Int'l Conf. on CAD, pages 2-5, 1988.
 
14
 
15
N. Ishiura, H. Sawada, and S. Yajima. Minimization of binary decision diagrams based on exchange of variables. In Int'l Conf. on CAD, pages 472-475, 1991.
 
16
C.Y. Lee. Representation of switching circuits by binary decision diagrams. Bell System Technical Jour., 38:985-999, 1959.
 
17
S. Malik, A.R. Wang, R.K. Brayton, and A.L. Sangiovanni- Vincentelli. Logic verification using binary decision diagrams in a logic synthesis environment. In Int'l Conf. on CAD, pages 6-9, 1988.
 
18
19
 
20
 
21
 
22
 
23
 
24
F. Somenzi. CUDD: CU Decision Diagram Package Release 2.3.0. University of Colorado at Boulder, 1998.
 
25


Collaborative Colleagues:
Christoph Scholl: colleagues
Bernd Becker: colleagues
Andreas Brogle: colleagues