Affiliation:
1. Lattice Semiconductor Corporation, San Jose, CA
2. Lattice Semiconductor Corporation, Cupertino, CA
Abstract
In addition to optimizing for long-path timing and routability, commercial FPGA routing engines must also optimize for various timing constraints, enabling users to fine tune their designs. These timing constraints involve both long- and short-path timing requirements. The intricacies of commercial FPGA architectures add difficulty to the problem of supporting such constraints. In this work, we introduce specific delay window routing as a general method for optimization during the routing stage of the FPGA design flow, which can be applied to various timing constraints constituting both long- and short-path requirements. Furthermore, we propose a key adjustment to standard FPGA routing technology for the purposes of specific delay window routing. By using dual-wave expansion instead of traditional single-wave expansion, we solve the critical issue of inaccurate delay estimation in our wave search, which would otherwise make routing according to a specific delay window difficult. Our results show that this dual-wave method can support stricter timing constraints than the standard single-wave method. For a suite of designs with constraints requiring connections to meet a target delay within 250ps, our dual-wave method could satisfy the requirement for all designs, whereas the single-wave method failed for more than two thirds of the designs.
Publisher
Association for Computing Machinery (ACM)
Reference10 articles.
1. Slack Allocation and Routing to Improve FPGA Timing While Repairing Short-Path Violations
2. A Formal Basis for the Heuristic Determination of Minimum Cost Paths
3. Peter S. Hauge Ravi Nair and Ellen J. Yoffa. 1987. Circuit Placement for Predictable Performance. IBM Thomas J. Watson Research Center Yorktown Heights NY. Peter S. Hauge Ravi Nair and Ellen J. Yoffa. 1987. Circuit Placement for Predictable Performance. IBM Thomas J. Watson Research Center Yorktown Heights NY.
4. Delay-Bounded Routing for Shadow Registers