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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Novel RFET-Based FPGA Architecture Based on Delay-Aware Packing Algorithm

Qi‐Lian Liang, Chenyun Pan, Liuting Shang, Sungyong Jung et al.
IEEE Transactions on Emerging Topics in Computing
VLSI and Analog Circuit Testing
article

A Novel RFET-Based FPGA Architecture Based on Delay-Aware Packing Algorithm

Qi‐Lian Liang, Chenyun Pan, Liuting Shang, Sungyong Jung, Sheng Lu
article en

Abstract

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.

IEEE Transactions on Emerging Topics in ComputingVol. 13(3)
South Dakota State University (US), The University of Texas at Arlington (US)
U.S. Department of Energy, Advanced Scientific Computing Research
Affordable and clean energy
Openalex Percentile: Top 87%
VLSI and Analog Circuit Testing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.