A heuristic algorithm to minimize ESOPs for multiple-output incompletely specified functions

Kalathas, M; Voudouris, D; Papakonstantinou, G

dc.contributor.author	Kalathas, M	en
dc.contributor.author	Voudouris, D	en
dc.contributor.author	Papakonstantinou, G	en
dc.date.accessioned	2014-03-01T02:43:49Z
dc.date.available	2014-03-01T02:43:49Z
dc.date.issued	2006	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31519
dc.subject	ESOP	en
dc.subject	Exact minimization	en
dc.subject	Heuristic minimization	en
dc.subject	Incompletely specified functions	en
dc.subject	Multiple-valued logic	en
dc.subject.other	Algorithms	en
dc.subject.other	Formal logic	en
dc.subject.other	Functions	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Exact minimization	en
dc.subject.other	Heuristic minimization	en
dc.subject.other	Incompletely specified functions	en
dc.subject.other	Multiple-valued logic	en
dc.subject.other	Function evaluation	en
dc.title	A heuristic algorithm to minimize ESOPs for multiple-output incompletely specified functions	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/1127908.1127990	en
heal.identifier.secondary	http://dx.doi.org/10.1145/1127908.1127990	en
heal.publicationDate	2006	en
heal.abstract	In this work, a novel heuristic algorithm for the minimization of Exclusive-Or Sum Of Products (ESOP) expressions for multiple output incompletely specified functions is presented. An initial algorithm, DCMIN, uses functional decomposition and multiple-valued logic in order to produce almost minimal expressions for these functions. Based on DCMIN, an improved algorithm, QuickDCMIN. is proposed, which outperforms existing algorithms. Copyright 2006 ACM.	en
heal.journalName	Proceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI	en
dc.identifier.doi	10.1145/1127908.1127990	en
dc.identifier.volume	2006	en
dc.identifier.spage	357	en
dc.identifier.epage	361	en