By Topic

Multi-level logic optimization based on pseudo maximum sets of permissible 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

7 Author(s)
Higashida, M. ; Mitsubishi Electric Corp., Kamakura, Kanagawa, Japan ; Ishikawa, J. ; Hiramine, M. ; Nomura, K.
more authors

The transduction method is one of the strongest multilevel logic optimization algorithms. It uses permissible functions which represent Don't-Care conditions of a circuit. An original transduction algorithm has two sorts of sets of permissible functions: MSPF (maximum set of permissible functions) and CSPF (compatible set of permissible functions). A CSPF has the characteristics that computation time is short but optimization capability is weak. An MSPF has the opposite characteristics. The authors propose a new set of permissible functions, which is called pseudo-MSPF. It has the good characteristics of both a CSPF and an MSPF. The authors also shown that they can shorten the time for gate transformations by using pseudo-MSPFs instead of CSPFs. Experimental results show that the optimization based on pseudo-MSPFs can make logic equations with fewer literals, and shorten the total processing time than that based on CSPFs

Published in:

Design Automation, 1993, with the European Event in ASIC Design. Proceedings. [4th] European Conference on

Date of Conference:

22-25 Feb 1993