HEAL DSpace

A fast and efficient heuristic ESOP minimization algorithm

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Stergiou, S en
dc.contributor.author Daskalakis, K en
dc.contributor.author Papakonstantinou, G en
dc.date.accessioned 2014-03-01T02:42:23Z
dc.date.available 2014-03-01T02:42:23Z
dc.date.issued 2004 en
dc.identifier.uri http://hdl.handle.net/123456789/30975
dc.subject ESOP XOR heuristic minimization en
dc.subject.other Algorithms en
dc.subject.other Computation theory en
dc.subject.other Computer simulation en
dc.subject.other Functions en
dc.subject.other Iterative methods en
dc.subject.other Mathematical transformations en
dc.subject.other ESOP en
dc.subject.other Heuristic minimization en
dc.subject.other XOR en
dc.subject.other Heuristic methods en
dc.title A fast and efficient heuristic ESOP minimization algorithm en
heal.type conferenceItem en
heal.identifier.primary 10.1145/988952.988971 en
heal.identifier.secondary http://dx.doi.org/10.1145/988952.988971 en
heal.publicationDate 2004 en
heal.abstract This work presents theoretical results and an efficient heuristic algorithm for minimizing single - output exclusive - or sum-of-products expressions, based on an iterative product term transformation paradigm. Experimental results verify the efficiency of the algorithm in terms of execution times and product term count of the produced expression, when compared to a state-of-the-art heuristic ESOP minimizer for single-output benchmark and randomly generated functions. en
heal.journalName Proceedings of the ACM Great Lakes Symposium on VLSI en
dc.identifier.doi 10.1145/988952.988971 en
dc.identifier.spage 78 en
dc.identifier.epage 81 en


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record