This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Heuristic Minimization of MVL Functions: A Direct Cover Approach
February 1986 (vol. 35 no. 2)
pp. 134-144
P.W. Besslich, Section of Electrical Engineering, University of Bremen
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).
Index Terms:
weight transform, Cost of MVL literals and implicants, direct cover algorithm, heuristic minimization, implicant detecting transform, in-place signal-flow transformation, minimization of multiple-valued logic, MVL connectives, p-adic index system, p-adic shifting
Citation:
P.W. Besslich, "Heuristic Minimization of MVL Functions: A Direct Cover Approach," IEEE Transactions on Computers, vol. 35, no. 2, pp. 134-144, Feb. 1986, doi:10.1109/TC.1986.1676731
Usage of this product signifies your acceptance of the Terms of Use.