How to achieve timing-closure in high-end FPGAs
January 23, 2008 -- pldesignline.com
Using graph-based physical synthesis to achieve timing closure in high-capacity, high-performance FPGAs.
Introduction
Timing-closure is a growing concern for FPGA designers, particularly with the recent introduction of multi-million gate architectures fabricated at the 90 nm and 65 nm technology nodes. It is not sufficient for a timing-closure solution – the entire flow, including synthesis – to meet only the required timing; such a solution must also minimize the number of time-consuming synthesis-place-route iterations and provide results that remain stable across multiple physical synthesis runs and during final routing.
The designers' end goal is to ensure that timing will be met at the end of the FPGA design flow and to implement and debug the FPGA system as quickly and as soon as possible, possibly with the need to incorporate design changes and spec modifications along the way.
Placement and availability of routing resources play a huge role in the designers' ability to meet eventual performance goals in their FPGA implementation. Simultaneous logic synthesis and physical placement optimizations allow designers to rapidly drive towards – and concurrently lock-down – timing performance in their FPGA. The performance is more readily ensured when the synthesis tool passes legalized placement information to the FPGA vendor's back-end tools.
E-mail This Article | Printer-Friendly Page |
|
Related Articles
- Timing Closure on FPGAs
- How to achieve faster compile times in high-density FPGAs
- Meeting signal integrity requirements in FPGAs with high-end memory interfaces
- FPGAs aid in high-end memory interface design
- The complete series of high-end DDR IP solutions of Innosilicon is industry-leading and across major foundry processes
New Articles
- Quantum Readiness Considerations for Suppliers and Manufacturers
- A Rad Hard ASIC Design Approach: Triple Modular Redundancy (TMR)
- Early Interactive Short Isolation for Faster SoC Verification
- The Ideal Crypto Coprocessor with Root of Trust to Support Customer Complete Full Chip Evaluation: PUFcc gained SESIP and PSA Certified™ Level 3 RoT Component Certification
- Advanced Packaging and Chiplets Can Be for Everyone
Most Popular
- System Verilog Assertions Simplified
- System Verilog Macro: A Powerful Feature for Design Verification Projects
- UPF Constraint coding for SoC - A Case Study
- Dynamic Memory Allocation and Fragmentation in C and C++
- Enhancing VLSI Design Efficiency: Tackling Congestion and Shorts with Practical Approaches and PnR Tool (ICC2)