Heuristic Minimization of MVL Functions: A Direct Cover Approach
- 1 February 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-35 (2) , 134-144
- https://doi.org/10.1109/tc.1986.1676731
Abstract
A heuristic method to obtain near-minimal covers of p-valued switching functions is introduced. First, we describe transform tools useful in the processing of MVL functions. They are: p-adic shifting, weighting, and implicant detecting transformations. Based on these tools, a direct cover algorithm is presented that uses local information for heuristic decision making. The heuristics are taken from weight coefficients calculated for canonical terms and implicants. The method allows to assign cost factors to implicants. Further, the algorithms can be modified easily, so as to correspond to various connectives (e.g., MAX, PLUS).Keywords
This publication has 11 references indexed in Scilit:
- Multiple-Valued Logic—its Status and its FutureIEEE Transactions on Computers, 1984
- A Local Selection Algorithm for Switching Function MinimizationIEEE Transactions on Computers, 1984
- A Method for the Generation and Processing of Dyadic Indexed DataIEEE Transactions on Computers, 1983
- Representation of Multivalued Functions Using the Direct Cover MethodIEEE Transactions on Computers, 1981
- Fast transform procedure for the generation of near-minimal covers of Boolean functionsIEE Proceedings E Computers and Digital Techniques, 1981
- Logic Design of Multivalued I2L Logic CircuitsIEEE Transactions on Computers, 1979
- A Method to Simplify a Boolean Function into a Near Minimal Sum-of-Products for Programmable Logic ArraysIEEE Transactions on Computers, 1978
- Generating Test Examples for Heuristic Boolean MinimizationIBM Journal of Research and Development, 1974
- A MINIMIZATION METHOD FOR 3-VALUED LOGIC FUNCTIONSPublished by Elsevier ,1971
- The problem of simplifying logical expressionsThe Journal of Symbolic Logic, 1959