Large-scale SOP minimization using decomposition and functional properties

In some cases, minimum Sum-Of-Products (SOP) expressions of Boolean functions can be derived by detecting decomposition and observing the functional properties such as unateness, instead of applying the classical minimization algorithms. This paper presents a systematic study of such situations and develops a divide-and-conquer algorithm for SOP minimization, which can dramatically reduce the computational effort, without sacrificing the minimality of the solutions. The algorithm is used as a preprocessor to a general-purpose exact or heuristic minimizer, such as ESPRESSO. The experimental results show significant improvements in runtime. The exact solutions for some large MCNC benchmark functions are reported for the first time. Categories and Subject Descriptors B.6.3 [Logic Design]: Design Aids ? Automatic synthesis. General Terms Algorithms, Performance, Experimentation, Theory. Keywords SOP minimization, disjoint-support decomposition, BDDs, divide-and-conquer strategy, orthodox ...

• Type: Conference
• Year: 2003
• Where: DAC
• Authors: Alan Mishchenko, Tsutomu Sasao
• Keywords: Classical Minimization Algorithms, DAC 2003, Design Automation, Keywords SOP Minimization, MCNC Benchmark Functions