000224352 001__ 224352
000224352 005__ 20190317000615.0
000224352 020__ $$a978-3-9815370-9-3
000224352 02470 $$2ISI$$a000404171500155
000224352 037__ $$aCONF
000224352 245__ $$aBusy Man’s Synthesis: Combinational Delay Optimization With SAT
000224352 260__ $$c2017-03-31$$bIeee$$aNew York
000224352 269__ $$a2017-03-31
000224352 300__ $$a6
000224352 336__ $$aConference Papers
000224352 490__ $$aDesign Automation and Test in Europe Conference and Exhibition
000224352 500__ $$aERC Cybercare 669354 / SNF MAJesty 200021-169084 / NSF-NSA Uni Berkeley
000224352 520__ $$aBoolean SAT solving can be used to find a minimum- size logic network for a given small Boolean function. This paper extends the SAT formulation to find a minimum-size network under delay constraints. Delay constraints are given in terms of input arrival times and the maximum depth. After integration into a depth-optimizing mapping algorithm, the proposed SAT formulation can be used to perform logic rewriting to reduce the logic depth of a network. It is shown that to be effective the logic rewriting algorithm requires (i) a fast SAT formulation and (ii) heuristics to quickly determine whether the given delay constraints are feasible for a given function. The proposed algorithm is more versatile than previous algorithms, which is confirmed by the experimental results.
000224352 700__ $$g263922$$aSoeken, Mathias$$0249604
000224352 700__ $$g167918$$aDe Micheli, Giovanni$$0240269
000224352 700__ $$aMishchenko, Alan
000224352 7112_ $$dMarch 27-31, 2017$$cLausanne, Switzerland$$aDesign, Automation & Test in Europe (DATE)
000224352 773__ $$tProceedings of the Design, Automation & Test in Europe (DATE)
000224352 8560_ $$fcarole.burget@epfl.ch
000224352 8564_ $$uhttps://infoscience.epfl.ch/record/224352/files/2017_date_2.pdf$$zn/a$$s272241$$yn/a
000224352 909C0 $$xU11140$$0252283$$pLSI1
000224352 909CO $$pIC$$qGLOBAL_SET$$ooai:infoscience.tind.io:224352$$pconf$$pSTI
000224352 917Z8 $$x112915
000224352 937__ $$aEPFL-CONF-224352
000224352 973__ $$rREVIEWED$$aEPFL
000224352 980__ $$aCONF