Close category search window
 

A Frontier algorithm for optimization of 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

2 Author(s)
Abd-El Barr, M. ; Dept. of Comput. Eng., King Fahd Univ. of Pet. & Miner., Dhahran, Saudi Arabia ; Abd-El-Barr, M.M.

A new algorithm, called the Frontiers algorithm, for optimizing the number of product terms required for the implementation of monotonic and permuted monotonic MVL functions is proposed. All experimental system restricted to the case of 2 variable 4-valued set of logic functions has been programmed using the C language and was interfaced to the HAMLET CAD tool to implement the proposed algorithm. The system was tested using 2231 randomly generated monotonic and permuted monotonic functions. The results obtained indicate that the frontiers-based algorithm compares favorably to existing heuristic minimization techniques with the added advantage that it requires less number of implicants to represent the target functions

Published in:
Multiple-Valued Logic, 1998. Proceedings. 1998 28th IEEE International Symposium on

Date of Conference: 27-29 May 1998

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.