Computer minimization of multiple-output Boolean functions
This thesis describes two basic methods for minimizing two-level, multiple-input, multiple-output Boolean functions. The two methods are: (1) the map method; and (2) the tabular method. Two general procedures for each method are presented, along with illustrative examples of each. In addition, other more recently introduced extensions of each method, each with an example, are briefly described.
The formation, properties, and uses of maps and of the prime implicant table are discussed. A cost function is used in each case to determine the minimality of the solution.
Finally, an IBM System 360 MODEL 65 PL/1 computer program is presented. The basis of this program is the Quine-McCluskey method. The program allows up to ten inputs and ten outputs and determines a minimal solution according to user-specified cost factors. If the problem is too large to be handled completely within the main memory of the computer, a sub-optimal solution, which may be minimal, is found. The value of this program to the user, either a student or a circuit designer, is its ability to rapidly determine a minimal solution for a given problem and to free the user from the tedious and repetitive steps involved in determining that minimal solution.
Thesis74.C3589.pdf
8.81 MB
Adobe PDF
bf4d587e3ec464838002d00d97b2c8ba