FPGA DEVICES · ENGINEERING · SOURCING Source-linked information. Clear project requirements.

Tutorials

False Path vs Multicycle Path: Prove the Exception Before Adding It

Published · Updated

A false path removes a timing check from the selected path. A multicycle constraint changes which clock edges define that check. Neither makes slow logic faster. Choose an exception only after the functional behavior explains why the default timing relationship is wrong.

Decide what the hardware actually does

Begin at the launch and capture registers. Can data launched here be captured there on the next active edge? If yes, the ordinary single-cycle requirement may be correct. “This block is usually idle” does not establish that it can never capture on an earlier edge.

XC7Z010 on a Parallella DK02 board. A device identity does not establish the functional or clock-edge proof required by a timing exception.
XC7Z010 on a Parallella DK02 board. A device identity does not establish the functional or clock-edge proof required by a timing exception. Photo: Gareth Halfacree from Bradford, UK. Original image, CC BY-SA 2.0.

The Zynq device photograph identifies a physical programmable device, but it says nothing about the validity of an exception. That proof comes from the RTL, operating modes and clock relationships. Review the failing path before changing its analysis.

Functional situationCandidate treatment
Path is used and must be captured next cycleKeep the normal timing check.
Path is used, but the protocol guarantees later captureInvestigate a multicycle model with explicit edge proof.
Selected path is not a valid synchronous timing pathInvestigate a narrowly scoped false-path or other appropriate constraint.
Relationship or enable behavior is unknownLeave the exception unresolved and gather evidence.

An asynchronous crossing still needs a safe structure. Cutting its timing relationship is not a substitute for a synchronizer or protocol.

Draw the capture edges for a multicycle path

Same-clock illustration: launch 0, intended capture 3Same-clock illustration: launch 0,intended capture 30123LaunchCaptureEdges 1 and 2: capture prohibited
Illustrative same-clock contract with capture at edge 3. It is valid only if the RTL/protocol prevents earlier capture; hold edges still need separate review.

Consider one clock domain where the source launches at edge 0 and a verified enable schedule allows the destination to capture only at edge 3. Under that specific contract, a three-cycle setup relationship may describe the design. The source data must remain suitable for the intended capture; a source that changes on intervening edges can invalidate the argument.

The setup multiplier also affects the hold relationship. In the common same-clock case, a setup multiplier N is often paired with hold N−1 to restore the intended hold edge. That is not a universal recipe across different clock periods, phases or -start/-end choices. AMD UG903 supplies separate cases for those relationships. Read the before/after launch and capture edges in the timing report.

Avoid a copy-ready command with broad get_cells wildcards until you have checked the endpoint set. A hierarchy rename, register replication or an unintended extra match can change which paths are covered. Save the expanded object list and expected count with the exception review.

The edge diagram illustrates the selected same-clock case only. It does not authorize a multicycle constraint on every path with an enable signal. If the clock definition is wrong, fix the clock model first.

Prove the exception survived the implementation

Exception review preserves both setup and hold evidenceException review preserves both setupand hold evidence01Functional proof02Selected endpoints03Setup edges04Hold edges
Original explanatory diagram. Values and assumptions are stated in the text.
report_exceptions -file exceptions.rpt
report_timing_summary -delay_type min_max -report_unconstrained \
  -check_timing_verbose -file timing-summary.rpt

Check which objects the exception matched, whether another exception superseded it and which setup/hold edges remain. Compare the full path report before and after the change. A timing summary that simply becomes green cannot establish whether the intended paths were relaxed or accidentally removed.

The decision worksheet records three facts: whether the path is functionally used, whether later capture is guaranteed and whether the edge relationship is known. It deliberately emits no wildcard XDC. Unknown answers produce a request for evidence, because syntax generation is not the difficult part of exception review.

Run the coverage audit again after every exception change. For an external interface, first complete the input/output timing budget so an exception does not conceal a missing interface model.

A useful review package contains the relevant RTL, the enable or mode proof, clock definitions, expanded endpoint lists and before/after setup and hold reports. Record the reason in the constraints file so a later refactor has something concrete to recheck.

Timing-exception evidence worksheet

Inputs and exported records stay in this browser. The check evaluates the assumptions you enter; it does not inspect your project files.

Use the worked values and equations above, or download the examples below. The interactive check requires JavaScript.

Watch the short same-clock multicycle example: capture at edge 3 sequence

The sequence visualizes the stated example. It is not a hardware capture. The static figures and text above contain the same explanation.

Same-clock multicycle example: capture at edge 3

Export the decision record and attach the expanded endpoint lists plus before/after timing reports.

Download the timing and RTL examples (ZIP) · Discuss this engineering task

The ZIP includes the clock and I/O examples, timing-audit commands, counter/latch/reset RTL and testbenches. Bring the relevant exported record to the enquiry; this page does not submit it automatically.

References and example scope

Documentation checked 16 November 2026. AMD examples use the cited 2024.1 documentation baseline. Vivado commands and vendor macros were not executed for this article. Counter, latch and illustrative reset tests were executed with Icarus Verilog; latch structure was checked with Yosys. See the included commands and validation record for the exact scope.

Back to Tutorials →

Related evidence and next tasks

Continue the task with the relevant source scope. These reading paths do not establish interchangeability or current supply.

Source addresses and citation trail

Full source addresses are retained below. Read each citation with its document revision, page, table and applicability conditions above.

  1. https://commons.wikimedia.org/wiki/File:Adapteva_Parallella_DK02_-_Zynq_(15455173526).png
  2. https://creativecommons.org/licenses/by-sa/2.0
  3. https://docs.amd.com/r/2024.1-English/ug903-vivado-using-constraints/Multicycle-Paths?contentId=X5T0qAzy9NQQcVYc9u1lLg
  4. https://docs.amd.com/r/2024.1-English/ug903-vivado-using-constraints/False-Paths?contentId=1LGfJGkub5AUcC3kp~BhZA