This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
37th Conference on Design Automation (DAC'00)
Analysis of Composition Complexity and how to Obtain Smaller Canonical Graphs
Los Angeles, CA
June 05-June 09
ISBN: 1-58113-1897-9
I. Wegener, Universitaet Dortmund, Germany
K. Mohanram, University of Texas, Austin
Y. Lu, Carnegie Mellon University, Pittsburgh, PA
D. Moundanos, Fujitsu Labs of America, Sunnyvale, CA
J. Jain, Fujitsu Labs of America, Sunnyvale, CA
We discuss an open problem in construction of Reduced Ordered Binary Decision Diagrams (ROBDDs) using composition, and prove that the worst case complexity of the construction is truly cubic. With this insight we show that the process of composition naturally leads to the construction of (even exponentially) compact partitioned-OBDDs (POBDDs) [12]. Our algorithm which incorporates dynamic partitioning, leads to the most general (and compact) form of POBDDs - graphs with multiple root variables. To show that our algorithm is robust and practical, we have analyzed some well known problems in Boolean function representation, verification and finite state machine analysis where our approach generates graphs which are even orders of magnitude smaller.
Index Terms:
ASIC, clock frequency, clock speed, comparison, custom
Citation:
I. Wegener, K. Mohanram, Y. Lu, D. Moundanos, J. Jain, "Analysis of Composition Complexity and how to Obtain Smaller Canonical Graphs," dac, pp.681-686, 37th Conference on Design Automation (DAC'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.