DocumentCode :
3221390
Title :
Sympathy-MV: Fast exact minimization of fixed polarity multi-valued linear expressions
Author :
Drechsler, Rolf ; Keim, Martin ; Becker, Bernd
Author_Institution :
Inst. of Comput. Sci., Albert-Ludwigs-Univ., Freiburg, Germany
fYear :
1997
fDate :
28-30 May 1997
Firstpage :
66
Lastpage :
71
Abstract :
In this paper a polynomial time algorithm for the minimization of fixed polarity multi-valued linear expressions (FPMVLs) for totally symmetric functions based on an extension of binary moment diagrams (BMDs) is presented. A generalization to partially symmetric functions is investigated
Keywords :
logic design; minimisation of switching nets; multivalued logic; polynomials; Sympathy-MV; binary moment diagrams; fast exact minimization; fixed polarity multi-valued linear expressions; partially symmetric functions; polynomial time algorithm; totally symmetric functions; Computer science; Equations; Minimization methods; Multivalued logic; Polynomials; Upper bound; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Multiple-Valued Logic, 1997. Proceedings., 1997 27th International Symposium on
Conference_Location :
Antigonish, NS
Print_ISBN :
0-8186-7910-7
Type :
conf
DOI :
10.1109/ISMVL.1997.601376
Filename :
601376
Link To Document :
بازگشت