The code is not very good.. :) It was more of an experiment than something that one should use in practice. (Also: It's pretty slow.)
@johnregehr I just watched your 2014 talk on Souper at UW on YouTube. Fascinating how similar it is (was at the time) to "freduce" in Yosys.
-
-
-
Because in hardware you can wire any bit anywhere it must compare bits, not words, and there are n^2/2 pairs..
- Show replies
New conversation -
-
-
Afaiu your current work goes beyond finding constants and equivalent nodes and you are synthesizing replacement code by searching the ...
-
... space of all possible programs up to length N. I have to admit I spend an unhealthy amount of time thinking about how to do that for HW.
- Show replies
New conversation -
-
-
For *finding* a candidate? Wouldn't that require a QBF solver? (Or at least unrolling a large formula for many samples of in-out space.)
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Fig. 2 looks exactly like the procedure I hinted at. (S is set of in-out samples.) I'll read the whole thing tomorrow.. Thanks for the ptr!
-
Consider this: A circuit with 32 inputs and 32 outputs but no operators, just direct connections between in- and output bits.
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.