On area/depth trade-off in LUT-based FPGA technology mapping

Authors:
Jason Cong;Yuzheng Ding
Affiliations:
Department of Computer Science, University of California, Los Angeles, CA;Department of Computer Science, University of California, Los Angeles, CA
Venue:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Year:
1994

Citing 9
Cited 5

Logic synthesis for programmable gate arrays

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
A CAD system for the design of field programmable gate arrays

DAC '91 Proceedings of the 28th 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
Xmap: A technology mapper for table-lookup field-programmable gate arrays

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
A heuristic method for FPGA technology mapping based on the edge visibility

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
An optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs

ICCAD '92 1992 IEEE/ACM international conference proceedings on Computer-aided design
Beyond the combinatorial limit in depth minimization for LUT-based FPGA designs

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
DAG-Map: Graph-Based FPGA Technology Mapping for Delay Optimization

IEEE Design & Test
Routability-Driven Techology Mapping for LookUp-Table-Based FPGAs

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

Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation

Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
A Performance-Oriented Algorithm with Consideration on Communication Cost for Dynamically Reconfigurable FPGA Partitioning

ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Rethinking FPGAs: elude the flexibility excess of LUTs with and-inverter cones

Proceedings of the ACM/SIGDA international symposium on Field Programmable Gate Arrays
Power dissipation impact of the technology mapping synthesis on look-up table architectures

PATMOS'05 Proceedings of the 15th international conference on Integrated Circuit and System Design: power and Timing Modeling, Optimization and Simulation
Automated generation of basic custom sensor-based embedded computing systems guided by end-user optimization criteria

UbiComp'06 Proceedings of the 8th international conference on Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the area and depth trade-off in lookup-table (LUT) based FPGA technology mapping. Starting from a depth-optimal mapping solution, we perform a sequence of depth relaxation operations and area-minimizing mapping procedures to produce a set of mapping solutions for a given design with smooth area and depth trade-off. As the core of the area minimization step, we have developed a polynomial time optimal algorithm for computing an area-minimum mapping solution without node duplication for a K-bounded general Boolean network, which makes a significant step towards complete understanding of the general area minimization problem in FPGA technology mapping. The experimental results on MCNC benchmark circuits show that our solution sets outperform the solutions produced by most existing mapping algorithms in terms of both area and depth minimization.