Title :
Building BDDs with ordering-reshuffle strategy
Abstract :
An ordering-reshuffle strategy for building binary decision diagrams (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 :
Boolean functions; diagrams; logic CAD; CAD; ISCAS85 benchmark; binary decision diagrams; c7552; circuits; common-ordering BDDs; logic design; net list description; ordering-reshuffle strategy;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19931026
