Exact minimization of ESOP expressions with less than eight product terms

see the original item page
in the repository's web site and access all digital files if the item*



Exact minimization of ESOP expressions with less than eight product terms (EN)

Papakonstantinou, G (EN)
Stergiou, S (EN)

journalArticle (EN)

2014-03-01T01:20:26Z
2004 (EN)


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)

Engineering, Electrical & Electronic (EN)
Computer Science, Hardware & Architecture (EN)

Subfunctions (EN)
Switching functions (EN)
AND-XOR (EN)
Heuristic methods (EN)
Minimization (EN)
Optimization (EN)
ESOP (EN)
Algorithms (EN)
Theorem proving (EN)
Logic gates (EN)
Problem solving (EN)
Exact (EN)
Exclusive-or-sum-of-products (ESOP) (EN)

Journal of Circuits, Systems and Computers (EN)

English

WORLD SCIENTIFIC PUBL CO PTE LTD (EN)




*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)