High-performance algorithm for Boolean function minimization: the partitioned incremental splitting of intervals (PISI)

Martha Torres; Nina Sumiko Tomita Hirata; Junior Barrera

doi:10.1117/12.468015

22 May 2002 High-performance algorithm for Boolean function minimization: the partitioned incremental splitting of intervals (PISI)

Martha Torres, Nina Sumiko Tomita Hirata, Junior Barrera

Author Affiliations +

Proceedings Volume 4667, Image Processing: Algorithms and Systems; (2002) https://doi.org/10.1117/12.468015
Event: Electronic Imaging, 2002, San Jose, California, United States

Abstract

This paper presents a new algorithm for the minimization of Boolean functions: the Partitioned Incremental Splitting of Intervals (PISI). This algorithm permits a high performance distributed implementation with a high speedup with relation to the original ISI algorithm, and an acceptable increase in the Boolean function representation complexity. Experimental results illustrate the main characteristics of the technique proposed.

Citation Download Citation

Martha Torres, Nina Sumiko Tomita Hirata, and Junior Barrera "High-performance algorithm for Boolean function minimization: the partitioned incremental splitting of intervals (PISI)", Proc. SPIE 4667, Image Processing: Algorithms and Systems, (22 May 2002); https://doi.org/10.1117/12.468015

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available