Please use this identifier to cite or link to this item:

http://hdl.handle.net/10609/109844
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBañeres Besora, David-
dc.contributor.authorCortadella Fortuny, Jordi-
dc.contributor.authorKishinevsky, Mike-
dc.contributor.otherUniversitat Politècnica de Catalunya-
dc.contributor.otherIntel Corporation-
dc.contributor.otherUniversitat Oberta de Catalunya (UOC)-
dc.date.accessioned2020-02-18T08:24:04Z-
dc.date.available2020-02-18T08:24:04Z-
dc.date.issued2008-03-27-
dc.identifier.citationBañ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.165es
dc.identifier.issn0018-9340MIAR
-
dc.identifier.urihttp://hdl.handle.net/10609/109844-
dc.description.abstractA 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.mimetypeapplication/pdf-
dc.language.isoeng-
dc.publisherIEEE Transactions on Computers-
dc.relation.ispartofIEEE Transactions on Computers, 2009, 58(4)-
dc.relation.urihttps://ieeexplore.ieee.org/document/4624246-
dc.rightsCC BY-NC-ND-
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/-
dc.subjectBoolean relationsen
dc.subjectlogic synthesisen
dc.subjectBoolean minimizationen
dc.subjectdecompositionen
dc.subjectrelacions booleanesca
dc.subjectrelaciones booleanases
dc.subjectsíntesi lògicaca
dc.subjectsíntesis lógicaes
dc.subjectminimització booleanaca
dc.subjectdescomposicióca
dc.subjectdescomposiciónes
dc.subjectminimización booleanaes
dc.subject.lcshAlgebra, Booleanen
dc.titleA recursive paradigm to solve Boolean relationsen
dc.typeinfo:eu-repo/semantics/article-
dc.typeinfo:eu-repo/semantics/acceptedVersion-
dc.subject.lemacÀlgebra booleanaca
dc.subject.lcshesÁlgebra booleanaes
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess-
dc.identifier.doi10.1109/TC.2008.165-
dc.relation.projectIDinfo:eu-repo/grantAgreement/CICYT TIN2007-66523-
Appears in Collections:Articles
Articles

Files in This Item:
File Description SizeFormat 
Baneres_IEEE_Recursive_Paradigm.pdf90.79 kBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons