MINISATION OF COMPLEXLOGICAL FUNCTIONS

Kód výsledku v IS VaVaI

RIV/63468352:_____/12:#0000274 - isvavai.cz

Výsledek na webu

http://czechuniversity.com/dokumenty/konference/2012/ICSC.pdf

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

MINISATION OF COMPLEXLOGICAL FUNCTIONS

Popis výsledku v původním jazyce

: Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-knownQuine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not guarantee an optimal solution. Since the Petrick extension of the Quine-McCluskey method does not give a generally usable method for finding an optimum for logical functions with a high number of values, we focus on interpretation of the result of the Quine-McCluskey method and show that it represents a set covering problem that, unfortunately, is an NP-hard combinatorial problem. Therefore it must be solved by heuristic or approximation methods. We propose an approach based on genetic algorithms and show suitable parameter settings.

Název v anglickém jazyce

MINISATION OF COMPLEXLOGICAL FUNCTIONS

Popis výsledku anglicky

: Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-knownQuine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not guarantee an optimal solution. Since the Petrick extension of the Quine-McCluskey method does not give a generally usable method for finding an optimum for logical functions with a high number of values, we focus on interpretation of the result of the Quine-McCluskey method and show that it represents a set covering problem that, unfortunately, is an NP-hard combinatorial problem. Therefore it must be solved by heuristic or approximation methods. We propose an approach based on genetic algorithms and show suitable parameter settings.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

N - Vyzkumna aktivita podporovana z neverejnych zdroju

Rok uplatnění

2012

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

TENTH INTERNATIONAL CONFERENCE ON SOFT COMPUTING APPLIED IN COMPUTER AND ECONOMIC ENVIRONMENTS

ISBN

978-80-7314-279-7

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

109-116

Název nakladatele

Evropský polytechnický institut, s.r.o.

Místo vydání

Kunovice

Místo konání akce

Kunovice

Datum konání akce

20. 1. 2012

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

EUR - Evropská akce

Kód UT WoS článku

—