Technology mapping of lookup table-based FPGAs for performance
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A novel technology mapping algorithm that reduces the delay of combinational circuits implemented with lookup-table-based field-programmable gate arrays (FPGAs) is presented. The algorithm reduces the contribution of logic block delays to the critical path delay by reducing the number of lookup tables on the critical path. The key feature of the algorithm is the use of bin packing to determine the gate-level decomposition of every node in the network. In addition, reconvergent paths and the replication of logic at fanout nodes are exploited to further reduce the depth of the lookup table circuit. For fanout-free trees the algorithm will construct the optimal depth K-input table circuit when K is less than or equal to 6.<>Keywords
This publication has 8 references indexed in Scilit:
- Timing optimization of combinational logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Logic synthesis for programmable gate arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Chortle: a technology mapping program for lookup table-based field programmable gate arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Technology mapping of lookup table-based FPGAs for performancePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Chortle-crf: Fast technology mapping for lookup table-based FPGAsPublished by Association for Computing Machinery (ACM) ,1991
- XmapPublished by Association for Computing Machinery (ACM) ,1991
- Technology mapping for a two-output RAM-based field programmable gate arrayPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- MIS: A Multiple-Level Logic Optimization SystemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987