Sciweavers

Share
ASPDAC
2005
ACM

STACCATO: disjoint support decompositions from BDDs through symbolic kernels

10 years 6 months ago
STACCATO: disjoint support decompositions from BDDs through symbolic kernels
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component functions have no common inputs. The decomposition of a function is desirable for several reasons. First, it’s a method to obtain a multiple-level implementation of a function. It leads to a partition in simpler blocks that easily results in smaller areas and fewer interconnects. Moreover, it exposes a parallelism in the computation of the function that can be exploited by hardware as well as during simulation. In this paper we present a novel algorithm, STACCATO, that generates a DSD decomposition starting from the BDD of a function. STACCATO is novel because 1) it provides a complete description of each decomposition, that is, it computes the ”kernel” function K relating the elements of each decomposition, and 2) it has better performance than previously known algorithms. Experimental results run on ...
Stephen Plaza, Valeria Bertacco
Added 13 Oct 2010
Updated 13 Oct 2010
Type Conference
Year 2005
Where ASPDAC
Authors Stephen Plaza, Valeria Bertacco
Comments (0)
books