{"docs":[{"id":132,"title":"FPGA Timing Closure: Constraints, Slack and Clock Domains","heading":"FPGA Timing Closure: Constraints, Slack and Clock Domains","subheading":null,"category":"FPGA Design","body":{"root":{"type":"root","children":[{"type":"heading","tag":"h3","version":1,"children":[{"type":"text","text":"Reading and fixing slack","version":1}]},{"type":"paragraph","version":1,"children":[{"type":"text","text":"Each timing path runs from a launching register to a capturing register. Setup slack is the time available, set by the clock period and clock skew, minus the time the data takes through logic and routing. At 200 MHz the whole budget is 5 ns, shared between logic levels and interconnect.","version":1}]},{"type":"paragraph","version":1,"children":[{"type":"text","text":"When paths fail, look first at logic depth and fan-out. Adding pipeline registers, restructuring wide comparisons and replicating high fan-out registers usually help more than tool settings. Once the structure is sound, placement constraints and optimisation options are worth tuning.","version":1}]}],"direction":"ltr","format":"","indent":0,"version":1}},"tags":"FPGA Design, Timing Analysis, Constraints","cardCta":{"label":null,"link":null},"pageCta":{"label":"Talk to AAVICO engineering","link":"/contact"},"excerpt":"An FPGA design that passes simulation can still fail in hardware if timing is not met. Constraints, slack and clock-domain crossings decide whether it works.","featuredImage":null,"type":"Blog","readTime":"3 min read","publishedAt":"2026-11-15T21:43:00.000Z","heroImage":null,"introText":"Simulation shows that a design is logically correct. It does not show that every signal reaches its destination register in time. That is the job of static timing analysis, which the FPGA tools run after placement and routing using constraints the designer supplies. A design with missing or wrong constraints can report success and still fail on the bench. This article explains constraints, slack and the care needed between clock domains.","metrics":[{"id":"fpga-timing-closure-constraints-slack-and-clock-metric-1","value":"Slack","label":"Required arrival time minus actual arrival time. Negative slack is a timing failure.","icon":null},{"id":"fpga-timing-closure-constraints-slack-and-clock-metric-2","value":"WNS","label":"Worst negative slack: the worst single path, which must be zero or positive.","icon":null},{"id":"fpga-timing-closure-constraints-slack-and-clock-metric-3","value":"TNS","label":"Total negative slack: the sum over all failing endpoints, a measure of how far off the design is.","icon":null},{"id":"fpga-timing-closure-constraints-slack-and-clock-metric-4","value":"2 flops","label":"The minimum synchroniser for a single-bit signal crossing between unrelated clocks.","icon":null}],"gallery":[],"challenge":{"root":{"type":"root","children":[{"type":"paragraph","version":1,"children":[{"type":"text","text":"Timing analysis only checks what it is told about. A clock without a constraint, an input with no input delay, or a path wrongly marked as false is either not analysed or analysed against the wrong requirement, and the report can look clean while the hardware fails intermittently.","version":1}]},{"type":"paragraph","version":1,"children":[{"type":"text","text":"Clock-domain crossings are a separate hazard. A signal passing between unrelated clocks will eventually be sampled while it is changing, and the receiving flip-flop can go metastable. Static timing analysis does not fix this; the design must.","version":1}]}],"direction":"ltr","format":"","indent":0,"version":1}},"blockquote":{"quote":"A clean timing report is only as trustworthy as the constraints behind it. Review the constraints as carefully as the logic.","author":"","role":"AAVICO Engineering"},"supportImage1":null,"deliverables":{"root":{"type":"root","children":[{"type":"paragraph","version":1,"children":[{"type":"text","text":"Constrain every clock, including generated clocks, and every input and output with delays derived from the external devices and the board.","version":1}]},{"type":"paragraph","version":1,"children":[{"type":"text","text":"Declare clock relationships explicitly, marking unrelated clocks as asynchronous so the tools do not time paths that cannot be timed.","version":1}]},{"type":"paragraph","version":1,"children":[{"type":"text","text":"Use proper synchronisers for every crossing, review the clock-interaction and unconstrained-path reports, and treat any negative slack as a failure.","version":1}]}],"direction":"ltr","format":"","indent":0,"version":1}},"results":[{"id":"fpga-timing-closure-constraints-slack-and-clock-result-1","title":"Reliable Hardware","description":"Designs that meet complete constraints work across the analysed conditions."},{"id":"fpga-timing-closure-constraints-slack-and-clock-result-2","title":"No Intermittent Faults","description":"Correct synchronisers prevent rare metastability failures."},{"id":"fpga-timing-closure-constraints-slack-and-clock-result-3","title":"Faster Closure","description":"Structural fixes resolve failing paths at their cause."},{"id":"fpga-timing-closure-constraints-slack-and-clock-result-4","title":"Trustworthy Reports","description":"Complete constraints mean the analysis covers every path."}],"lookingAhead":{"root":{"type":"root","children":[{"type":"paragraph","version":1,"children":[{"type":"text","text":"Multi-bit values crossing domains need more than individual synchronisers: use a handshake, a Gray-coded counter or an asynchronous FIFO.","version":1}]},{"type":"paragraph","version":1,"children":[{"type":"text","text":"Leave timing margin in early builds. A design that closes with no slack to spare tends to fail closure after the next small change.","version":1}]}],"direction":"ltr","format":"","indent":0,"version":1}},"supportImage2":null,"testimonial":{"quote":null,"author":null,"role":null,"photo":null},"challengesSolved":[{"id":"fpga-timing-closure-constraints-slack-and-clock-challenge-1","title":"Clocks or I/O left unconstrained","description":null,"icon":null},{"id":"fpga-timing-closure-constraints-slack-and-clock-challenge-2","title":"Paths hidden by incorrect false-path constraints","description":null,"icon":null},{"id":"fpga-timing-closure-constraints-slack-and-clock-challenge-3","title":"Metastability from unsynchronised crossings","description":null,"icon":null},{"id":"fpga-timing-closure-constraints-slack-and-clock-challenge-4","title":"Multi-bit buses synchronised bit by bit","description":null,"icon":null}],"relatedPosts":[],"contactUs":{"show":true},"updatedAt":"2026-11-15T17:32:32.682Z","createdAt":"2026-11-15T17:32:32.682Z"}],"hasNextPage":false,"hasPrevPage":false,"limit":10,"nextPage":null,"page":1,"pagingCounter":1,"prevPage":null,"totalDocs":1,"totalPages":1}