By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
G. W. Dueck ; Dept. of Math. & Comp Sci., St. Francis Xavier Univ., Antigonish, NS, Canada ; G. H. J. van Rees

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

Published in:

Multiple-Valued Logic, 1991., Proceedings of the Twenty-First International Symposium on

Date of Conference:

26-29 May 1991