A Local Cover Technique for the Minimization of Multiple-Valued Input Binary-Valued Output Functions

概要

論文の詳細を見る
The present paper is concerned with an algorithm for the minimization of multiple-valued input, binary-valued output functions. The algorithm is an extension to multiple-valued logic of an algorithm for the minimization of ordinary single-output Boolean functions. It is based on a local covering approach. Basically, it uses a "divide and conquer" technique, consisting of two steps called expansion and selection. The present algorithm preserves two important features of the original one. First, a lower bound on the number of prime implicants in the minimum cover of the given function is furnished as a by-product of the minimization. Second, all the essential primes of the function are identified and selected during the expansion process. That usually improves efficiency when handling functions with many essential primes. Results of d comparison of the proposed algorithm with the program ESPRESSO-IIC developed at Berkeley are presented.
社団法人電子情報通信学会の論文
1996-01-25