Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization

Authors:
Hiroshi Sawada;Takayuki Suyama;Akira Nagoya
Affiliations:
NTT Communication Science Laboratories, 2-2 Hikaridai, Seika-cho, Soraku-gun, Kyoto 619-02, Japan;NTT Communication Science Laboratories, 2-2 Hikaridai, Seika-cho, Soraku-gun, Kyoto 619-02, Japan;NTT Communication Science Laboratories, 2-2 Hikaridai, Seika-cho, Soraku-gun, Kyoto 619-02, Japan
Venue:
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Year:
1995

Citing 6
Cited 21

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Boolean resubstitution with permissible functions and binary decision diagrams

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Chortle-crf: Fast technology mapping for lookup table-based FPGAs

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
BDD based decomposition of logic functions with application to FPGA synthesis

DAC '93 Proceedings of the 30th international Design Automation Conference
Optimum functional decomposition using encoding

DAC '94 Proceedings of the 31st annual Design Automation Conference
Technology Mapping via Transformations of Function Graphs

ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors

Combinational logic synthesis for LUT based field programmable gate arrays

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A new method to express functional permissibilities for LUT based FPGAs and its applications

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Compatible class encoding in hyper-function decomposition for FPGA synthesis

DAC '98 Proceedings of the 35th annual Design Automation Conference
Constructive library-aware synthesis using symmetries

DATE '00 Proceedings of the conference on Design, automation and test in Europe
High-quality sub-function construction in functional decomposition based on information relationship measures

Proceedings of the conference on Design, automation and test in Europe
An efficient framework of using various decomposition methods to synthesize LUT networks and its evaluation

ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
Three parameters to find functional decompositions

ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
Finding an optimal functional decomposition for LUT-based FPGA synthesis

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
BDD-based logic synthesis for LUT-based FPGAs

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Genetic engineering versus natural evolution: genetic algorithms with deterministic operators

Journal of Systems Architecture: the EUROMICRO Journal
Optimum Functional Decomposition for LUT-Based FPGA Synthesis

FPL '00 Proceedings of the The Roadmap to Reconfigurable Computing, 10th International Workshop on Field-Programmable Logic and Applications
Resynthesis of multi-level circuits under tight constraints using symbolic optimization

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
ON-LINE TESTABLE LOGIC DESIGN FOR FPGA IMPLEMENTATION

ITC '97 Proceedings of the 1997 IEEE International Test Conference
Effective and efficient FPGA synthesis through general functional decomposition

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Reconfigurable systems
A method to decompose multiple-output logic functions

Proceedings of the 41st annual Design Automation Conference
General decomposition of incompletely specified sequential machines with multi-state behavior realization

Journal of Systems Architecture: the EUROMICRO Journal
An efficient algorithm for finding the minimal-area FPGA technology mapping

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Information-driven circuit synthesis with the pre-characterized gate libraries

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Reconfigurable embedded systems: Synthesis, design and application
A transduction-based framework to synthesize RSFQ circuits

ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
Boolean factoring and decomposition of logic networks

Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
A relational approach to functional decomposition of logic circuits

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.00

Visualization

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.