6533b82efe1ef96bd1292fe9

RESEARCH PRODUCT

A Local Selection Algorithm for Switching Function Minimization

Giuseppe Caruso

subject

Mathematical optimizationImplicantProbability density functionFunction (mathematics)Theoretical Computer ScienceSet (abstract data type)Computational Theory and MathematicsCover (topology)Hardware and ArchitectureIndependent setAlgorithm designMinificationAlgorithmSoftwareMathematics

description

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.

yearjournalcountryeditionlanguage
1984-01-01IEEE Transactions on Computers
https://doi.org/10.1109/tc.1984.5009316