• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
      MCP&Skill
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    IEEE Symposium on Field-Programmable Custom Computing Machines

    IEEE Symposium on Field-Programmable Custom Computing Machines

    ConferenceCCF 计算机体系结构/并行与分布计算/存储系统 C

    年发文量

    研究主题

    论文(1671)

    排序
    1When Systolic Arrays Meet AI Engines: Architectural Constraints on AMD Versal ACAP
    Jason Kimko,Jason Cong

    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.

    2026
    引用
    AI阅读
    加入学术空间
    2FASTR: FPGA-based Acceleration of Hierarchical Foundation Models for SAR ATR
    Sachini Wickramasinghe, Cauligi Raghavendra,Viktor Prasanna

    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.

    2026
    引用
    AI阅读
    加入学术空间
    3Towards Compiler-Driven Dynamic Partial Reconfiguration with MLIR
    Gabriel Rodriguez-Canal,Nick Brown,Maurice Jamieson,Nicolas Bohm Agostini,Ankur Limaye,Vito Giovanni Castellana,Joseph Manzano,Antonino Tumeo

    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.

    2026
    引用
    AI阅读
    加入学术空间
    4From Acceleration to Accelerating Acceleration: Applications and Tools for Democratizing Hardware Design
    Rishov Sarkar, Cong (Callie) Hao

    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.

    2026
    引用
    AI阅读
    加入学术空间
    5ReFHE-NTT: Resource-Driven NTT FPGA Architecture for Fully Homomorphic Encryption
    Valentino Guerrini,Giuseppe Sorrentino,Alessandro Barenghi,Davide Conficconi

    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.

    2026
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 1671 篇论文

    高被引作者

    作者引用发文
    Wayne Luk259172
    Scott Hauck237924
    Brad Hutchings231317
    Viktor K. Prasanna190732
    Jason Cong180733
    John Wawrzynek172510
    André DeHon159612
    Philip Leong114619
    Paul Chow108219
    Brent Nelson106514

    高产作者

    作者引用发文
    Wayne Luk259172
    Jason Cong180733
    Viktor K. Prasanna190732
    George A. Constantinides79030
    Nachiket Kapre88627
    Scott Hauck237924
    Martin Herbordt71922
    Philip Leong114619
    Paul Chow108219
    Peter Y. K. Cheung70917

    相关期刊

    ACM Transactions on Reconfigurable Technology and Systems
    IEEE Computer Architecture Letters
    ACM International Conference on Computing Frontiers
    FPGA. ACM International Symposium on Field-Programmable Gate Arrays
    International Conference on Field-Programmable Logic and Applications
    International Conference on Field-Programmable Technology
    International Conference on Computer Design
    IEEE International Conference on Application-Specific Systems, Architectures, and Processors
    International Symposium on Computer Architecture
    Proceedings of the ACM Symposium on Cloud Computing