By Topic

Optimal output assignment and the maximum number of implicants needed to cover the multiple-valued logic functions

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
$31 $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

3 Author(s)
Hata, Y. ; Fac. of Eng., Himeji Inst. of Technol., Japan ; Miyawaki, F. ; Yamato, K.

Optimal output assignment is proposed to reduce the number of implicants in a minimal sum-of-products expression, where sum refers to TSUM. Some bounds on the maximum number of implicants needed to cover an output permuted function are clarified. One-variable output permuted functions require at most p-1 implicants in their minimal sum-of-products expressions, where p is the radix. Two-variable functions with radix between three and six are analyzed. Some speculations on the minimum number of the implicants are confirmed for functions with a higher radix and more than two variables. Computer simulation shows that output-permuted functions require 15% fewer implicants on the average

Published in:

Multiple-Valued Logic, 1992. Proceedings., Twenty-Second International Symposium on

Date of Conference:

27-29 May 1992