Heuristic minimization of multiple-valued relations

Author

Watanabe, Yosinori ; Brayton, Robert K.

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA

Volume

12

Issue

10

fYear

1993

fDate

10/1/1993 12:00:00 AM

Firstpage

1458

Lastpage

1472

Abstract

An approach to minimization that is based on a state-of-the-art paradigm for the two-level minimization of functions is presented. Some special properties of relations, in contrast to functions, which must be carefully considered in realizing a high-quality procedure for solving the minimization problem are clarified. An efficient heuristic method to find an optimal sum-of-products representation for a multiple-valued relation is proposed and implemented in the program GYOCRO. It uses multiple-valued decision diagrams (MDDs) to represent the characteristic functions for the relations. Experimental results are presented and compared with previous exact and heuristic Boolean relation minimizers to demonstrate the effectiveness of the proposed method

Keywords

many-valued logics; minimisation of switching nets; Boolean relation minimizers; GYOCRO; heuristic method; heuristic minimization; multiple-valued decision diagrams; multiple-valued relations; optimal sum-of-products representation; Automata; Boolean functions; Cost function; Input variables; Logic design; Logic functions; Minimization; Programmable logic arrays;

fLanguage

English

Journal_Title

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Publisher

ieee

ISSN

0278-0070

Type

jour

DOI

10.1109/43.256920

Filename

256920