Safe BDD Minimization Using Don't Cares

In many computer-aided design tools, binary decision diagrams (BDDs) are used to represent Boolean functions. To increase the efficiency and capability of these tools, many algorithms have been developed to reduce the size of BDDs. This paper presents heuristic algorithms that minimize the size of BDDs representing incompletely specified functions by intelligently assigning don’t cares to binary values. The traditional algorithm, restrict [8], is often effective in BDD minimization, but can increase the BDD size. We propose new algorithms based on restrict which are guaranteed never to increase the size of the BDD, thereby significantly reducing peak memory requirements. Experimental results show that our techniques typically yield significantly smaller BDDs than restrict.

• Type: Conference
• Year: 1997
• Where: DAC
• Authors: Youpyo Hong, Peter A. Beerel, Jerry R. Burch, Kenneth L. McMillan
• Keywords: Algorithms, BDD Size, Binary Decision Diagrams, Computer Architecture, DAC 1997