Abstract
We consider the problem of enumerating the prime implicants of a given discrete function as a basic task of circuit theory. First, we count PI's for random Boolean functions. Then we use the well known lattice differentiation as a tool for finding implicants. The concept of a peak admits to characterize prime implicants, at least those with no improper domains. The improper case can be reduced to a lower dimensional problem. Since the peak test is local, a parallel algorithm is available. The time and space complexity turns out to be low measured in the input size.
Preview
Unable to display preview. Download preview PDF.
References
Davio, M., Deschamps, J.P. and Thayse, A., Discrete and switching functions. McGraw-Hill 1978
Friedman, A.D. and Menon, P.R., Theory & design of switching circuits, Pitman 1975
Garey, M.R. and Johnson, D.S., Computers and intractability, Freeman & Co. 1979
Klar, R. Digitale Rechenautomaten (3. Aufl.), de Gruyter 1983
McCluskey, E.J., Minimization of Boolean functions, Bell Syst. Tech. Journ. 35 (1956), 1417–1444
Meo, A.R., On the synthesis of many-variable switching functions. In: Biorci, G. (ed.), Network and switching theory, Academic Press 1968
Mileto, F. and Putzolu, G., Average values of quantities appearing in Boolean Function minimization, IEEE Trans. El. Comp. 13 (1964), 87–92
Mileto, F. and Putzolu, G., Statistical complexity of algorithms for Boolean functions minimization, Journ. ACM 12 (1965), 364–375
Oberschelp, W. and Remlinger, J., Schaltkreistheorie, Schriften zur Informatik und Angewandten Mathematik der RWTH Aachen, to appear 1984
Quine, W.V., The problem of simplyfiying truth functions, Amer. Math. Monthly 59 (1952), 521–531
Savage, J.E., The complexity of computing, Wiley 1976
Spaniol, O., Arithmetik in Rechenanlagen, Teubner 1976
Thayse, A., Boolean calculus of differences, Springer 1981 (Lecture notes in Comp. Science No. 101)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oberschelp, W. (1984). Fast parallel algorithms for finding all prime implicants for discrete functions. In: Börger, E., Hasenjaeger, G., Rödding, D. (eds) Logic and Machines: Decision Problems and Complexity. LaM 1983. Lecture Notes in Computer Science, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13331-3_56
Download citation
DOI: https://doi.org/10.1007/3-540-13331-3_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13331-5
Online ISBN: 978-3-540-38856-2
eBook Packages: Springer Book Archive