Asynchronous sum-of-products logic minimization and orthogonalization

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F14%3A00219387" target="_blank" >RIV/68407700:21240/14:00219387 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1002/cta.1870" target="_blank" >http://dx.doi.org/10.1002/cta.1870</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/cta.1870" target="_blank" >10.1002/cta.1870</a>

Result language
angličtina
Original language name
Asynchronous sum-of-products logic minimization and orthogonalization
Original language description
We propose a method of the asynchronous sum-of-products (SOP) logic simplification that comprises of minimization and orthogonalization. The method is based on a transformation of the conventional single-rail SOP synchronous logic into the dual-rail asynchronous one operating under so-called modified weak constraints. We formulate and prove the product terms constraint that ensures a correct logic behavior. We have processed the MCNC benchmarks and generated the asynchronous SOP logic. The complexity ofthe logic obtained is compared with the state-of-the-art representation. Using our approach, we achieve a significant improvement. Copyright 2012 John Wiley & Sons, Ltd.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—

Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)