Large-scale SOP minimization using decomposition and functional properties

Authors:
Alan Mishchenko;Tsutomu Sasao
Affiliations:
University of California, Berkeley, Berkeley, CA;Kyushu Institute of Technology, Iizuka, Fukuoka, Japan
Venue:
Proceedings of the 40th annual Design Automation Conference
Year:
2003

Citing 9
Cited 4

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Reduced offsets for two-level multi-valued logic minimization

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Espresso-signature: a new exact minimizer for logic functions

DAC '93 Proceedings of the 30th international Design Automation Conference
Two-level logic minimization: an overview

Integration, the VLSI Journal
Exact coloring of real-life graphs is easy

DAC '97 Proceedings of the 34th annual Design Automation Conference
The disjunctive decomposition of logic functions

ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
On the minimization of SOPs for bi-decomposition functions

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Worst and Best Irredundant Sum-of-Products Expressions

IEEE Transactions on Computers
Logic Minimization Algorithms for VLSI Synthesis

Logic Minimization Algorithms for VLSI Synthesis

A fast method to derive minimum SOPs for decomposable functions

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
A novel approach for fast covering the Boolean sets

ISTASC'08 Proceedings of the 8th conference on Systems theory and scientific computation
Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule

Advances in Engineering Software
Reduced-rule based expert system by the simplification of logic functions for the diagnosis of diabetes

Computers in Biology and Medicine

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.