OPT2 - mattrighetti/leiserson-retiming GitHub Wiki

Implementation

Given a synchronous circuit graph_prop, this algorithm determines a retiming r such that clock_symbol is as small as possible.

Run algorithm OPT1 using algorithm FEAS in step 3, rather than Bellman-Ford algorithm, to test whether each potential clock period c is feasible.

See in code

Time Complexity

opt2_time_complex

⚠️ **GitHub.com Fallback** ⚠️