Building BDDs with ordering-reshuffle strategy
- 19 August 1993
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 29 (17) , 1540-1541
- https://doi.org/10.1049/el:19931026
Abstract
An ordering-reshuffle strategy for building BDDs from a net list description is proposed. This algorithm dynamically modifies an initial ordering according to the encountered adverse situation to maintain the intermediate BDD under a reasonable size. The effectiveness of this strategy is demonstrated by building common-ordering BDDs for large circuits in the ISCAS85 benchmark including c7552 which hitherto has not been successful.Keywords
This publication has 1 reference indexed in Scilit:
- On variable ordering of binary decision diagrams for the application of multi-level logic synthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002