DocumentCode :
3094257
Title :
On the maximum number of implicants needed to cover a multiple-valued logic function using window literals
Author :
Dueck, G.W. ; van Rees, G.H.J.
Author_Institution :
Dept. of Math. & Comp Sci., St. Francis Xavier Univ., Antigonish, NS, Canada
fYear :
1991
fDate :
26-29 May 1991
Firstpage :
280
Lastpage :
286
Abstract :
Some bounds on the maximum number of implicants needed in a minimal sum of products expression using window literals and the truncated sum, operation are investigated. Functions with one input variable require at most r implicants in their minimum sum of products expression, where r is the radix of the function. Two variable functions with radix less than eight are analyzed. No firm bounds could be established for two variable functions with radix greater than four
Keywords :
many-valued logics; implicants; minimal sum of products; multiple-valued logic function; truncated sum; window literals; Algorithm design and analysis; Cost function; Input variables; Logic functions; Minimization methods; Programmable logic arrays;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Multiple-Valued Logic, 1991., Proceedings of the Twenty-First International Symposium on
Conference_Location :
Victoria, BC
Print_ISBN :
0-8186-2145-1
Type :
conf
DOI :
10.1109/ISMVL.1991.130743
Filename :
130743
Link To Document :
بازگشت