A Novel RFET-Based FPGA Architecture Based on Delay-Aware Packing Algorithm
Reconfigurable devices are attracting growing interest as both a potential alternative and complement to traditional CMOS technology. This paper develops a novel fieldprogrammable gate array (FPGA) architecture based on MClusters, which is made of fast and area-efficient 2-input lookup tables (LUTs) through reconfigurable field-effect transistors (RFETs). To fully utilize the MClusters, we propose an SAT-based delay-aware packing algorithm for the technology mapping. In addition, we integrate a partitioning algorithm to divide the circuit into several sub-circuits to further reduce the global routing resources and their associated switching energy of the system. Finally, we develop an efficient technology/circuit/system co-design framework for optimizing the overall performance of FPGAs. Based on comprehensive benchmarking, results demonstrate that optimal design yields significant reductions of up to 39% area, 36% wire length, and 40% switching energy compared to traditional CMOS 6-input LUT FPGAs.
Authors
- Qi‐Lian Liang (ORCID: https://orcid.org/0000-0003-3245-1239)
- 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)
- Sheng Lu (ORCID: https://orcid.org/0009-0001-2570-0690)
Institutions
- South Dakota State University (US)
- The University of Texas at Arlington (US)
Publication Details
- Journal
- IEEE Transactions on Emerging Topics in Computing
- Published
- 2025-06-16
- DOI
- https://doi.org/10.1109/tetc.2025.3572712
- Primary Topic
- VLSI and Analog Circuit Testing
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- U.S. Department of Energy
- Advanced Scientific Computing Research