Timeline for Algorithms for logical synthesis of multiple output bits?
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Oct 22, 2016 at 11:54 | history | bounty ended | Evil | ||
| S Oct 22, 2016 at 11:54 | history | notice removed | Evil | ||
| Oct 22, 2016 at 1:12 | comment | added | Alan Wolfe | Yes it does. Thanks for brining more attention to this Evil with the bounty, much appreciated (: | |
| Oct 22, 2016 at 0:27 | comment | added | Evil | Accepted answer was helpful and clear? Does the article suit your needs? | |
| Oct 16, 2016 at 2:51 | vote | accept | Alan Wolfe | ||
| Oct 16, 2016 at 2:03 | answer | added | vzn | timeline score: 4 | |
| Oct 16, 2016 at 0:39 | history | tweeted | twitter.com/StackCompSci/status/787452831766896641 | ||
| Oct 15, 2016 at 22:34 | history | edited | Evil |
edited tags
|
|
| S Oct 15, 2016 at 22:14 | history | bounty started | Evil | ||
| S Oct 15, 2016 at 22:14 | history | notice added | Evil | Draw attention | |
| Dec 22, 2015 at 21:19 | comment | added | AProgrammer | My point being that EDA optimization starts with such boolean optimization and then maps boolean formula to gates (taking into account things other than just an abstract minimal expression like available gates in the library, timing constraints, physical position, ...). I doubt very much that the field has not progressed since 25 years ago and I'd be surprised that all progress was in taking the other factors into account. | |
| Dec 22, 2015 at 21:03 | comment | added | AProgrammer | Did you look in EDA related publications (proceedings of conferences like DAC, IEEE publications)? I know there has been work with BDD as well. | |
| Dec 22, 2015 at 20:43 | comment | added | Alan Wolfe | I can't find any more advanced algorithms on my own. Espresso and Espresso-exact (mincov) seem to be all I can find. Apparently espresso-exact uses a "tiling" algorithm, and the tiling problem is NP-Complete, so maybe espresso-exact (mincov) is the best algorithm known so far still? The info was useful, thanks for sharing (: | |
| Dec 21, 2015 at 12:59 | comment | added | AProgrammer | 25 years ago, I'd have suggested you to search for papers from IBM/ Berkeley about "Espresso". I can just guess that there are better things nowadays. | |
| Dec 21, 2015 at 1:00 | history | asked | Alan Wolfe | CC BY-SA 3.0 |