Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10609/109844
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Baneres, David | - |
dc.contributor.author | Cortadella Fortuny, Jordi | - |
dc.contributor.author | Kishinevsky, Mike | - |
dc.contributor.other | Universitat Politècnica de Catalunya (UPC) | - |
dc.contributor.other | Intel Corporation | - |
dc.contributor.other | Universitat Oberta de Catalunya (UOC) | - |
dc.date.accessioned | 2020-02-18T08:24:04Z | - |
dc.date.available | 2020-02-18T08:24:04Z | - |
dc.date.issued | 2008-03-27 | - |
dc.identifier.citation | Bañeres, D., Cortadella Fortuny, J. & Kishinevsky, M. (2009). A Recursive Paradigm to Solve Boolean Relations. IEEE Transactions on Computers, 58(4), 512-527. doi: 10.1109/TC.2008.165 | es |
dc.identifier.issn | 0018-9340MIAR | - |
dc.identifier.uri | http://hdl.handle.net/10609/109844 | - |
dc.description.abstract | A Boolean relation can specify some types of flexibility of a combinational circuit that cannot be expressed with don't cares. Several problems in logic synthesis, such as Boolean decomposition or multilevel minimization, can be modeled with Boolean relations. However, solving Boolean relations is a computationally expensive task. This paper presents a novel recursive algorithm for solving Boolean relations. The algorithm has several features: efficiency, wide exploration of solutions, and customizable cost function. The experimental results show the applicability of the method in logic minimization problems and tangible improvements with regard to previous heuristic approaches. | en |
dc.format.mimetype | application/pdf | - |
dc.language.iso | eng | - |
dc.publisher | IEEE Transactions on Computers | - |
dc.relation.ispartof | IEEE Transactions on Computers, 2009, 58(4) | - |
dc.relation.uri | https://www.doi.org/10.1109/TC.2008.165 | - |
dc.subject | Boolean relations | en |
dc.subject | logic synthesis | en |
dc.subject | Boolean minimization | en |
dc.subject | decomposition | en |
dc.subject | relacions booleanes | ca |
dc.subject | relaciones booleanas | es |
dc.subject | síntesi lògica | ca |
dc.subject | síntesis lógica | es |
dc.subject | minimització booleana | ca |
dc.subject | descomposició | ca |
dc.subject | descomposición | es |
dc.subject | minimización booleana | es |
dc.subject.lcsh | Algebra, Boolean | en |
dc.title | A recursive paradigm to solve Boolean relations | en |
dc.type | info:eu-repo/semantics/article | - |
dc.subject.lemac | Àlgebra booleana | ca |
dc.subject.lcshes | Álgebra booleana | es |
dc.rights.accessRights | info:eu-repo/semantics/closedAccess | - |
dc.identifier.doi | 10.1109/TC.2008.165 | - |
dc.gir.id | AR/0000001670 | - |
dc.relation.projectID | info:eu-repo/grantAgreement/CICYT TIN2007-66523 | - |
Aparece en las colecciones: | Articles cientÍfics Articles |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
Baneres_IEEE_Recursive_Paradigm.pdf Restricted Access | 90,79 kB | Adobe PDF | Visualizar/Abrir Pedir una copia |
Comparte:
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons