Preprint · Preprints.org · October 27, 2026
From Algorithms to Bitstreams: A Survey of FPGA-Based Acceleration for Transformer Inference
Sayat Abdikul, Aitzhan Kadyrov, Nursultan Kabylkas, Kamilya Smagulova
Abstract
FPGA acceleration of Transformer inference involves model transformation, arithmetic optimization, memory organization, and deployment. This survey critically synthesizes 266 publications (2021–2026), identifying five mechanisms underlying performance gains: computation reduction, data movement reduction, arithmetic density, hardware utilization, and computational capacity. Quantization emerges as a frequently reported optimization, while architectural rankings depend on study selection and classification. Configuration-level comparisons and break-even analyses reveal how conversion, communication, integration overhead, and model quality constrain reported benefits. Supported by a traceable evidence map, the survey identifies limitations in existing evaluations and provides practical design guidance and controlled experiments for future FPGA-based Transformer accelerators.
More by Kamilya Smagulova
- Efficient and real-time perception: a survey on end-to-end event-based object detection in autonomous drivingFrontiers in Robotics and AI · 2025 · Citations: 7
- Chimera: a block-based neural architecture search framework for event-based object detectionFrontiers in Artificial Intelligence · 2025 · Citations: 4
- Adversarial Robustness and Transferability on Stochastic Resistive AcceleratorsInternational Conference on Machine Intelligence and Smart Innovation · 2025
- A recurrent YOLOv8-based framework for event-based object detectionFrontiers in Neuroscience · 2025 · Citations: 19
