loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th International Conference on VLSI Design - 'VLSI for the Information Appliance'
Exploiting Isomorphism for Compaction and Faster Simulation of Binary Decision Diagrams
Goa, India
January 10-January 13
ISBN: 0-7695-0013-7
We present two techniques for compaction of ROBDDs. The first technique extracts isomorphic subtrees from a characteristic function ROBDD (cfBDD), replaces them by multi-output nodes, and stores the extracted subtrees as MTBDDs. The second technique searches signatures ( pre-defined topological structures) within the cfbdd and replaces them by multioutput nodes. While both approaches are able to extract isomporphic subtrees in the cfBDD, the signature scanning approach gives a significantly better compression and reduces the simulation time as compared to cfBDD simulation, which shows that it is possible to compress BDDs and yet simulate them faster.
Citation:
Pankaj Chauhan, Pallab Dasgupta, P.P. Chakrabarti, "Exploiting Isomorphism for Compaction and Faster Simulation of Binary Decision Diagrams," vlsid, pp.324, 12th International Conference on VLSI Design - 'VLSI for the Information Appliance', 1999
Usage of this product signifies your acceptance of the Terms of Use.