Papers for

fpga design engineers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Timing optimization strategies improve large FPGA design flows

Exploring and optimizing the Vivado Flow on large FPGA designs: A Practical Analysis of Strategies and Their Impact on Timing

Abstract: Achieving timing closure in FPGA designs is crucial, especially for high-performance applications. The Vivado Design Suite offers several strategies for optimization, but finding the best configuration for a given project remains challenging. This paper explores the various Vivado's timing directives and strategies to improve performance across timing, area, and runtime. Through two test-case designs, an NQR spectrometer SoC-FPGA and a digital readout ASIC prototype for high energy physics particle detector's, different strategies and configurations are compared to identify the most efficient flow.

Wed 28 OctHardware Architecture
The gist
Making sure electronic designs work quickly and correctly on special chips called FPGAs is very important but difficult. The paper looks at how different settings in the Vivado software, which helps prepare these designs, affect speed and efficiency. By testing two real-life example designs, the authors found which strategies help make the designs run faster and use fewer resources. This helps engineers pick the best methods for their complex FPGA projects.
Open → 2610.38575v1

DiffRouter speeds up FPGA routing with new gradient method

DiffRouter: A Differentiable Routing Framework for UltraScale FPGAs

Abstract: Routing has become a major bottleneck in large-scale FPGA design flows, where traditional routers rely on sequential net-by-net processing and rip-up-reroute heuristics. This inherent sequentialism limits parallelism, leads to suboptimal utilization of routing resources, and significantly increases runtime on modern FPGAs. This paper introduces DiffRouter, the first differentiable, gradient-based FPGA routing framework with GPU acceleration. By lifting routing into a continuous optimization space, DiffRouter enables highly concurrent routing and improved global optimality before projecting solutions back onto the discrete fabric. The framework consists of three key stages: (1) Resource-pruned preprocessing, which extracts compact routing variables per net to reduce memory footprint and problem complexity; (2) Differentiable global routing via gradient descent, which formulates routing as a Lagrangian-relaxed optimization that minimizes wirelength while iteratively enforcing connectivity and congestion constraints as relaxed terms; and (3) Postprocessing, which maps the continuous wire distributions to a valid UltraScale routing solution and completes solutions by detailed routing. Experiments on the FPGA 2024 Routing Contest benchmarks show that DiffRouter outperforms state-of-the-art parallel routers, achieving over 5x speedup over RWRoute and 2x over Vivado, and running 18% faster than the state-of-the-art academic FPGA router Potter while delivering competitive critical path wirelength.

Sat 24 OctHardware Architecture
The gist
Routing electrical connections on very large FPGAs can be slow and inefficient because traditional methods handle one connection at a time and rely on trial-and-error fixes. The authors created DiffRouter, which treats routing as a continuous problem that can be solved all at once using gradients and GPUs, making it much faster. After this smooth optimization, it converts the solution back into real, usable FPGA connections. Tests show DiffRouter runs several times faster than existing tools while keeping wiring efficient.
Open → 2610.33510v1

Graph circuit digital twin predicts routing delays in zynq ultrascale plus fpgas

GRACIDIT: Graph-Circuit Digital Twin for Configuration-Induced Routing Delay Prediction in Zynq UltraScale+ FPGAs

Abstract: Configuration-induced perturbations in SRAM-based FPGAs may activate dormant programmable routing branches and increase path delay without immediately producing a functional error. Although prior studies have separately investigated the electrical origin of these delay changes, their in-situ detection, and the topology of commercial routing fabrics, a scalable method for predicting their timing impact at the granularity of programmable interconnect points and routed nets remains unavailable. This paper presents GRACIDIT, a graph-circuit digital twin framework for predicting configuration-induced routing delay degradation in Zynq UltraScale+ FPGAs. The proposed framework extracts the routing-resource graph of the XCZU7EV programmable fabric from the vendor design database, identifies inactive programmable interconnect points adjacent to active routes, and represents each candidate perturbation through its branch topology, geometric span, fan-out, physical region, and downstream loading. These graph features are combined with a calibrated reduced-order electrical model to estimate the delay introduced by single and cumulative routing-branch activations. Controlled configuration-equivalent perturbations are generated on a ZCU104 platform and characterized using complementary routing-domain oscillators and phase-sweep probes. The resulting model associates predicted delay shifts with available timing slack to rank vulnerable programmable interconnect points and routed nets and to construct a spatial vulnerability atlas of the programmable fabric. Experimental evaluation demonstrates a mean absolute prediction error of 7.8 ps, achieves 87.4 percent recall for slack-violating perturbations, and attains a Recall at 10 value of 0.90 for the most vulnerable routing resources.

Thu 24 SeptHardware ArchitectureEmerging Technologies
The gist
Some programmable chips can slow down unexpectedly due to certain unused circuit pieces becoming active after configuration, which is hard to predict and can affect performance. The authors present GRACIDIT, a method that builds a detailed model of the chip’s routing resources and uses electrical simulations to estimate these delay changes. By testing on a real FPGA, they show their approach can accurately predict which routes are vulnerable to delay increases and rank them by risk. This helps designers know where timing problems might arise before actual functional errors occur.
Open → 2609.30534v1