Minimization of Modulo2 Sum of Products

Papakonstantinou, G

dc.contributor.author	Papakonstantinou, G	en
dc.date.accessioned	2014-03-01T01:37:57Z
dc.date.available	2014-03-01T01:37:57Z
dc.date.issued	1979	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/21865
dc.subject	Logic Design	en
dc.subject	Sum of Products	en
dc.title	Minimization of Modulo2 Sum of Products	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/TC.1979.1675308	en
heal.identifier.secondary	http://dx.doi.org/10.1109/TC.1979.1675308	en
heal.publicationDate	1979	en
heal.abstract	This correspondence attempts to solve the problem of expressing an arbitrary switching function in a modulo-2 sum-of-product terms form, having a minimum number of product terms. Each product term may contain variables in complemented or uncomplemented form.	en
heal.journalName	IEEE Transactions on Computers	en
dc.identifier.doi	10.1109/TC.1979.1675308	en