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

An effective computer algorithm for the calculation of disjoint cube representation of Boolean 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

3 Author(s)
Falkowski, B.J. ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore ; Schafer, I. ; Chip-Hong Chang

An efficient computer algorithm is shown to calculate an optimal cube array specification of Boolean functions. Since the number of disjoint cubes is much smaller than the number of minterms, the memory requirements are significantly reduced. The results of a comparison of the execution of the program with ESPRESSO for the MCNC benchmark functions are given

Published in:

Circuits and Systems, 1993., Proceedings of the 36th Midwest Symposium on

Date of Conference:

16-18 Aug 1993

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.