This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Local Selection Algorithm for Switching Function Minimization
January 1984 (vol. 33 no. 1)
pp. 91-97
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.
Citation:
Giuseppe Caruso, "A Local Selection Algorithm for Switching Function Minimization," IEEE Transactions on Computers, vol. 33, no. 1, pp. 91-97, Jan. 1984, doi:10.1109/TC.1984.5009316
Usage of this product signifies your acceptance of the Terms of Use.