About: Fast Boolean Minimizer for Completely Specified Functions

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Fast Boolean Minimizer for Completely Specified Functions Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Rychlá minimalizace kompletně zadaných logických funkcí pomocí binárních rozhodovacích diagramů. (cs) 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. The minimization algorithm is thus most suited for functions described by many on-set terms. 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. Here our minimizer found its application as a pre-processor that, when run prior to, e.g., Espresso, significantly reduces total minimization time, while fully retaining the result quality. 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. The minimization algorithm is thus most suited for functions described by many on-set terms. 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. Here our minimizer found its application as a pre-processor that, when run prior to, e.g., Espresso, significantly reduces total minimization time, while fully retaining the result quality. (en)
Title	Fast Boolean Minimizer for Completely Specified Functions Fast Boolean Minimizer for Completely Specified Functions (en) Rychlá minimalizace kompletně zadaných logických funkcí (cs)
skos:prefLabel	Fast Boolean Minimizer for Completely Specified Functions Fast Boolean Minimizer for Completely Specified Functions (en) Rychlá minimalizace kompletně zadaných logických funkcí (cs)
skos:notation	RIV/67985556:_____/08:00312223!RIV09-AV0-67985556
http://linked.open...avai/riv/aktivita	Z
http://linked.open...avai/riv/aktivity	Z(AV0Z10750506), Z(MSM6840770014)
http://linked.open...vai/riv/dodaniDat	2009
http://linked.open...aciTvurceVysledku	Horáčková, Irena
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Ústav teorie informace a automatizace AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	367690
http://linked.open...ai/riv/idVysledku	RIV/67985556:_____/08:00312223
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	boolean function; minimalization; binary decision diagram (en)
http://linked.open.../riv/klicoveSlovo	minimalization boolean function binary decision diagram
http://linked.open...ontrolniKodProRIV	[CE61A306B45A]
http://linked.open...v/mistoKonaniAkce	Bratislava
http://linked.open...i/riv/mistoVydani	Los Alamitos
http://linked.open...i/riv/nazevZdroje	Proc. of 11th IEEE Design and Diagnostics of Electronic Circuits and Systems Workshop 2008
http://linked.open...in/vavai/riv/obor	BD
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...UplatneniVysledku	2008
http://linked.open...iv/tvurceVysledku	Váňová, Irena Fišer, P. Rucký, P.
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000256936300025
http://linked.open.../riv/zahajeniAkce	2008-04-16 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Pokročilé matematické metody získávání, zpracování a využití informací a znalostí ve složitých a nedeterministických systémech Výzkum perspektivních informačních a komunikačních technologií
number of pages	6 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE
https://schema.org/isbn	978-1-4244-2276-0
is http://linked.open...avai/riv/vysledek of	Fast Boolean Minimizer for Completely Specified Functions Fast Boolean Minimizer for Completely Specified Functions Fast Boolean Minimizer for Completely Specified Functions Fast Boolean Minimizer for Completely Specified Functions

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software