https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Minkovich_Cong_2009aMinkovich Cong 2009a - Revision history2026-04-18T17:19:52ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Minkovich_Cong_2009a&diff=202311&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 431407218 to Minkovich Cong 2009a2021-02-02T05:35:12Z<p>Scipediacontent moved page <a href="/public/Draft_Content_431407218" class="mw-redirect" title="Draft Content 431407218">Draft Content 431407218</a> to <a href="/public/Minkovich_Cong_2009a" title="Minkovich Cong 2009a">Minkovich Cong 2009a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 05:35, 2 February 2021</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttps://www.scipedia.com/wd/index.php?title=Minkovich_Cong_2009a&diff=202310&oldid=prevScipediacontent: Created page with " == Abstract == In this paper we present a novel metric for measuring and optimizing the performance of circuits that operate with the clock period smaller than the worst-cas..."2021-02-02T05:35:06Z<p>Created page with " == Abstract == In this paper we present a novel metric for measuring and optimizing the performance of circuits that operate with the clock period smaller than the worst-cas..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
In this paper we present a novel metric for measuring and optimizing the performance of circuits that operate with the clock period smaller than the worst-case delay. In particular, we developed an efficient logic optimization operation “balance” and a library mapping algorithm named BTWLibMap. Together they are able to reduce the probability of a timing error by 2.3X while only incurring a 4% area overhead.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [http://ballade.cs.ucla.edu/~cong/papers/vlsi-dat_final_v5.pdf http://ballade.cs.ucla.edu/~cong/papers/vlsi-dat_final_v5.pdf]<br />
<br />
* [http://cadlab.cs.ucla.edu/%7Econg/papers/vlsi-dat_final_v5.pdf http://cadlab.cs.ucla.edu/%7Econg/papers/vlsi-dat_final_v5.pdf],<br />
: [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005158121 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005158121],<br />
: [https://academic.microsoft.com/#/detail/2134165615 https://academic.microsoft.com/#/detail/2134165615]<br />
<br />
* [http://xplorestaging.ieee.org/ielx5/5128899/5158074/05158121.pdf?arnumber=5158121 http://xplorestaging.ieee.org/ielx5/5128899/5158074/05158121.pdf?arnumber=5158121],<br />
: [http://dx.doi.org/10.1109/vdat.2009.5158121 http://dx.doi.org/10.1109/vdat.2009.5158121]</div>Scipediacontent