luke
/
yosys
mirror of https://github.com/YosysHQ/yosys.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Added to notes.txt

This commit is contained in:
AdvaySingh1 2026-02-11 14:22:26 -08:00
parent d2300b2a9f
commit da8febc3b7
1 changed files with 8 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
notes.txt
View File

@ -58,6 +58,9 @@ Algorithm version one:
This version doesn't take into accound the threshold (doesn't try and insert)
the same CE into multiple different clocks, it also doesn't do any pre SAT simulation
optimization. Fruthermore, it also doesn't try and find the minimal set, just a set.
Lastly, this also does a form of safe clock gating which means that:
input_set == 0 -> D == Q
Which means there's cases when input_set may be 1 but D != Q
// determines if the input set serves as an enable
input_set_is_en(input_set, D, Q):
@ -153,4 +156,8 @@ Exit a set of inputs such that COI <-> D != Q
The final equation for the UNSAT is:
((D != Q) != (COI)) -> UNSAT => COI = (D != Q)
Exists COI such that ((D ^ Q) ^ (COI)) -> UNSAT
Exists COI such that ((D ^ Q) ^ (COI)) -> UNSAT
So in the new pseudo code algorithm, once the pool<SigBit> is populated (the input_set),
we create this miter with the exestential quantization with the input_set.