Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
asic:timing:forks [2024/02/02 11:52] – [Point-of-divergence constraint] rajit | asic:timing:forks [2024/09/03 14:06] (current) – [Relative timing] rajit | ||
---|---|---|---|
Line 26: | Line 26: | ||
There are many closely related but slightly different notions that are used in the literature to | There are many closely related but slightly different notions that are used in the literature to | ||
- | describe timing constraints in a variety of circuit contexts. | + | describe timing constraints in a variety of circuit contexts. Here we try and provide a simplified view of the differences and similarities between some common notions and timing forks. |
==== Setup and hold time ==== | ==== Setup and hold time ==== | ||
Line 50: | Line 50: | ||
==== Relative timing ==== | ==== Relative timing ==== | ||
+ | Relative timing is a methodology for designing asynchronous circuits where you can assume that | ||
+ | two signal transitions are ordered due to timing. When you assume that '' | ||
+ | there is an implicit assumption that '' | ||
+ | Timing fork theory states that if the two transitions are guaranteed to be ordered, then a timing fork/ | ||
+ | It is worth noting that a timing fork doesn' |