Abstract
The calculation of an exact minimal cover of a Boolean function [2] is an NP-complete problem, which has an important application in circuit design. The required time for the calculation could be reduced by a factor of more than 3.5 ∗ 107 in [8] and even 8 ∗ 108 in [7].
In this paper we give a introduction into the definition of this problem and its basic solution. The main contribution of this paper are algorithms which enlarge the improvement factor mentioned above on this very high level for 32 variables p i and 1024 clauses furthermore to 1.8 ∗ 1010 using a single CPU-core and finally 1.2 ∗ 1011 using a GPU.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cordone, R., Ferrandi, F., Sciuto, D., Wolfler Calvo, R.: An Efficient Heuristic Approach to Solve the Unate Covering Problem. In: Proceedings of the Conference on Design, Automation and Test in Europe, Paris, France, pp. 364–371 (2000)
Galinier, P., Hertz, A.: Solution Techniques for the Large Set Covering Problem. Les Cahiers du GERAD, pp. 1–19 (2003) ISSN: 0711-2440
Gropp, W., Thakur, R., Lusk, E.: Using MPI-2: Advanced Features of the Message Passing Interface. MIT Press, Cambridge (1999)
Paul, E., Steinbach, B., Perkowski, M.: Application of CUDA in the Boolean Domain for the Unate Covering Problem. In: Steinbach, B. (ed.) Boolean Problems, Proceedings of the 9th International Workshops on Boolean Problems, September 16-17, pp. 133–142. Freiberg University of Mining and Technology, Freiberg (2010) ISBN 978-3-86012-404-8
Petrick, S.K.: On the Minimization of Boolean Functions. In: Proceedings of the International Conference Information Processing, Paris, pp. 422–423 (1959)
Posthoff, C., Steinbach, B.: Logic Functions and Equations - Binary Models for Computer Science. Springer, Dordrecht (2004)
Steinbach, B., Posthoff, C.: Improvements of the Construction of Exact Minimal Covers of Boolean Functions. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2011, Part II. LNCS, vol. 6928, pp. 272–279. Springer, Heidelberg (2012)
Steinbach, B., Posthoff, C.: Parallel Solution of Covering Problems Super-Linear Speedup on a Small Set of Cores. GSTF International Journal on Computing, Global Science and Technology Forum (GSTF) 1(2), 113–122 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Steinbach, B., Posthoff, C. (2013). Fast Calculation of Exact Minimal Unate Coverings on Both the CPU and the GPU. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory - EUROCAST 2013. EUROCAST 2013. Lecture Notes in Computer Science, vol 8112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53862-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-53862-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53861-2
Online ISBN: 978-3-642-53862-9
eBook Packages: Computer ScienceComputer Science (R0)