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

Giuseppe CARUSO

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

Giuseppe CARUSO

Full Text Views

0

Share
Cite this

Summary :

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 muitiple-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 a comparison of the proposed algorithm with the program ESPRESSO-IIC developed at Berkeley are presented.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E79-A No.1 pp.110-117

Publication Date: 1996/01/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: VLSI Design Technology and CAD

Cite this

Copy

Giuseppe CARUSO, "A Local Cover Technique for the Minimization of Multiple-Valued Input Binary-Valued Output Functions" in IEICE TRANSACTIONS on Fundamentals, vol. E79-A, no. 1, pp. 110-117, January 1996, doi: .
Abstract: 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 muitiple-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 a comparison of the proposed algorithm with the program ESPRESSO-IIC developed at Berkeley are presented.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e79-a_1_110/_p

Copy

@ARTICLE{e79-a_1_110,
author={Giuseppe CARUSO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Local Cover Technique for the Minimization of Multiple-Valued Input Binary-Valued Output Functions},
year={1996},
volume={E79-A},
number={1},
pages={110-117},
abstract={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 muitiple-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 a comparison of the proposed algorithm with the program ESPRESSO-IIC developed at Berkeley are presented.},
keywords={},
doi={},
ISSN={},
month={January},}

Copy

TY - JOUR
TI - A Local Cover Technique for the Minimization of Multiple-Valued Input Binary-Valued Output Functions
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 110
EP - 117
AU - Giuseppe CARUSO
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E79-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 1996
AB - 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 muitiple-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 a comparison of the proposed algorithm with the program ESPRESSO-IIC developed at Berkeley are presented.
ER -