|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
A Local Selection Algorithm for Switching Function Minimization
January 1984 (vol. 33 no. 1)
pp. 91-97
| ASCII Text | x | ||
| Giuseppe Caruso, "A Local Selection Algorithm for Switching Function Minimization," IEEE Transactions on Computers, vol. 33, no. 1, pp. 91-97, January, 1984. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1984.5009316, author = {Giuseppe Caruso}, title = {A Local Selection Algorithm for Switching Function Minimization}, journal ={IEEE Transactions on Computers}, volume = {33}, number = {1}, issn = {0018-9340}, year = {1984}, pages = {91-97}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1984.5009316}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - A Local Selection Algorithm for Switching Function Minimization IS - 1 SN - 0018-9340 SP91 EP97 EPD - 91-97 A1 - Giuseppe Caruso, PY - 1984 VL - 33 JA - IEEE Transactions on Computers ER - | |||
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.

