Exact minimization of ESOP expressions with less than eight product terms

Stergiou, S; Papakonstantinou, G

dc.contributor.author	Stergiou, S	en
dc.contributor.author	Papakonstantinou, G	en
dc.date.accessioned	2014-03-01T01:20:26Z
dc.date.available	2014-03-01T01:20:26Z
dc.date.issued	2004	en
dc.identifier.issn	0218-1266	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/15920
dc.subject	AND-XOR	en
dc.subject	ESOP	en
dc.subject	Exact	en
dc.subject	Minimization	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.other	Algorithms	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Logic gates	en
dc.subject.other	Optimization	en
dc.subject.other	Switching functions	en
dc.subject.other	Theorem proving	en
dc.subject.other	AND-XOR	en
dc.subject.other	Exact	en
dc.subject.other	Exclusive-or-sum-of-products (ESOP)	en
dc.subject.other	Subfunctions	en
dc.subject.other	Problem solving	en
dc.title	Exact minimization of ESOP expressions with less than eight product terms	en
heal.type	journalArticle	en
heal.identifier.primary	10.1142/S0218126604001295	en
heal.identifier.secondary	http://dx.doi.org/10.1142/S0218126604001295	en
heal.language	English	en
heal.publicationDate	2004	en
heal.abstract	An algorithm is proposed in this paper that finds exact exclusive-or sum-of-products of an arbitrary function, provided the number of product terms is less than eight. If the number of product terms in the minimal expression is more than seven, then the algorithm detects it and heuristically returns near-optimal expressions. The algorithm is time and space efficient even for functions with many input variables.	en
heal.publisher	WORLD SCIENTIFIC PUBL CO PTE LTD	en
heal.journalName	Journal of Circuits, Systems and Computers	en
dc.identifier.doi	10.1142/S0218126604001295	en
dc.identifier.isi	ISI:000221413800001	en
dc.identifier.volume	13	en
dc.identifier.issue	1	en
dc.identifier.spage	1	en
dc.identifier.epage	15	en