Heuristic Minimization of MVL Functions: A Direct Cover Approach

Author

Besslich, Philipp W.

Author_Institution

Section of Electrical Engineering, University of Bremen

Issue

2

fYear

1986

Firstpage

134

Lastpage

144

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

Cost of MVL literals and implicants; MVL connectives; direct cover algorithm; heuristic minimization; implicant detecting transform; in-place signal-flow transformation; minimization of multiple-valued logic; p-adic index system; p-adic shifting; weight transform; Boolean functions; Computational complexity; Costs; Decision making; Design methodology; Heuristic algorithms; Integrated circuit interconnections; Logic circuits; Minimization methods; Signal detection; Cost of MVL literals and implicants; MVL connectives; direct cover algorithm; heuristic minimization; implicant detecting transform; in-place signal-flow transformation; minimization of multiple-valued logic; p-adic index system; p-adic shifting; weight transform;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/TC.1986.1676731

Filename

1676731