Computer Aided Minimization Procedure for Boolean Functions

The paper describes CAMP, a Computer Aided Minimization Procedure for Boolean functions. The procedure is based on theorems of switching theory and fully exploits the power of degree of adjacency. The program does not generate any superfluous prime implicant and all the essential and selective prime implicants are chosen with no or minimum iteration. For shallow functions consisting mainly of essential prime implicants (EPIs) and a few selective prime implicants (SPIs), CAMP produces the exact minimal sum of product form. For dense functions consisting of a large number of inter-connected cyclic SPI chains, the solution may not be exactly minimal, but near minimal.

[1]  Sureshchander.  Minimization of Switching Functions—A Fast Technique , 1975, IEEE Transactions on Computers.

[2]  Nripendra U. Biswas,et al.  Introduction to Logic and Switching Theory , 1975 .

[3]  Zosimo Arevalo,et al.  A Method to Simplify a Boolean Function into a Near Minimal Sum-of-Products for Programmable Logic Arrays , 1978, IEEE Transactions on Computers.

[4]  Giuseppe Caruso.  A Local Selection Algorithm for Switching Function Minimization , 1984, IEEE Transactions on Computers.

[5]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[6]  Daniel L. Ostapko,et al.  MINI: A Heuristic Approach for Logic Minimization , 1974, IBM J. Res. Dev..

[7]  Udo W. Pooch,et al.  A New Technique for the Fast Minimization of Switching Functions , 1977, IEEE Transactions on Computers.

[8]  Edward J. McCluskey,et al.  Introduction to the theory of switching circuits , 1965 .

[9]  Nripendra N. Biswas,et al.  Minimization of Boolean Functions , 1971, IEEE Transactions on Computers.

[10]  Curts,et al.  Adjacency Table Method of Deriving Minimal Sums , 1977, IEEE Transactions on Computers.

[11]  Jorge Martínez-Carballido,et al.  PRONTO: Quick PLA Product Reduction , 1983, 20th Design Automation Conference Proceedings.

[12]  Nripendra N. Biswas,et al.  Computer-Aided Minimization Procedure for Boolean Functions , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  K. W. Cattermole,et al.  Introduction to the Theory of Switching Circuits , 1966 .