Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization
Open Access
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 353-358
Abstract
This paper presents a logic synthesis method for look-up table (LUT) based field programmable gate arrays (FPGAs). We determine functions to be mapped to LUTs by functional decomposition. We use not only disjunctive decomposition but also nondisjunctive decomposition. Furthermore, we propose a new Boolean resubstitution technique customized for an LUT network synthesis. Resubstitution is used to determine whether an existing function is useful to realize another function; thus, we can share the common function among two or more functions. The Boolean resubstitution is effectively carried out by solving a support minimization problem for an incompletely specified function. We can also handle satisfiability don't cares of an LUT network using the technique.Keywords
This publication has 14 references indexed in Scilit:
- Technology mapping via transformations of function graphs2003
- Efficient symbolic support manipulation2002
- Improved logic synthesis algorithms for table look up architectures2002
- Extracting local don't cares for network optimization2002
- Multi-level logic minimization based on minimal support and its application to the minimization of look-up table type FPGAs2002
- Boolean resubstitution with permissible functions and binary decision diagrams2002
- FPGA Design by Generalized Functional Decomposition1993
- Chortle-crf: Fast technology mapping for lookup table-based FPGAs1991
- Boolean Reasoning1990
- Minimization Over Boolean GraphsIBM Journal of Research and Development, 1962