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

Tutorials

Asynchronous FIFO Flags: Why Full and Empty Do Not Update Together

Published · Updated

An asynchronous FIFO has two local views

After a write, the read side can still report empty for a while. After a read frees a slot, the write side can still report full. This need not indicate corruption. Each side makes decisions using local information and a synchronized view of progress in the other domain.

Nexys 3 FPGA platform. A physical example of a board hosting clocked logic; the XPM macro details below must be checked for the actual supported target.
Nexys 3 FPGA platform. A physical example of a board hosting clocked logic; the XPM macro details below must be checked for the actual supported target. Photo: SergeMoutou. Original · CC BY-SA 4.0.

First identify which clock owns the signal you captured. A write-domain full flag and a read-domain empty flag are not two simultaneous measurements from a single global occupancy meter. Keep write attempts, accepted writes, read attempts and accepted reads separate in the trace. Also record whether either clock stopped.

Review what a single-bit synchronizer does.

Define the actual clock constraint.

Use a crossing model to understand phase, then check the IP

The timing explorer below models a registered event passing through a configurable number of destination-clock sampling stages. Move the source event across a destination edge and observe the change in visibility. An event exactly on an edge is shown as a boundary case, because a digital timestamp alone does not establish physical setup and hold margin.

Two-stage ideal sampling exampleTwo-stage ideal sampling example0 ns10 ns20 ns30 ns40 ns50 nsClockEvent 13 nsStage 1 → Stage 2Visible at 30 ns
Illustrative model and values; assumptions are stated in the adjacent text.

That model is deliberately narrower than a complete FIFO. AMD XPM_FIFO_ASYNC behavior also depends on read mode, output latency, synchronization settings and the particular flag. FIFO Generator has its own configuration and documentation. Do not convert “two synchronizer stages” into a claim that every flag changes exactly two cycles later.

Check reset release in each domain.

Capture the configuration beside the waveform

Save the exact macro or IP version, clocks, READ_MODE, configured latency and synchronization-stage count with the trace. Include reset and reset-busy indications, and wait for the documented operating condition before issuing traffic. A trace without that context can make normal startup look like a missed word.

Separate the crossing from the FIFOSeparate the crossing from the FIFO1Sampling-chain modelPhase and destination clock edges2Macro-specific behaviorRead mode, output latency, flag definition3Evidence to keepVersion, parameters, reset and clocks
Illustrative model and values; assumptions are stated in the adjacent text.

For a useful test, sweep clock ratio and phase, then pause one clock in a controlled simulation case. Verify data order with a scoreboard in addition to inspecting flags. This article does not recommend constructing a multi-bit crossing from independent single-bit synchronizers; use a reviewed FIFO architecture and its constraints.

Keep the bitstream identity.

Ideal two-stage crossing: short sequenceIdeal two-stage crossing: Source event: 13 ns; First destination capture: 20 ns; Second destination stage: 30 ns

Source event: 13 ns → First destination capture: 20 ns → Second destination stage: 30 ns

Export your result with its assumptions. For an unresolved board or implementation issue, prepare an engineering review with the exact part, revision and relevant record. This link opens the review page; it does not send your worksheet.

Sources and scope

Sources checked 18 November 2026. Numerical examples are calculated cases. Hardware measurements and device timing closure are outside the results shown here.

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:Nexys3_ILI9341.jpg
  2. https://creativecommons.org/licenses/by-sa/4.0
  3. https://docs.amd.com/r/en-US/ug953-vivado-7series-libraries/XPM_FIFO_ASYNC?contentId=O6Ortty4YAxM2a8gENHM9w
  4. https://docs.amd.com/api/khub/documents/Ds0JjAYlvIFpRMxJMOrbRw/content
  5. https://zipcpu.com/blog/2018/07/06/afifo.html