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

Decomposition-based synthesis of multiple-valued functions for threshold logic network realization

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)
Abdel-Hamid, G.H. ; Dept. of Comput. Sci., Saskatchewan Univ., Saskatoon, Sask., Canada ; Abd-El-Barr, M.H.

In this paper, a sub-optimal algorithm for reducing the number of threshold elements required to realize a given binary function is presented. The algorithm uses a matching-count matrix to obtain the input-output pairing that results the maximum total matching count, thus minimizing the number of switching operations required. The concept of output phase assignment is used to extend the approach to handle multiple-valued logic functions. Experimental results are given to illustrate the merits of the proposed algorithms

Published in:

Multiple-Valued Logic, 1994. Proceedings., Twenty-Fourth International Symposium on

Date of Conference:

25-27 May 1994

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.