A Novel Delay-Aware Packing Algorithm for FPGA Architecture Using RFET
Reconfigurable devices are gaining increasing attention as a viable alternative and supplementary solution to traditional CMOS technology. In this paper, we develop a more efficient 2-input look-up table (LUT) based on the reconfigurable field-effect transistors (RFETs), leading to a smaller transistor usage and a smaller critical path delay. The cells are organized into regular matrices, known as MClusters, with a fixed interconnection pattern to replace LUTs in field-programmable gate arrays (FPGAs). To improve the efficiency of utilizing this structure, we design a SAT-based delay-aware packing algorithm to better utilize logical gates for the MCluster structure. Finally, we combine this algorithm with FPGA simulation tools to form a comprehensive benchmarking flow. A series of benchmark tests show that under the optimal design, up to 35% and 30% reduction can be achieved in delay and energy-delay product (EDP), respectively, compared to the traditional CMOS FPGAs.
Authors
- Chenyun Pan (ORCID: https://orcid.org/0000-0001-9161-1728)
- Liuting Shang (ORCID: https://orcid.org/0000-0001-8149-8696)
- Sungyong Jung (ORCID: https://orcid.org/0000-0002-0749-0394)
- Yichen Zhang (ORCID: https://orcid.org/0000-0002-6925-0775)
- Sheng Lu (ORCID: https://orcid.org/0000-0003-4577-9022)
Institutions
- The University of Texas at Arlington (US)
Publication Details
- Published
- 2024-08-11
- DOI
- https://doi.org/10.1109/mwscas60917.2024.10658759
- Citations
- 1
- Primary Topic
- VLSI and FPGA Design Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.21