A Local Selection Algorithm for Switching Function Minimization

Authors:
Giuseppe Caruso
Affiliations:
Istituto di Elettrotecnica ed Elettronica, Università di Palermo, Palermo, Italy.
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 7
Cited 2

A New Algorithm for Generating Prime Implicants

IEEE Transactions on Computers
A Method for Generating Prime Implicants of a Boolean Expression

IEEE Transactions on Computers
Minimization of Switching Functions A Fast Technique

IEEE Transactions on Computers
A New Technique for the Fast Minimization of Switching Functions

IEEE Transactions on Computers
Adjacency Table Method of Deriving Minimal Sums

IEEE Transactions on Computers
Weighting Method for the Determination of the Irredundant Set of Prime Implicants

IEEE Transactions on Computers
The Computational Complexity of a Class of Minimization Algorithms for Switching Functions

IEEE Transactions on Computers

Heuristic Minimization of MVL Functions: A Direct Cover Approach

IEEE Transactions on Computers
An enhanced local covering approach for minimization of multiple-valued input binary-valued output functions

ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers

Quantified Score

Hi-index	14.98

Visualization

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.