Exact ESOP expressions for incompletely specified functions

Sampson, M; Kalathas, M; Voudouris, D; Papakonstantinou, G

dc.contributor.author	Sampson, M	en
dc.contributor.author	Kalathas, M	en
dc.contributor.author	Voudouris, D	en
dc.contributor.author	Papakonstantinou, G	en
dc.date.accessioned	2014-03-01T02:08:58Z
dc.date.available	2014-03-01T02:08:58Z
dc.date.issued	2012	en
dc.identifier.issn	01679260	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/29751
dc.subject	Do not cares	en
dc.subject	ESOP	en
dc.subject	Minimization	en
dc.subject	Six variables	en
dc.subject.other	Computation time	en
dc.subject.other	Do not cares	en
dc.subject.other	ESOP	en
dc.subject.other	Exact solution	en
dc.subject.other	Incompletely specified functions	en
dc.subject.other	Input variables	en
dc.subject.other	Six variables	en
dc.subject.other	Hardware	en
dc.subject.other	Optimization	en
dc.subject.other	Software engineering	en
dc.subject.other	Boolean functions	en
dc.title	Exact ESOP expressions for incompletely specified functions	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.vlsi.2011.10.001	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.vlsi.2011.10.001	en
heal.publicationDate	2012	en
heal.abstract	In this paper, a method for finding an exact ESOP expression for an incompletely specified arbitrary boolean function of up to six input variables is proposed. To achieve this, the weight of all 5-variable functions, has been tabulated in a compressed table, which is used extensively in our approach and speeds-up computation time. To the best of our knowledge, this is the first paper dealing with exact solutions of incompletely specified functions. © 2011 Elsevier B.V. All rights reserved.	en
heal.journalName	Integration, the VLSI Journal	en
dc.identifier.doi	10.1016/j.vlsi.2011.10.001	en
dc.identifier.volume	45	en
dc.identifier.issue	2	en
dc.identifier.spage	197	en
dc.identifier.epage	204	en