Improvements of the construction of exact minimal covers of boolean functions

Authors:
Bernd Steinbach;Christian Posthoff
Affiliations:
Institute of Computer Science, Freiberg University of Mining and Technology, Freiberg, Germany;The University of The West Indies, Trinidad & Tobago
Venue:
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part II
Year:
2011

Citing 4
Cited 0

An algorithm for bi-decomposition of logic functions

Proceedings of the 38th annual Design Automation Conference
Logic Minimization Algorithms for VLSI Synthesis

Logic Minimization Algorithms for VLSI Synthesis
A method to decompose multiple-output logic functions

Proceedings of the 41st annual Design Automation Conference
Logic Functions and Equations: Examples and Exercises

Logic Functions and Equations: Examples and Exercises

Quantified Score

Hi-index	0.00

Visualization

Abstract

The calculation of an exact minimal cover of a Boolean function is an NP-complete problem. In this paper we introduce the definition of this problem and its basic solution. By using a slightly modified algorithm, we get a speed-up factor of more than 104. The main contributions of this paper are the description of an alternative approach mentioned in [15], and a remarkable improvement of this algorithm. In both cases operations of the XBOOLE library are used. Using the newly suggested algorithm, the time required for the calculation could be reduced by a factor of more than 8∗108 in comparison with the previous algorithm.