Share Email Print

Proceedings Paper

High-performance algorithm for Boolean function minimization: the partitioned incremental splitting of intervals (PISI)
Author(s): Martha Torres; Nina Sumiko Tomita Hirata; Junior Barrera
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 22 May 2002
PDF: 10 pages
Proc. SPIE 4667, Image Processing: Algorithms and Systems, (22 May 2002); doi: 10.1117/12.468015
Show Author Affiliations
Martha Torres, Univ. de Sao Paulo (Brazil)
Nina Sumiko Tomita Hirata, Univ. de Sao Paulo (Brazil)
Junior Barrera, Univ. de Sao Paulo (Brazil)

Published in SPIE Proceedings Vol. 4667:
Image Processing: Algorithms and Systems
Edward R. Dougherty; Jaakko T. Astola; Karen O. Egiazarian, Editor(s)

© SPIE. Terms of Use
Back to Top