Ronald Prather
Abstract
The literature concerned with methods for finding the minimal form of a truth function is, by now, quite extensive. This article extends this knowledge by introducing an algorithm whereby all calculations are performed on decimal numbers obtained from binary-decimal conversion of the terms of the Boolean function. Several computational aids are presented for the purpose of adapting this algorithm to the solution of large-scale problems on a digital computer.
- 1 URBANO, R ~-~ , AND ~V{UELLER, R K A topologlcal method tor the determination of the minimal forms of a Boolean function, IRE Trans , Vol. EC-5, pp 126-132, September, 1956.Google Scholar
- 2 MUELLEa, R K On the synthesis of a minimal representation of a logic function, Cambridge, Mass., Air Force Cambridge Research Center, AFCRC-7R-55-104, April, 1955Google Scholar
- 3 Bernard Harris has suggested one means of representation, whereby the binary digits are interpreted as though they were of Radix three HAums, BERNARD, An algorithm for determining minimal representations of a logic function, {RE Trans , Vol. EC-6, pp 103-108, June, 1957.Google Scholar
- 4 A basic cell corresponds exactly to what Quine calls a "prime implicant" See QUINE, W V, The problem of simplifying truth functions, Amer Math Month. 59 (1952), 521-531.Google Scholar
- 5 CALDWELL, S. H., Sw~tcMng C~rcu~ts and Logical Design, pp. 165-169. John Wiley and Sons, New York.Google Scholar
- 6 McCLVSKEr, E. J., JR, Minimization of Boolean functions, Bell Syslem Tech. J 85 (1956), 1417-1444.Google Scholar
Index Terms
- Computational Aids for Determining the Minimal Form of a Truth Function
Recommendations
Computing the weight of a boolean function from its algebraic normal form
SETA'12: Proceedings of the 7th international conference on Sequences and Their ApplicationsWe present an algorithm that computes the weight of a Boolean function from its Algebraic Normal Form (ANF). For functions acting on high number of variables (n>30) and having low number of monomials in its ANF, the algorithm is advantageous over the ...
Efficient Algorithm of Affine Form Searching forWeakly Specified Boolean Function
This paper presents the spectralmethod of recognition of an incompletely defined Boolean function. The main goal of analysis is fast estimation whether a given single output function can be extended to affine form. Furthermore, a simple extension ...
A Normal Form for Function Rings of Piecewise Functions
Computer algebra systems often have to deal with piecewise continuous functions. These are, for example, the absolute value function, signum, piecewise defined functions but also functions that are the supremum or infimum of two functions. We present a ...
Comments