An expert-guided LLM framework translates C/C++ kernels into HLS FPGA designs, outperforming ChatHLS on PolyBench with a 4.24x geometric-mean speedup and valid RTL designs for all 14 attempted kernels.
LAAFD: LLM-based Agents for Accelerated FPGA Design
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
FPGAs offer high performance, low latency, and energy efficiency for accelerated computing, yet adoption in scientific and edge settings is limited by the specialized hardware expertise required. High-level synthesis (HLS) boosts productivity over HDLs, but competitive designs still demand hardware-aware optimizations and careful dataflow design. We introduce LAAFD, an agentic workflow that uses large language models to translate general-purpose C++ into optimized Vitis HLS kernels. LAAFD automates key transfor mations: deep pipelining, vectorization, and dataflow partitioning and closes the loop with HLS co-simulation and synthesis feedback to verify correctness while iteratively improving execution time in cycles. Over a suite of 15 kernels representing common compute patterns in HPC, LAFFD achieves 99.9% geomean performance when compared to the hand tuned baseline for Vitis HLS. For stencil workloads, LAAFD matches the performance of SODA, a state-of-the-art DSL-based HLS code generator for stencil solvers, while yielding more readable kernels. These results suggest LAAFD substantially lowers the expertise barrier to FPGA acceleration without sacrificing efficiency.
citation-role summary
citation-polarity summary
fields
cs.AR 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
HLSmith: An Expert-Guided Agentic Framework for C/C++-to-HLS Translation
An expert-guided LLM framework translates C/C++ kernels into HLS FPGA designs, outperforming ChatHLS on PolyBench with a 4.24x geometric-mean speedup and valid RTL designs for all 14 attempted kernels.