Representation of Multivalued Functions Using the Direct Cover Method
- 1 September 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-30 (9) , 674-679
- https://doi.org/10.1109/tc.1981.1675867
Abstract
An efficient method for representing multivalued functions is described. The method employs an algorithm which generates an efficient cover for a given function "directly," i.e., without resorting to the intermediate step of creating a table of prime implicants. Data are presented to show that the covers generated are as efficient in terms of cover size as prime implicant based methods. More importantly, however, the direct cover method is shown to require much less computation time than prime implicant based methods, thus making it practical for functions with a large number of input variables and/or as the radix of implementation increases. The algorithm is introduced by applying it to functional representations employing the traditional max and min operation. Next, a modified form of the algorithm is presented for use with the sum and product operators more appropriate to I2L and other current summation technologies.Keywords
This publication has 7 references indexed in Scilit:
- The Complexity of Computational Circuits Versus RadixIEEE Transactions on Computers, 1980
- Logic Design of Multivalued I2L Logic CircuitsIEEE Transactions on Computers, 1979
- Multivalued Integrated Injection LogicIEEE Transactions on Computers, 1977
- minimization of multivalued functionsPublished by Elsevier ,1977
- computer simplification of multi-valued switching functionsPublished by Elsevier ,1977
- Computer Minimization of Multivalued Switching FunctionsIEEE Transactions on Computers, 1972
- A Minimization Technique for Multiple-Valued Logic SystemsIEEE Transactions on Computers, 1968