Static timing analysis (STA) for netlists of the LibrEDA framework.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Thomas Kramer 29da43a3af WIP: generalize delay/constraint computation 3 months ago
.reuse REUSE compliance. 5 months ago
LICENSES REUSE compliance. 5 months ago
src WIP: generalize delay/constraint computation 3 months ago
tests REUSE compliance. 5 months ago
.gitignore REUSE compliance. 5 months ago
Cargo.toml NDLM load model 3 months ago
README.md REUSE compliance. 5 months ago

README.md

LibrEDA STA (Static Timing Analysis)

LibrEDA STA implements static timing analysis algorithms for the LibrEDA framework. All STA algorithms work on the NetlistBase trait and hence are portable to other netlist data structures.

The concept of timing, delays and constraints is abstracted by a set of traits. This architecture should allow to implement simple timing models such as the non-linear delay model (NDLM) and more complicated models (such as statistical models) in a consistent way.

Documentation

Documentation can be shown with:

carco doc --open

Or alternatively found here.