On the maximum number of implicants needed to cover a multiple-valued logic function using window literals

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.<>