By Topic

On the minimization of multiple-valued input binary-valued output functions [logic synthesis]

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

4 Author(s)
H. M. H. Babu ; Dept. of Comput. Sci., Dhaka Univ., Bangladesh ; M. I. Zaber ; M. R. Islam ; M. M. Rahman

The success of the local covering approach to multiple-valued input two-valued output (MVITVO) functions minimization depends greatly on the proper choice of the base minterms from the ON set of the new techniques developed to improve the performance of this approach. We have introduced a graph called an enhanced assignment graph (EAG) for the efficient grouping of the Boolean variables. In order to make the best choice of the proper base minterm we have defined a new technique to find the potential canonical cube (PCC) covering it. In this process, we have succeeded in finding out the essential primes efficiently which enhances the total computation time and produces better sum of products (SOP).

Published in:

Multiple-Valued Logic, 2004. Proceedings. 34th International Symposium on

Date of Conference:

19-22 May 2004