Fast Boolean Minimizer for Completely Specified Functions

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F08%3A03142125" target="_blank" >RIV/68407700:21230/08:03142125 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/67985556:_____/08:00312223

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Fast Boolean Minimizer for Completely Specified Functions

Popis výsledku v původním jazyce

We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree is proposed as a structure enabling a very compact representation of completely specified Boolean functions. It is efficient especially for functions having many on-set terms. The minimization algorithm is thus most suited for functions described by many on set terms. Such functions emerge as a result of many algorithms used inlogic synthesis process, e.g., multi-level network collapsing, algebraic manipulation with logic functions, etc. When these functions are to be minimized, most of the state-of-the-art minimizers (Espresso) need prohibitively long time to process them, or they are even completely unusable, due to their very high memory consumption. Our algorithm is able to minimize such functions in a reasonable time, though the result quality does not reach the quality of other minimizers.

Název v anglickém jazyce

Fast Boolean Minimizer for Completely Specified Functions

Popis výsledku anglicky

We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree is proposed as a structure enabling a very compact representation of completely specified Boolean functions. It is efficient especially for functions having many on-set terms. The minimization algorithm is thus most suited for functions described by many on set terms. Such functions emerge as a result of many algorithms used inlogic synthesis process, e.g., multi-level network collapsing, algebraic manipulation with logic functions, etc. When these functions are to be minimized, most of the state-of-the-art minimizers (Espresso) need prohibitively long time to process them, or they are even completely unusable, due to their very high memory consumption. Our algorithm is able to minimize such functions in a reasonable time, though the result quality does not reach the quality of other minimizers.

Druh

D - Stať ve sborníku

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2008

Kód důvěrnosti údajů

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

Název statě ve sborníku

Proc. of 11th IEEE Design and Diagnostics of Electronic Circuits and Systems Workshop 2008 (DDECS'08)

ISBN

978-1-4244-2276-0

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

—

Název nakladatele

IEEE Computer Society Press

Místo vydání

Los Alamitos

Místo konání akce

Bratislava

Datum konání akce

16. 4. 2008

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—