
The AMD Versal ACAP provides a powerful heterogeneous architecture for accelerating kernels like general matrix multiplication (GEMM). Because the AI Engine (AIE) array mimics the spatial regularity of a systolic array (SA), mapping SA dataflows onto the fabric is highly intuitive. However, maximizing performance requires overcoming specific coordination challenges between data movement and compute cores. In this work, we demonstrate that the gap between theoretical peak and realized performance is the result of a fundamental "Systolic Tax" imposed by the AIE architecture. We provide a systematic study of 2D systolic mapping to quantify the architectural cost incurred when traditional wavefront data forwarding consumes execution cycles otherwise available for processing. This engine-level overhead leads to a simulated 8.2% compute cycle loss. To address this constraint, we implement a multicast-based SA (MCSA) design that leverages hardware multicasting for efficient operand delivery. This design is supported by a Mixed-Integer Non-Linear Programming model used for architectural optimization. Our design achieves a programmable logic frequency that analytically saturates the logic-engine communication band-width. While MCSA delivers a 1.28x throughput improvement over prior state-of-the-art systolic mappings, performance is ultimately limited by synchronization overhead, establishing a ceiling for systolic designs on these platforms and revealing the lack of parallel AIE-initiated data movement as a critical architectural bottleneck.
Foundation models such as SARATR-X have advanced Synthetic Aperture Radar (SAR) Automatic Target Recognition (ATR) by learning generalizable representations. Un-like standard Vision Transformers (ViTs), SARATR-X employs a hierarchical transformer with multi-stage feature extraction, deeper attention layers, and Relative Positional Encoding (RPE). While these enhancements improve SAR target recognition, they introduce significant challenges for real-time deployment: increased memory traffic, complex data layout transformations, and irregular memory access for RPE computation. To address these challenges, we present FASTR, the first FPGA accelerator for hierarchical transformer-based SAR foundation models. We introduce four key innovations: (1) a Hierarchical Multi-Purpose Buffer Architecture (HMBA) that reorganizes on-chip memory across stages without reallocation, (2) a data-layout transformation that enables implicit patch merging, (3) structured RPE bias integration that avoids irregular memory accesses, and (4) a Unified Processing Engine (UPE) that supports convolutions, linear projections, attention, and non-linear operations within a single compute core. We implement FASTR using high-level synthesis (HLS) targeting an AMD Xilinx defense-grade XQVU9P FPGA. Compared to CPU and GPU baselines, FASTR achieves 818x and 3x improvements in energy-delay product while delivering comparable latency to prior ViT accelerators despite processing a complex hierarchical Transformer architecture.
High-Level Synthesis (HLS) has democratised Field-Programmable Gate Array (FPGA) programming, yet Dynamic Partial Reconfiguration (DPR)—which enables runtime logic swapping for adaptive or oversized workloads—remains manual and expert-only. HiPR [1] adds limited compiler support but restricts modules to one-to-one region mappings without runtime management. MLIR-DPR introduces: (i) a dpr dialect in the Multi-Level Intermediate Representation (MLIR) infrastructure [2] for identifying mutually exclusive regions; (ii) automated interface synthesis, floorplanning, and multi-threaded scheduler generation; and (iii) demonstrated Software-Defined Radio (SDR), Design-Space Exploration (DSE), and virtual-area applications.
High-level synthesis allows users to express hardware designs in terms of software languages, raising the level of abstraction. However, most designers still prefer writing low-level RTL code. We present two classes of research works aiming to improve the appeal of HLS: (1) accelerators to showcase the power of HLS for ML applications, and (2) tools to improve the HLS developer experience.
Fully Homomorphic Encryption (FHE) enables privacy-preserving computation on encrypted data at a high computational cost. Among the existing schemes, CKKS is gaining traction thanks to its support for approximate arithmetic over real numbers. In such a scheme, the Number Theoretic Transform (NTT) is dominant, involving intensive modular arithmetic, twiddle-factor handling, and nontrivial memory access patterns. As a result, NTT acceleration has gained significant interest, with many FPGA designs achieving high throughput by aggressively exploiting device resources. While effective for NTT-centric work-loads, this approach is ill-suited to full FHE pipelines, where the NTT must coexist with other compute-intensive kernels. Thus, we propose ReFHE-NTT, a resource-efficient NTT accelerator tailored to such settings. Our design combines on-the-fly twiddle-factor fusion with specialized modular arithmetic for pseudo-Mersenne primes, reducing memory footprint and arithmetic cost without storing precomputed tables. We co-design and validate the accelerator on the KV260 MPSoC, supporting polynomial degrees log N is an element of 12...16 and CKKS parameter sets with moduli up to 64 bits per prime. To the best of our knowledge, ReFHE-NTT is the first solution targeting embedded platform to support full-scale CKKS parameter sets. Compared to prior FPGA designs, it achieves up to a 20.2x improvement in slice-equivalent efficiency over the fastest open-source accelerator and a 1.98x improvement over the most resource-efficient one. Integrated into HEAAN CKKS library, ReFHE-NTT delivers top end-to-end speedup of 15x for encoding and 7.9x for encryption, demonstrating how resource-driven NTT design can substantially improve FHE performance on embedded platforms.