Cart (Loading....) | Create Account
Close category search window
 

Multiple-valued logic minimization by genetic algorithms

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

5 Author(s)
Hata, Y. ; Dept. of Comput. Eng., Himeji Inst. of Technol., Himeji, Japan ; Hayase, K. ; Hozumi, T. ; Kamiura, N.
more authors

This paper describes an approach to minimize multiple-valued logic expressions by genetic algorithms. We encode a multiple-valued logic expression as a “chromosome” whose length allows to change and corresponds to the number of implicants of the expression. Our fitness function evaluates the following three items. 1. How may outputs does the logic expression represent correctly? 2. How many implicants does the logic expression require? 3. How many connections does the logic expression require? Our method employs the fitness function and minimizes sum-of-products expressions, where sum refers to TSUM or MAX and product refers to MIN of set literals or window literals. The simulation results show that our method derives good results for some arithmetic functions and intends to avoid the local minimal solution, compared to neural-computing-based method

Published in:

Multiple-Valued Logic, 1997. Proceedings., 1997 27th International Symposium on

Date of Conference:

28-30 May 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.