Issue No. 01 - January (1984 vol. 33)
Giuseppe Caruso , Istituto di Elettrotecnica ed Elettronica, Università di Palermo, Palermo, Italy.
The minimization algorithms which do not require any preliminary generation of all the prime implicants (PI's) of a function are the most efficient. In this work a new algorithm is described which follows such an approach. It is based on a local selection of PI's carried out by examining a set of vertices whose number is never greater than the number of PI's of a minimum cost cover. This algorithm takes advantage of a technique which uses numerical equivalents of the function vertices as pointers. For this reason it is well suited for implementation by computer. To illustrate the features of this algorithm a few examples are reported.
G. Caruso, "A Local Selection Algorithm for Switching Function Minimization," in IEEE Transactions on Computers, vol. 33, no. , pp. 91-97, 1984.