Timing Closure on FPGAs
Sleep peacefully at night knowing that your design is in tip-top shape
By Nelson Lau, Spirent Communications
pldesignline.com (April 22, 2010)
Have you ever written code that behaves correctly under a simulator only to have intermittent failures in the field? Or maybe your code no longer functions properly when you compile with a newer version of your tool chain. You review your test bench and verify 100 percent complete test coverage and that all tests have passed with no errors--yet the problem stubbornly remains.
While designers understandably place great emphasis on coding and simulation, they often have only a nodding acquaintance with the internal workings of the silicon within an FPGA. As a result, incorrect logic synthesis and timing problems, rather than logic errors, are the cause of most logic failures.
But writing FPGA code that creates predictable, reliable logic is simple if designers take the right steps.
In FPGA design, logic synthesis and related timing closure occur during compilation. And many things, including I/O cell structure, asynchronous logic and timing constraints, can have a big impact on the compilation process, varying results with each pass through the tool chain. Let's take a closer look at ways to eliminate these variances to better and more quickly achieve timing closure.
E-mail This Article | Printer-Friendly Page |
Related Articles
- How to achieve timing-closure in high-end FPGAs
- FPGA prototyping of complex SoCs: Partitioning and Timing Closure Challenges with Solutions
- Why Transceiver-Rich FPGAs Are Suitable for Vehicle Infotainment System Designs
- FPGAs - The Logical Solution to the Microcontroller Shortage
- CPU Soft IP for FPGAs Delivers HDL Optimization and Supply Chain Integrity