By Topic

Fast factorization method for implicit cube set representation

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

1 Author(s)
S. -I. Minato ; NTT LSI Labs., Kanagawa, Japan

This paper presents a fast weak-division method for implicit cube set representation using Zero-Suppressed Binary Decision Diagrams, which are a new type of Binary Decision Diagram adapted for representing sets of combinations. Our new weak-division algorithm can be executed in a time almost proportional to the size of the graph, regardless of the number of cubes and literals. Based on this technique, we implemented a simple program for optimizing multilevel logic circuits. Experimental results indicate that we can quickly flatten and factorize multilevel logics even for parity functions and full adders, which have never been flattened in other methods. Our method greatly accelerates multilevel logic synthesis systems and enlarges the scale of applicable circuits

Published in:

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  (Volume:15 ,  Issue: 4 )