A SOP Minimizer for Logic Functions Described by Many Product Terms Based on Ternary Trees

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F10%3A00169623" target="_blank" >RIV/68407700:21230/10:00169623 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21240/10:00169623
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
A SOP Minimizer for Logic Functions Described by Many Product Terms Based on Ternary Trees
Original language description
We introduce a new efficient minimization method for functions described by many (up to millions) product terms. The algorithm is based on processing a newly proposed efficient representation of a set of product terms - a ternary tree. The minimization procedure is based on a fast application of basic Boolean operations upon the ternary tree, combined with algorithms used in the Espresso minimizer. Minimization of incompletely specified functions is supported as well. The minimization method was testedon randomly generated large sums-of-products and collapsed ISCAS benchmark circuits. The performance of the proposed algorithm was compared with Espresso.
Czech name
—
Czech description
—

Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 9th International Workshop on Boolean Problems
ISBN
978-3-86012-404-8
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
Freiberg University of Mining and Technology, Institute of Computer Science
Place of publication
Freiberg
Event location
Freiberg
Event date
Sep 16, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)