A method for finding good Ashenhurst decompositions and its application to FPGA synthesis

Autor:	Ted Stanion, Carl Sechen
Rok vydání:	1995
Předmět:	Set (abstract data type) Computer science Lookup table Decomposition (computer science) Function (mathematics) Boolean function Field-programmable gate array Data structure Algorithm
Zdroj:	DAC
DOI:	10.1145/217474.217507
Popis:	In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are based on the Roth-Karp algorithm. The algorithm presented here is based on finding an optimal cut in a BDD. This algorithm differs from previous decomposition algorithms in that the cut determines the size and composition of the bound set and the free set. Other methods examine all possible bound sets of an arbitrary size. We have applied this method to decomposing functions into sets of k-variable functions. This is a required step when implementing a function using a lookup table (LUT) based FPGA. The results compare very favorably to existing implementations of Roth-Karp decomposition methods.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::a4fdf6cba01d00020f71ba10436b98d1 https://doi.org/10.1145/217474.217507 Zobrazit plný text záznamu