A Local Selection Algorithm for Switching Function Minimization
- 1 January 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-33 (1) , 91-97
- https://doi.org/10.1109/TC.1984.5009316
Abstract
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.Keywords
This publication has 11 references indexed in Scilit:
- Adjacency Table Method of Deriving Minimal SumsIEEE Transactions on Computers, 1977
- A New Technique for the Fast Minimization of Switching FunctionsIEEE Transactions on Computers, 1977
- Minimization of Switching Functions—A Fast TechniqueIEEE Transactions on Computers, 1975
- A Method for Generating Prime Implicants of a Boolean ExpressionIEEE Transactions on Computers, 1974
- Weighting Method for the Determination of the Irredundant Set of Prime ImplicantsIEEE Transactions on Computers, 1972
- A New Algorithm for Generating Prime ImplicantsIEEE Transactions on Computers, 1970
- Partitioned List Algorithms for Prime Implicant Determination from Canonical FormsIEEE Transactions on Electronic Computers, 1967
- A Method for the Selection of Prime ImplicantsIEEE Transactions on Electronic Computers, 1966
- The Reduction of Redundancy in Solving Prime Implicant TablesIRE Transactions on Electronic Computers, 1962
- The Problem of Simplifying Truth FunctionsThe American Mathematical Monthly, 1952