The Community for Technology Leaders
RSS Icon
Subscribe
Los Angeles, CA
June 5, 2000 to June 9, 2000
ISBN: 1-58113-1897-9
pp: 681-686
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
ABSTRACT
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, 2000, Design Automation Conference, Design Automation Conference 2000, pp. 681-686, doi:10.1109/DAC.2000.855401
46 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool